TSTP Solution File: LCL231-1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : LCL231-1 : TPTP v8.2.0. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n029.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:40 EDT 2024
% Result : Unsatisfiable 1.09s 0.64s
% Output : CNFRefutation 1.09s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 8
% Syntax : Number of clauses : 32 ( 14 unt; 0 nHn; 20 RR)
% Number of literals : 60 ( 0 equ; 32 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 7 ( 2 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-1 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 68 ( 3 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(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(rule_1,axiom,
( theorem(X1)
| ~ axiom(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL003-0.ax',rule_1) ).
cnf(prove_this,negated_conjecture,
~ theorem(or(not(or(not(or(not(p),q)),or(not(p),r))),or(not(p),or(not(q),r)))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).
cnf(axiom_1_3,axiom,
axiom(or(not(X1),or(X2,X1))),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL003-0.ax',axiom_1_3) ).
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(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(or(not(X1),X2))
| ~ axiom(or(not(X1),X3))
| ~ theorem(or(not(X3),X2)) ),
inference(fof_simplification,[status(thm)],[rule_3]) ).
cnf(c_0_10,plain,
( theorem(X1)
| ~ axiom(or(not(X2),X1))
| ~ theorem(X2) ),
c_0_8 ).
cnf(c_0_11,axiom,
axiom(or(not(or(not(X1),X2)),or(not(or(X3,X1)),or(X3,X2)))),
axiom_1_6 ).
cnf(c_0_12,axiom,
axiom(or(not(or(X1,or(X2,X3))),or(X2,or(X1,X3)))),
axiom_1_5 ).
cnf(c_0_13,plain,
( theorem(X1)
| ~ axiom(X1) ),
inference(fof_simplification,[status(thm)],[rule_1]) ).
cnf(c_0_14,plain,
( theorem(or(not(X1),X2))
| ~ axiom(or(not(X1),X3))
| ~ theorem(or(not(X3),X2)) ),
c_0_9 ).
cnf(c_0_15,plain,
( theorem(or(not(or(X1,X2)),or(X1,X3)))
| ~ theorem(or(not(X2),X3)) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_16,plain,
( theorem(or(X1,or(X2,X3)))
| ~ theorem(or(X2,or(X1,X3))) ),
inference(spm,[status(thm)],[c_0_10,c_0_12]) ).
cnf(c_0_17,plain,
( theorem(X1)
| ~ axiom(X1) ),
c_0_13 ).
cnf(c_0_18,negated_conjecture,
~ theorem(or(not(or(not(or(not(p),q)),or(not(p),r))),or(not(p),or(not(q),r)))),
inference(fof_simplification,[status(thm)],[prove_this]) ).
cnf(c_0_19,plain,
( theorem(or(not(X1),or(X2,X3)))
| ~ theorem(or(not(X4),X3))
| ~ axiom(or(not(X1),or(X2,X4))) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_20,plain,
( theorem(or(X1,or(not(or(X1,X2)),X3)))
| ~ theorem(or(not(X2),X3)) ),
inference(spm,[status(thm)],[c_0_16,c_0_15]) ).
cnf(c_0_21,plain,
( theorem(or(not(X1),X2))
| ~ axiom(or(not(X1),X3))
| ~ axiom(or(not(X3),X2)) ),
inference(spm,[status(thm)],[c_0_14,c_0_17]) ).
cnf(c_0_22,axiom,
axiom(or(not(X1),or(X2,X1))),
axiom_1_3 ).
cnf(c_0_23,negated_conjecture,
~ theorem(or(not(or(not(or(not(p),q)),or(not(p),r))),or(not(p),or(not(q),r)))),
c_0_18 ).
cnf(c_0_24,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_19,c_0_12]) ).
cnf(c_0_25,plain,
( theorem(or(not(X1),or(not(or(not(X2),X3)),X4)))
| ~ theorem(or(not(X3),X4))
| ~ axiom(or(not(X1),X2)) ),
inference(spm,[status(thm)],[c_0_14,c_0_20]) ).
cnf(c_0_26,plain,
( theorem(or(not(X1),X2))
| ~ axiom(or(not(or(X3,X1)),X2)) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_27,axiom,
axiom(or(not(or(X1,X1)),X1)),
axiom_1_2 ).
cnf(c_0_28,negated_conjecture,
~ theorem(or(not(or(not(or(not(p),q)),r)),or(not(q),r))),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_29,plain,
( theorem(or(not(or(not(X1),X2)),or(not(X3),X4)))
| ~ theorem(or(not(X2),X4))
| ~ axiom(or(not(X3),X1)) ),
inference(spm,[status(thm)],[c_0_16,c_0_25]) ).
cnf(c_0_30,plain,
theorem(or(not(X1),X1)),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_31,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_30]),c_0_22])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : LCL231-1 : TPTP v8.2.0. Released v1.1.0.
% 0.03/0.14 % Command : run_E %s %d THM
% 0.14/0.35 % Computer : n029.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Mon May 20 03:02:53 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.20/0.46 Running first-order theorem proving
% 0.20/0.46 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
% 1.09/0.64 # Version: 3.1.0
% 1.09/0.64 # Preprocessing class: FSMSSMSSSSSNFFN.
% 1.09/0.64 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.09/0.64 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 1.09/0.64 # Starting new_bool_3 with 300s (1) cores
% 1.09/0.64 # Starting new_bool_1 with 300s (1) cores
% 1.09/0.64 # Starting sh5l with 300s (1) cores
% 1.09/0.64 # new_bool_3 with pid 19654 completed with status 0
% 1.09/0.64 # Result found by new_bool_3
% 1.09/0.64 # Preprocessing class: FSMSSMSSSSSNFFN.
% 1.09/0.64 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.09/0.64 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 1.09/0.64 # Starting new_bool_3 with 300s (1) cores
% 1.09/0.64 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 1.09/0.64 # Search class: FHUNM-FFSF21-DFFFFFNN
% 1.09/0.64 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 1.09/0.64 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 79s (1) cores
% 1.09/0.64 # G-E--_302_C18_F1_URBAN_RG_S04BN with pid 19658 completed with status 0
% 1.09/0.64 # Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 1.09/0.64 # Preprocessing class: FSMSSMSSSSSNFFN.
% 1.09/0.64 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.09/0.64 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 1.09/0.64 # Starting new_bool_3 with 300s (1) cores
% 1.09/0.64 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 1.09/0.64 # Search class: FHUNM-FFSF21-DFFFFFNN
% 1.09/0.64 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 1.09/0.64 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 79s (1) cores
% 1.09/0.64 # Preprocessing time : 0.017 s
% 1.09/0.64
% 1.09/0.64 # Proof found!
% 1.09/0.64 # SZS status Unsatisfiable
% 1.09/0.64 # SZS output start CNFRefutation
% See solution above
% 1.09/0.64 # Parsed axioms : 9
% 1.09/0.64 # Removed by relevancy pruning/SinE : 0
% 1.09/0.64 # Initial clauses : 9
% 1.09/0.64 # Removed in clause preprocessing : 0
% 1.09/0.64 # Initial clauses in saturation : 9
% 1.09/0.64 # Processed clauses : 1236
% 1.09/0.64 # ...of these trivial : 23
% 1.09/0.64 # ...subsumed : 602
% 1.09/0.64 # ...remaining for further processing : 611
% 1.09/0.64 # Other redundant clauses eliminated : 0
% 1.09/0.64 # Clauses deleted for lack of memory : 0
% 1.09/0.64 # Backward-subsumed : 0
% 1.09/0.64 # Backward-rewritten : 0
% 1.09/0.64 # Generated clauses : 5914
% 1.09/0.64 # ...of the previous two non-redundant : 5320
% 1.09/0.64 # ...aggressively subsumed : 0
% 1.09/0.64 # Contextual simplify-reflections : 0
% 1.09/0.64 # Paramodulations : 5914
% 1.09/0.64 # Factorizations : 0
% 1.09/0.64 # NegExts : 0
% 1.09/0.64 # Equation resolutions : 0
% 1.09/0.64 # Disequality decompositions : 0
% 1.09/0.64 # Total rewrite steps : 601
% 1.09/0.64 # ...of those cached : 363
% 1.09/0.64 # Propositional unsat checks : 0
% 1.09/0.64 # Propositional check models : 0
% 1.09/0.64 # Propositional check unsatisfiable : 0
% 1.09/0.64 # Propositional clauses : 0
% 1.09/0.64 # Propositional clauses after purity: 0
% 1.09/0.64 # Propositional unsat core size : 0
% 1.09/0.64 # Propositional preprocessing time : 0.000
% 1.09/0.64 # Propositional encoding time : 0.000
% 1.09/0.64 # Propositional solver time : 0.000
% 1.09/0.64 # Success case prop preproc time : 0.000
% 1.09/0.64 # Success case prop encoding time : 0.000
% 1.09/0.64 # Success case prop solver time : 0.000
% 1.09/0.64 # Current number of processed clauses : 611
% 1.09/0.64 # Positive orientable unit clauses : 84
% 1.09/0.64 # Positive unorientable unit clauses: 0
% 1.09/0.64 # Negative unit clauses : 94
% 1.09/0.64 # Non-unit-clauses : 433
% 1.09/0.64 # Current number of unprocessed clauses: 4071
% 1.09/0.64 # ...number of literals in the above : 7905
% 1.09/0.64 # Current number of archived formulas : 0
% 1.09/0.64 # Current number of archived clauses : 0
% 1.09/0.64 # Clause-clause subsumption calls (NU) : 39948
% 1.09/0.64 # Rec. Clause-clause subsumption calls : 39948
% 1.09/0.64 # Non-unit clause-clause subsumptions : 495
% 1.09/0.64 # Unit Clause-clause subsumption calls : 3954
% 1.09/0.64 # Rewrite failures with RHS unbound : 0
% 1.09/0.64 # BW rewrite match attempts : 3203
% 1.09/0.64 # BW rewrite match successes : 0
% 1.09/0.64 # Condensation attempts : 0
% 1.09/0.64 # Condensation successes : 0
% 1.09/0.64 # Termbank termtop insertions : 91511
% 1.09/0.64 # Search garbage collected termcells : 17
% 1.09/0.64
% 1.09/0.64 # -------------------------------------------------
% 1.09/0.64 # User time : 0.157 s
% 1.09/0.64 # System time : 0.009 s
% 1.09/0.64 # Total time : 0.166 s
% 1.09/0.64 # Maximum resident set size: 1604 pages
% 1.09/0.64
% 1.09/0.64 # -------------------------------------------------
% 1.09/0.64 # User time : 0.158 s
% 1.09/0.64 # System time : 0.011 s
% 1.09/0.64 # Total time : 0.169 s
% 1.09/0.64 # Maximum resident set size: 1712 pages
% 1.09/0.64 % E---3.1 exiting
% 1.09/0.64 % E exiting
%------------------------------------------------------------------------------