TSTP Solution File: LCL214-1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : LCL214-1 : TPTP v8.2.0. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n025.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 : 300s
% WCLimit : 300s
% DateTime : Mon May 20 23:45:33 EDT 2024
% Result : Unsatisfiable 0.84s 0.58s
% Output : CNFRefutation 0.84s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 8
% Syntax : Number of clauses : 33 ( 18 unt; 0 nHn; 18 RR)
% Number of literals : 54 ( 0 equ; 24 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-1 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 63 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(rule_2,axiom,
( theorem(X1)
| ~ axiom(or(not(X2),X1))
| ~ theorem(X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL003-0.ax',rule_2) ).
cnf(axiom_1_4,axiom,
axiom(or(not(or(X1,X2)),or(X2,X1))),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL003-0.ax',axiom_1_4) ).
cnf(rule_1,axiom,
( theorem(X1)
| ~ axiom(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL003-0.ax',rule_1) ).
cnf(axiom_1_2,axiom,
axiom(or(not(or(X1,X1)),X1)),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL003-0.ax',axiom_1_2) ).
cnf(rule_3,axiom,
( theorem(or(not(X1),X2))
| ~ axiom(or(not(X1),X3))
| ~ theorem(or(not(X3),X2)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL003-0.ax',rule_3) ).
cnf(axiom_1_6,axiom,
axiom(or(not(or(not(X1),X2)),or(not(or(X3,X1)),or(X3,X2)))),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL003-0.ax',axiom_1_6) ).
cnf(axiom_1_5,axiom,
axiom(or(not(or(X1,or(X2,X3))),or(X2,or(X1,X3)))),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL003-0.ax',axiom_1_5) ).
cnf(prove_this,negated_conjecture,
~ theorem(or(not(or(p,q)),or(not(or(not(p),q)),q))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).
cnf(c_0_8,plain,
( theorem(X1)
| ~ axiom(or(not(X2),X1))
| ~ theorem(X2) ),
inference(fof_simplification,[status(thm)],[rule_2]) ).
cnf(c_0_9,plain,
( theorem(X1)
| ~ axiom(or(not(X2),X1))
| ~ theorem(X2) ),
c_0_8 ).
cnf(c_0_10,axiom,
axiom(or(not(or(X1,X2)),or(X2,X1))),
axiom_1_4 ).
cnf(c_0_11,plain,
( theorem(X1)
| ~ axiom(X1) ),
inference(fof_simplification,[status(thm)],[rule_1]) ).
cnf(c_0_12,plain,
( theorem(or(X1,X2))
| ~ theorem(or(X2,X1)) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_13,plain,
( theorem(X1)
| ~ axiom(X1) ),
c_0_11 ).
cnf(c_0_14,plain,
( theorem(or(X1,X2))
| ~ axiom(or(X2,X1)) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_15,axiom,
axiom(or(not(or(X1,X1)),X1)),
axiom_1_2 ).
cnf(c_0_16,plain,
( theorem(or(not(X1),X2))
| ~ axiom(or(not(X1),X3))
| ~ theorem(or(not(X3),X2)) ),
inference(fof_simplification,[status(thm)],[rule_3]) ).
cnf(c_0_17,axiom,
axiom(or(not(or(not(X1),X2)),or(not(or(X3,X1)),or(X3,X2)))),
axiom_1_6 ).
cnf(c_0_18,plain,
theorem(or(X1,not(or(X1,X1)))),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_19,plain,
( theorem(or(not(X1),X2))
| ~ axiom(or(not(X1),X3))
| ~ theorem(or(not(X3),X2)) ),
c_0_16 ).
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_9,c_0_17]) ).
cnf(c_0_21,plain,
theorem(or(not(or(X1,X1)),X1)),
inference(spm,[status(thm)],[c_0_12,c_0_18]) ).
cnf(c_0_22,axiom,
axiom(or(not(or(X1,or(X2,X3))),or(X2,or(X1,X3)))),
axiom_1_5 ).
cnf(c_0_23,plain,
( theorem(or(not(or(not(X1),X2)),X3))
| ~ theorem(or(not(or(not(or(X4,X1)),or(X4,X2))),X3)) ),
inference(spm,[status(thm)],[c_0_19,c_0_17]) ).
cnf(c_0_24,plain,
theorem(or(not(or(X1,or(X2,X2))),or(X1,X2))),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_25,plain,
( theorem(or(X1,or(X2,X3)))
| ~ theorem(or(X2,or(X1,X3))) ),
inference(spm,[status(thm)],[c_0_9,c_0_22]) ).
cnf(c_0_26,plain,
theorem(or(not(or(not(X1),X2)),or(not(or(X2,X1)),X2))),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_27,negated_conjecture,
~ theorem(or(not(or(p,q)),or(not(or(not(p),q)),q))),
inference(fof_simplification,[status(thm)],[prove_this]) ).
cnf(c_0_28,plain,
( theorem(or(not(or(X1,X2)),X3))
| ~ theorem(or(not(or(X2,X1)),X3)) ),
inference(spm,[status(thm)],[c_0_19,c_0_10]) ).
cnf(c_0_29,plain,
theorem(or(not(or(X1,X2)),or(not(or(not(X2),X1)),X1))),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_30,negated_conjecture,
~ theorem(or(not(or(p,q)),or(not(or(not(p),q)),q))),
c_0_27 ).
cnf(c_0_31,plain,
theorem(or(not(or(X1,X2)),or(not(or(not(X1),X2)),X2))),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_32,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_30,c_0_31])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : LCL214-1 : TPTP v8.2.0. Released v1.1.0.
% 0.13/0.14 % Command : run_E %s %d THM
% 0.15/0.36 % Computer : n025.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Mon May 20 02:25:23 EDT 2024
% 0.15/0.36 % CPUTime :
% 0.21/0.49 Running first-order theorem proving
% 0.21/0.49 Running: /export/starexec/sandbox2/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/sandbox2/benchmark/theBenchmark.p
% 0.84/0.58 # Version: 3.1.0
% 0.84/0.58 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.84/0.58 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.84/0.58 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.84/0.58 # Starting new_bool_3 with 300s (1) cores
% 0.84/0.58 # Starting new_bool_1 with 300s (1) cores
% 0.84/0.58 # Starting sh5l with 300s (1) cores
% 0.84/0.58 # new_bool_3 with pid 18561 completed with status 0
% 0.84/0.58 # Result found by new_bool_3
% 0.84/0.58 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.84/0.58 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.84/0.58 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.84/0.58 # Starting new_bool_3 with 300s (1) cores
% 0.84/0.58 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.84/0.58 # Search class: FHUNM-FFSF21-MFFFFFNN
% 0.84/0.58 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.84/0.58 # Starting G----_Z1410__C12_02_nc_F1_AE_CS_SP_S2S with 181s (1) cores
% 0.84/0.58 # G----_Z1410__C12_02_nc_F1_AE_CS_SP_S2S with pid 18566 completed with status 0
% 0.84/0.58 # Result found by G----_Z1410__C12_02_nc_F1_AE_CS_SP_S2S
% 0.84/0.58 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.84/0.58 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.84/0.58 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.84/0.58 # Starting new_bool_3 with 300s (1) cores
% 0.84/0.58 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.84/0.58 # Search class: FHUNM-FFSF21-MFFFFFNN
% 0.84/0.58 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.84/0.58 # Starting G----_Z1410__C12_02_nc_F1_AE_CS_SP_S2S with 181s (1) cores
% 0.84/0.58 # Preprocessing time : 0.001 s
% 0.84/0.58 # Presaturation interreduction done
% 0.84/0.58
% 0.84/0.58 # Proof found!
% 0.84/0.58 # SZS status Unsatisfiable
% 0.84/0.58 # SZS output start CNFRefutation
% See solution above
% 0.84/0.58 # Parsed axioms : 9
% 0.84/0.58 # Removed by relevancy pruning/SinE : 0
% 0.84/0.58 # Initial clauses : 9
% 0.84/0.58 # Removed in clause preprocessing : 0
% 0.84/0.58 # Initial clauses in saturation : 9
% 0.84/0.58 # Processed clauses : 741
% 0.84/0.58 # ...of these trivial : 32
% 0.84/0.58 # ...subsumed : 65
% 0.84/0.58 # ...remaining for further processing : 644
% 0.84/0.58 # Other redundant clauses eliminated : 0
% 0.84/0.58 # Clauses deleted for lack of memory : 0
% 0.84/0.58 # Backward-subsumed : 0
% 0.84/0.58 # Backward-rewritten : 1
% 0.84/0.58 # Generated clauses : 3726
% 0.84/0.58 # ...of the previous two non-redundant : 2305
% 0.84/0.58 # ...aggressively subsumed : 0
% 0.84/0.58 # Contextual simplify-reflections : 0
% 0.84/0.58 # Paramodulations : 3726
% 0.84/0.58 # Factorizations : 0
% 0.84/0.58 # NegExts : 0
% 0.84/0.58 # Equation resolutions : 0
% 0.84/0.58 # Disequality decompositions : 0
% 0.84/0.58 # Total rewrite steps : 1443
% 0.84/0.58 # ...of those cached : 470
% 0.84/0.58 # Propositional unsat checks : 0
% 0.84/0.58 # Propositional check models : 0
% 0.84/0.58 # Propositional check unsatisfiable : 0
% 0.84/0.58 # Propositional clauses : 0
% 0.84/0.58 # Propositional clauses after purity: 0
% 0.84/0.58 # Propositional unsat core size : 0
% 0.84/0.58 # Propositional preprocessing time : 0.000
% 0.84/0.58 # Propositional encoding time : 0.000
% 0.84/0.58 # Propositional solver time : 0.000
% 0.84/0.58 # Success case prop preproc time : 0.000
% 0.84/0.58 # Success case prop encoding time : 0.000
% 0.84/0.58 # Success case prop solver time : 0.000
% 0.84/0.58 # Current number of processed clauses : 634
% 0.84/0.58 # Positive orientable unit clauses : 575
% 0.84/0.58 # Positive unorientable unit clauses: 0
% 0.84/0.58 # Negative unit clauses : 9
% 0.84/0.58 # Non-unit-clauses : 50
% 0.84/0.58 # Current number of unprocessed clauses: 1582
% 0.84/0.58 # ...number of literals in the above : 1690
% 0.84/0.58 # Current number of archived formulas : 0
% 0.84/0.58 # Current number of archived clauses : 10
% 0.84/0.58 # Clause-clause subsumption calls (NU) : 1055
% 0.84/0.58 # Rec. Clause-clause subsumption calls : 1055
% 0.84/0.58 # Non-unit clause-clause subsumptions : 63
% 0.84/0.58 # Unit Clause-clause subsumption calls : 110
% 0.84/0.58 # Rewrite failures with RHS unbound : 0
% 0.84/0.58 # BW rewrite match attempts : 53946
% 0.84/0.58 # BW rewrite match successes : 1
% 0.84/0.58 # Condensation attempts : 0
% 0.84/0.58 # Condensation successes : 0
% 0.84/0.58 # Termbank termtop insertions : 48482
% 0.84/0.58 # Search garbage collected termcells : 17
% 0.84/0.58
% 0.84/0.58 # -------------------------------------------------
% 0.84/0.58 # User time : 0.070 s
% 0.84/0.58 # System time : 0.009 s
% 0.84/0.58 # Total time : 0.079 s
% 0.84/0.58 # Maximum resident set size: 1608 pages
% 0.84/0.58
% 0.84/0.58 # -------------------------------------------------
% 0.84/0.58 # User time : 0.070 s
% 0.84/0.58 # System time : 0.012 s
% 0.84/0.58 # Total time : 0.083 s
% 0.84/0.58 # Maximum resident set size: 1708 pages
% 0.84/0.58 % E---3.1 exiting
% 0.84/0.58 % E exiting
%------------------------------------------------------------------------------