TSTP Solution File: LCL230-3 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : LCL230-3 : TPTP v8.1.2. Released v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n004.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 2400s
% WCLimit : 300s
% DateTime : Tue Oct 10 18:12:06 EDT 2023
% Result : Unsatisfiable 0.17s 0.83s
% Output : CNFRefutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 8
% Syntax : Number of clauses : 41 ( 21 unt; 0 nHn; 20 RR)
% Number of literals : 69 ( 2 equ; 32 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 86 ( 7 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(rule_2,axiom,
( theorem(X1)
| ~ theorem(implies(X2,X1))
| ~ theorem(X2) ),
file('/export/starexec/sandbox/tmp/tmp.l14qqHWl1y/E---3.1_6644.p',rule_2) ).
cnf(implies_definition,axiom,
implies(X1,X2) = or(not(X1),X2),
file('/export/starexec/sandbox/tmp/tmp.l14qqHWl1y/E---3.1_6644.p',implies_definition) ).
cnf(rule_1,axiom,
( theorem(X1)
| ~ axiom(X1) ),
file('/export/starexec/sandbox/tmp/tmp.l14qqHWl1y/E---3.1_6644.p',rule_1) ).
cnf(axiom_1_6,axiom,
axiom(implies(implies(X1,X2),implies(or(X3,X1),or(X3,X2)))),
file('/export/starexec/sandbox/tmp/tmp.l14qqHWl1y/E---3.1_6644.p',axiom_1_6) ).
cnf(axiom_1_5,axiom,
axiom(implies(or(X1,or(X2,X3)),or(X2,or(X1,X3)))),
file('/export/starexec/sandbox/tmp/tmp.l14qqHWl1y/E---3.1_6644.p',axiom_1_5) ).
cnf(axiom_1_3,axiom,
axiom(implies(X1,or(X2,X1))),
file('/export/starexec/sandbox/tmp/tmp.l14qqHWl1y/E---3.1_6644.p',axiom_1_3) ).
cnf(axiom_1_2,axiom,
axiom(implies(or(X1,X1),X1)),
file('/export/starexec/sandbox/tmp/tmp.l14qqHWl1y/E---3.1_6644.p',axiom_1_2) ).
cnf(prove_this,negated_conjecture,
~ theorem(implies(implies(or(p,q),or(p,r)),or(p,implies(q,r)))),
file('/export/starexec/sandbox/tmp/tmp.l14qqHWl1y/E---3.1_6644.p',prove_this) ).
cnf(c_0_8,axiom,
( theorem(X1)
| ~ theorem(implies(X2,X1))
| ~ theorem(X2) ),
rule_2 ).
cnf(c_0_9,axiom,
implies(X1,X2) = or(not(X1),X2),
implies_definition ).
cnf(c_0_10,plain,
( theorem(X1)
| ~ theorem(X2)
| ~ theorem(or(not(X2),X1)) ),
inference(rw,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_11,axiom,
( theorem(X1)
| ~ axiom(X1) ),
rule_1 ).
cnf(c_0_12,axiom,
axiom(implies(implies(X1,X2),implies(or(X3,X1),or(X3,X2)))),
axiom_1_6 ).
cnf(c_0_13,axiom,
axiom(implies(or(X1,or(X2,X3)),or(X2,or(X1,X3)))),
axiom_1_5 ).
cnf(c_0_14,axiom,
axiom(implies(X1,or(X2,X1))),
axiom_1_3 ).
cnf(c_0_15,plain,
( theorem(X1)
| ~ theorem(X2)
| ~ axiom(or(not(X2),X1)) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_16,plain,
axiom(or(not(or(not(X1),X2)),or(not(or(X3,X1)),or(X3,X2)))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_12,c_0_9]),c_0_9]),c_0_9]) ).
cnf(c_0_17,axiom,
axiom(implies(or(X1,X1),X1)),
axiom_1_2 ).
cnf(c_0_18,plain,
axiom(or(not(or(X1,or(X2,X3))),or(X2,or(X1,X3)))),
inference(rw,[status(thm)],[c_0_13,c_0_9]) ).
cnf(c_0_19,plain,
axiom(or(not(X1),or(X2,X1))),
inference(rw,[status(thm)],[c_0_14,c_0_9]) ).
cnf(c_0_20,plain,
( theorem(or(not(or(X1,X2)),or(X1,X3)))
| ~ theorem(or(not(X2),X3)) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_21,plain,
axiom(or(not(or(X1,X1)),X1)),
inference(rw,[status(thm)],[c_0_17,c_0_9]) ).
cnf(c_0_22,plain,
( theorem(or(X1,or(X2,X3)))
| ~ theorem(or(X2,or(X1,X3))) ),
inference(spm,[status(thm)],[c_0_15,c_0_18]) ).
cnf(c_0_23,plain,
( theorem(or(X1,X2))
| ~ theorem(X2) ),
inference(spm,[status(thm)],[c_0_15,c_0_19]) ).
cnf(c_0_24,plain,
( theorem(or(X1,X2))
| ~ theorem(or(not(X3),X2))
| ~ theorem(or(X1,X3)) ),
inference(spm,[status(thm)],[c_0_10,c_0_20]) ).
cnf(c_0_25,plain,
( theorem(X1)
| ~ theorem(or(X1,X1)) ),
inference(spm,[status(thm)],[c_0_15,c_0_21]) ).
cnf(c_0_26,plain,
( theorem(or(X1,or(X2,X3)))
| ~ theorem(or(X1,X3)) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_27,plain,
( theorem(or(X1,or(X2,X3)))
| ~ theorem(or(X1,or(X2,X4)))
| ~ theorem(or(not(X4),X3)) ),
inference(spm,[status(thm)],[c_0_24,c_0_20]) ).
cnf(c_0_28,plain,
( theorem(or(X1,X2))
| ~ theorem(or(or(X1,X2),X2)) ),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_29,plain,
( theorem(or(X1,or(X2,X3)))
| ~ axiom(or(X2,or(X1,X3))) ),
inference(spm,[status(thm)],[c_0_22,c_0_11]) ).
cnf(c_0_30,negated_conjecture,
~ theorem(implies(implies(or(p,q),or(p,r)),or(p,implies(q,r)))),
prove_this ).
cnf(c_0_31,plain,
( theorem(or(X1,or(X2,X3)))
| ~ theorem(or(not(X4),X3))
| ~ axiom(or(X1,or(X2,X4))) ),
inference(spm,[status(thm)],[c_0_27,c_0_11]) ).
cnf(c_0_32,plain,
( theorem(or(X1,or(X2,X3)))
| ~ axiom(or(X2,or(or(X1,or(X2,X3)),X3))) ),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_33,negated_conjecture,
~ theorem(or(not(or(not(or(p,q)),or(p,r))),or(p,or(not(q),r)))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_30,c_0_9]),c_0_9]),c_0_9]) ).
cnf(c_0_34,plain,
( theorem(or(not(or(X1,or(X2,X3))),or(X2,X4)))
| ~ theorem(or(not(or(X1,X3)),X4)) ),
inference(spm,[status(thm)],[c_0_31,c_0_18]) ).
cnf(c_0_35,plain,
( theorem(or(X1,X2))
| ~ theorem(X3)
| ~ axiom(or(X1,or(not(X3),X2))) ),
inference(spm,[status(thm)],[c_0_10,c_0_29]) ).
cnf(c_0_36,plain,
theorem(or(X1,or(not(X2),X2))),
inference(spm,[status(thm)],[c_0_32,c_0_19]) ).
cnf(c_0_37,negated_conjecture,
~ theorem(or(not(or(not(or(p,q)),r)),or(not(q),r))),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_38,plain,
( theorem(or(not(or(not(X1),X2)),or(X3,X2)))
| ~ theorem(or(X3,X1)) ),
inference(spm,[status(thm)],[c_0_35,c_0_16]) ).
cnf(c_0_39,plain,
theorem(or(not(X1),or(X2,X1))),
inference(spm,[status(thm)],[c_0_22,c_0_36]) ).
cnf(c_0_40,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_39])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : LCL230-3 : TPTP v8.1.2. Released v2.3.0.
% 0.06/0.12 % Command : run_E %s %d THM
% 0.11/0.32 % Computer : n004.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 2400
% 0.11/0.32 % WCLimit : 300
% 0.11/0.32 % DateTime : Mon Oct 2 12:01:00 EDT 2023
% 0.11/0.32 % CPUTime :
% 0.17/0.44 Running first-order theorem proving
% 0.17/0.44 Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/tmp/tmp.l14qqHWl1y/E---3.1_6644.p
% 0.17/0.83 # Version: 3.1pre001
% 0.17/0.83 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.17/0.83 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.83 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.17/0.83 # Starting new_bool_3 with 300s (1) cores
% 0.17/0.83 # Starting new_bool_1 with 300s (1) cores
% 0.17/0.83 # Starting sh5l with 300s (1) cores
% 0.17/0.83 # G-E--_302_C18_F1_URBAN_RG_S04BN with pid 6745 completed with status 0
% 0.17/0.83 # Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 0.17/0.83 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.17/0.83 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.83 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.17/0.83 # No SInE strategy applied
% 0.17/0.83 # Search class: FHUNM-FFSF21-MFFFFFNN
% 0.17/0.83 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.17/0.83 # Starting G----_Z1410__C12_02_nc_F1_AE_CS_SP_S2S with 811s (1) cores
% 0.17/0.83 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.17/0.83 # Starting new_bool_3 with 136s (1) cores
% 0.17/0.83 # Starting new_bool_1 with 136s (1) cores
% 0.17/0.83 # Starting C12_02_nc_SAT001_MinMin_p005000_rr with 136s (1) cores
% 0.17/0.83 # G-E--_302_C18_F1_URBAN_RG_S04BN with pid 6757 completed with status 0
% 0.17/0.83 # Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 0.17/0.83 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.17/0.83 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.83 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.17/0.83 # No SInE strategy applied
% 0.17/0.83 # Search class: FHUNM-FFSF21-MFFFFFNN
% 0.17/0.83 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.17/0.83 # Starting G----_Z1410__C12_02_nc_F1_AE_CS_SP_S2S with 811s (1) cores
% 0.17/0.83 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.17/0.83 # Preprocessing time : 0.017 s
% 0.17/0.83
% 0.17/0.83 # Proof found!
% 0.17/0.83 # SZS status Unsatisfiable
% 0.17/0.83 # SZS output start CNFRefutation
% See solution above
% 0.17/0.83 # Parsed axioms : 9
% 0.17/0.83 # Removed by relevancy pruning/SinE : 0
% 0.17/0.83 # Initial clauses : 9
% 0.17/0.83 # Removed in clause preprocessing : 1
% 0.17/0.83 # Initial clauses in saturation : 8
% 0.17/0.83 # Processed clauses : 1865
% 0.17/0.83 # ...of these trivial : 17
% 0.17/0.83 # ...subsumed : 1145
% 0.17/0.83 # ...remaining for further processing : 703
% 0.17/0.83 # Other redundant clauses eliminated : 0
% 0.17/0.83 # Clauses deleted for lack of memory : 0
% 0.17/0.83 # Backward-subsumed : 26
% 0.17/0.83 # Backward-rewritten : 1
% 0.17/0.83 # Generated clauses : 18762
% 0.17/0.83 # ...of the previous two non-redundant : 18352
% 0.17/0.83 # ...aggressively subsumed : 0
% 0.17/0.83 # Contextual simplify-reflections : 0
% 0.17/0.83 # Paramodulations : 18762
% 0.17/0.83 # Factorizations : 0
% 0.17/0.83 # NegExts : 0
% 0.17/0.83 # Equation resolutions : 0
% 0.17/0.83 # Total rewrite steps : 315
% 0.17/0.83 # Propositional unsat checks : 0
% 0.17/0.83 # Propositional check models : 0
% 0.17/0.83 # Propositional check unsatisfiable : 0
% 0.17/0.83 # Propositional clauses : 0
% 0.17/0.83 # Propositional clauses after purity: 0
% 0.17/0.83 # Propositional unsat core size : 0
% 0.17/0.83 # Propositional preprocessing time : 0.000
% 0.17/0.83 # Propositional encoding time : 0.000
% 0.17/0.83 # Propositional solver time : 0.000
% 0.17/0.83 # Success case prop preproc time : 0.000
% 0.17/0.83 # Success case prop encoding time : 0.000
% 0.17/0.83 # Success case prop solver time : 0.000
% 0.17/0.83 # Current number of processed clauses : 676
% 0.17/0.83 # Positive orientable unit clauses : 34
% 0.17/0.83 # Positive unorientable unit clauses: 0
% 0.17/0.83 # Negative unit clauses : 95
% 0.17/0.83 # Non-unit-clauses : 547
% 0.17/0.83 # Current number of unprocessed clauses: 16423
% 0.17/0.83 # ...number of literals in the above : 51330
% 0.17/0.83 # Current number of archived formulas : 0
% 0.17/0.83 # Current number of archived clauses : 28
% 0.17/0.83 # Clause-clause subsumption calls (NU) : 54122
% 0.17/0.83 # Rec. Clause-clause subsumption calls : 47175
% 0.17/0.83 # Non-unit clause-clause subsumptions : 1033
% 0.17/0.83 # Unit Clause-clause subsumption calls : 2215
% 0.17/0.83 # Rewrite failures with RHS unbound : 0
% 0.17/0.83 # BW rewrite match attempts : 809
% 0.17/0.83 # BW rewrite match successes : 3
% 0.17/0.83 # Condensation attempts : 0
% 0.17/0.83 # Condensation successes : 0
% 0.17/0.83 # Termbank termtop insertions : 318773
% 0.17/0.83
% 0.17/0.83 # -------------------------------------------------
% 0.17/0.83 # User time : 0.371 s
% 0.17/0.83 # System time : 0.012 s
% 0.17/0.83 # Total time : 0.383 s
% 0.17/0.83 # Maximum resident set size: 1652 pages
% 0.17/0.83
% 0.17/0.83 # -------------------------------------------------
% 0.17/0.83 # User time : 1.752 s
% 0.17/0.83 # System time : 0.034 s
% 0.17/0.83 # Total time : 1.785 s
% 0.17/0.83 # Maximum resident set size: 1680 pages
% 0.17/0.83 % E---3.1 exiting
% 0.17/0.84 % E---3.1 exiting
%------------------------------------------------------------------------------