TSTP Solution File: LCL345-3 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : LCL345-3 : TPTP v8.2.0. Released v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n006.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:46:04 EDT 2024
% Result : Unsatisfiable 5.65s 1.18s
% Output : CNFRefutation 5.65s
% Verified :
% SZS Type : Refutation
% Derivation depth : 20
% Number of leaves : 11
% Syntax : Number of clauses : 65 ( 30 unt; 0 nHn; 32 RR)
% Number of literals : 113 ( 7 equ; 59 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 8 ( 2 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 2 con; 0-2 aty)
% Number of variables : 118 ( 9 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(rule_2,axiom,
( theorem(X1)
| ~ theorem(implies(X2,X1))
| ~ theorem(X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-0.ax',rule_2) ).
cnf(implies_definition,axiom,
implies(X1,X2) = or(not(X1),X2),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-0.ax',implies_definition) ).
cnf(rule_1,axiom,
( theorem(X1)
| ~ axiom(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-0.ax',rule_1) ).
cnf(axiom_1_6,axiom,
axiom(implies(implies(X1,X2),implies(or(X3,X1),or(X3,X2)))),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-0.ax',axiom_1_6) ).
cnf(axiom_1_5,axiom,
axiom(implies(or(X1,or(X2,X3)),or(X2,or(X1,X3)))),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-0.ax',axiom_1_5) ).
cnf(axiom_1_2,axiom,
axiom(implies(or(X1,X1),X1)),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-0.ax',axiom_1_2) ).
cnf(axiom_1_3,axiom,
axiom(implies(X1,or(X2,X1))),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-0.ax',axiom_1_3) ).
cnf(axiom_1_4,axiom,
axiom(implies(or(X1,X2),or(X2,X1))),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-0.ax',axiom_1_4) ).
cnf(prove_this,negated_conjecture,
~ theorem(or(equivalent(or(p,q),p),equivalent(or(p,q),q))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).
cnf(equivalent_defn,axiom,
equivalent(X1,X2) = and(implies(X1,X2),implies(X2,X1)),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-2.ax',equivalent_defn) ).
cnf(and_defn,axiom,
and(X1,X2) = not(or(not(X1),not(X2))),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-1.ax',and_defn) ).
cnf(c_0_11,plain,
( theorem(X1)
| ~ theorem(implies(X2,X1))
| ~ theorem(X2) ),
inference(fof_simplification,[status(thm)],[rule_2]) ).
cnf(c_0_12,plain,
( theorem(X1)
| ~ theorem(implies(X2,X1))
| ~ theorem(X2) ),
c_0_11 ).
cnf(c_0_13,axiom,
implies(X1,X2) = or(not(X1),X2),
implies_definition ).
cnf(c_0_14,plain,
( theorem(X1)
| ~ axiom(X1) ),
inference(fof_simplification,[status(thm)],[rule_1]) ).
cnf(c_0_15,plain,
( theorem(X1)
| ~ theorem(X2)
| ~ theorem(or(not(X2),X1)) ),
inference(rw,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_16,plain,
( theorem(X1)
| ~ axiom(X1) ),
c_0_14 ).
cnf(c_0_17,axiom,
axiom(implies(implies(X1,X2),implies(or(X3,X1),or(X3,X2)))),
axiom_1_6 ).
cnf(c_0_18,plain,
( theorem(X1)
| ~ theorem(X2)
| ~ axiom(or(not(X2),X1)) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_19,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_17,c_0_13]),c_0_13]),c_0_13]) ).
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_18,c_0_19]) ).
cnf(c_0_21,axiom,
axiom(implies(or(X1,or(X2,X3)),or(X2,or(X1,X3)))),
axiom_1_5 ).
cnf(c_0_22,plain,
( theorem(or(X1,X2))
| ~ theorem(or(not(X3),X2))
| ~ theorem(or(X1,X3)) ),
inference(spm,[status(thm)],[c_0_15,c_0_20]) ).
cnf(c_0_23,axiom,
axiom(implies(or(X1,X1),X1)),
axiom_1_2 ).
cnf(c_0_24,plain,
axiom(or(not(or(X1,or(X2,X3))),or(X2,or(X1,X3)))),
inference(rw,[status(thm)],[c_0_21,c_0_13]) ).
cnf(c_0_25,axiom,
axiom(implies(X1,or(X2,X1))),
axiom_1_3 ).
cnf(c_0_26,plain,
( theorem(or(X1,X2))
| ~ theorem(or(X1,X3))
| ~ axiom(or(not(X3),X2)) ),
inference(spm,[status(thm)],[c_0_22,c_0_16]) ).
cnf(c_0_27,plain,
axiom(or(not(or(X1,X1)),X1)),
inference(rw,[status(thm)],[c_0_23,c_0_13]) ).
cnf(c_0_28,plain,
( theorem(or(X1,or(X2,X3)))
| ~ theorem(or(X2,or(X1,X3))) ),
inference(spm,[status(thm)],[c_0_18,c_0_24]) ).
cnf(c_0_29,axiom,
axiom(implies(or(X1,X2),or(X2,X1))),
axiom_1_4 ).
cnf(c_0_30,plain,
axiom(or(not(X1),or(X2,X1))),
inference(rw,[status(thm)],[c_0_25,c_0_13]) ).
cnf(c_0_31,plain,
( theorem(or(X1,X2))
| ~ theorem(or(X1,or(X2,X2))) ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_32,plain,
( theorem(or(X1,or(not(or(X1,X2)),X3)))
| ~ theorem(or(not(X2),X3)) ),
inference(spm,[status(thm)],[c_0_28,c_0_20]) ).
cnf(c_0_33,plain,
axiom(or(not(or(X1,X2)),or(X2,X1))),
inference(rw,[status(thm)],[c_0_29,c_0_13]) ).
cnf(c_0_34,plain,
( theorem(or(X1,X2))
| ~ theorem(X2) ),
inference(spm,[status(thm)],[c_0_18,c_0_30]) ).
cnf(c_0_35,plain,
( theorem(or(X1,X2))
| ~ axiom(or(X1,or(X2,X2))) ),
inference(spm,[status(thm)],[c_0_31,c_0_16]) ).
cnf(c_0_36,negated_conjecture,
~ theorem(or(equivalent(or(p,q),p),equivalent(or(p,q),q))),
inference(fof_simplification,[status(thm)],[prove_this]) ).
cnf(c_0_37,axiom,
equivalent(X1,X2) = and(implies(X1,X2),implies(X2,X1)),
equivalent_defn ).
cnf(c_0_38,axiom,
and(X1,X2) = not(or(not(X1),not(X2))),
and_defn ).
cnf(c_0_39,plain,
( theorem(X1)
| ~ theorem(or(X1,X1)) ),
inference(spm,[status(thm)],[c_0_18,c_0_27]) ).
cnf(c_0_40,plain,
( theorem(or(X1,or(not(or(not(X2),X3)),X4)))
| ~ theorem(or(not(X3),X4))
| ~ theorem(or(X1,X2)) ),
inference(spm,[status(thm)],[c_0_22,c_0_32]) ).
cnf(c_0_41,plain,
( theorem(or(X1,X2))
| ~ theorem(or(X2,X1)) ),
inference(spm,[status(thm)],[c_0_18,c_0_33]) ).
cnf(c_0_42,plain,
( theorem(or(X1,or(X2,X3)))
| ~ theorem(or(X1,X3)) ),
inference(spm,[status(thm)],[c_0_28,c_0_34]) ).
cnf(c_0_43,plain,
theorem(or(not(X1),X1)),
inference(spm,[status(thm)],[c_0_35,c_0_30]) ).
cnf(c_0_44,negated_conjecture,
~ theorem(or(equivalent(or(p,q),p),equivalent(or(p,q),q))),
c_0_36 ).
cnf(c_0_45,plain,
equivalent(X1,X2) = not(or(not(or(not(X1),X2)),not(or(not(X2),X1)))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_37,c_0_13]),c_0_13]),c_0_38]) ).
cnf(c_0_46,plain,
( theorem(or(not(or(not(X1),X2)),X3))
| ~ theorem(or(or(not(or(not(X1),X2)),X3),X1))
| ~ theorem(or(not(X2),X3)) ),
inference(spm,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_47,plain,
( theorem(or(or(X1,X2),X3))
| ~ theorem(or(X3,X2)) ),
inference(spm,[status(thm)],[c_0_41,c_0_42]) ).
cnf(c_0_48,plain,
( theorem(or(X1,X2))
| ~ theorem(or(not(X3),X2))
| ~ theorem(X3) ),
inference(spm,[status(thm)],[c_0_15,c_0_42]) ).
cnf(c_0_49,plain,
theorem(or(X1,not(X1))),
inference(spm,[status(thm)],[c_0_41,c_0_43]) ).
cnf(c_0_50,negated_conjecture,
~ theorem(or(not(or(not(or(not(or(p,q)),p)),not(or(not(p),or(p,q))))),not(or(not(or(not(or(p,q)),q)),not(or(not(q),or(p,q))))))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_44,c_0_45]),c_0_45]) ).
cnf(c_0_51,plain,
( theorem(or(not(or(not(X1),X2)),X3))
| ~ theorem(or(not(X2),X3))
| ~ theorem(or(X1,X3)) ),
inference(spm,[status(thm)],[c_0_46,c_0_47]) ).
cnf(c_0_52,plain,
( theorem(or(X1,not(not(X2))))
| ~ theorem(X2) ),
inference(spm,[status(thm)],[c_0_48,c_0_49]) ).
cnf(c_0_53,negated_conjecture,
( ~ theorem(or(not(not(or(not(p),or(p,q)))),not(or(not(or(not(or(p,q)),q)),not(or(not(q),or(p,q)))))))
| ~ theorem(or(or(not(or(p,q)),p),not(or(not(or(not(or(p,q)),q)),not(or(not(q),or(p,q))))))) ),
inference(spm,[status(thm)],[c_0_50,c_0_51]) ).
cnf(c_0_54,plain,
( theorem(or(not(not(X1)),X2))
| ~ theorem(X1) ),
inference(spm,[status(thm)],[c_0_41,c_0_52]) ).
cnf(c_0_55,negated_conjecture,
( ~ theorem(or(or(not(or(p,q)),p),not(or(not(or(not(or(p,q)),q)),not(or(not(q),or(p,q)))))))
| ~ theorem(or(not(p),or(p,q))) ),
inference(spm,[status(thm)],[c_0_53,c_0_54]) ).
cnf(c_0_56,negated_conjecture,
( ~ theorem(or(not(or(not(or(not(or(p,q)),q)),not(or(not(q),or(p,q))))),p))
| ~ theorem(or(not(p),or(p,q))) ),
inference(spm,[status(thm)],[c_0_55,c_0_47]) ).
cnf(c_0_57,negated_conjecture,
( ~ theorem(or(not(not(or(not(q),or(p,q)))),p))
| ~ theorem(or(or(not(or(p,q)),q),p))
| ~ theorem(or(not(p),or(p,q))) ),
inference(spm,[status(thm)],[c_0_56,c_0_51]) ).
cnf(c_0_58,negated_conjecture,
( ~ theorem(or(or(not(or(p,q)),q),p))
| ~ theorem(or(not(p),or(p,q)))
| ~ theorem(or(not(q),or(p,q))) ),
inference(spm,[status(thm)],[c_0_57,c_0_54]) ).
cnf(c_0_59,plain,
( theorem(or(or(not(or(X1,X2)),X3),X1))
| ~ theorem(or(not(X2),X3)) ),
inference(spm,[status(thm)],[c_0_41,c_0_32]) ).
cnf(c_0_60,negated_conjecture,
( ~ theorem(or(not(p),or(p,q)))
| ~ theorem(or(not(q),or(p,q))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_59]),c_0_43])]) ).
cnf(c_0_61,plain,
( theorem(or(X1,or(X2,X3)))
| ~ theorem(or(X1,or(X3,X2))) ),
inference(spm,[status(thm)],[c_0_26,c_0_33]) ).
cnf(c_0_62,negated_conjecture,
~ theorem(or(not(p),or(p,q))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_60,c_0_16]),c_0_30])]) ).
cnf(c_0_63,plain,
( theorem(or(X1,or(X2,X3)))
| ~ axiom(or(X1,or(X3,X2))) ),
inference(spm,[status(thm)],[c_0_61,c_0_16]) ).
cnf(c_0_64,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_62,c_0_63]),c_0_30])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : LCL345-3 : TPTP v8.2.0. Released v2.3.0.
% 0.11/0.13 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n006.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Mon May 20 02:08:38 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.20/0.47 Running first-order theorem proving
% 0.20/0.47 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
% 5.65/1.18 # Version: 3.1.0
% 5.65/1.18 # Preprocessing class: FSMSSMSSSSSNFFN.
% 5.65/1.18 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 5.65/1.18 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 5.65/1.18 # Starting new_bool_3 with 300s (1) cores
% 5.65/1.18 # Starting new_bool_1 with 300s (1) cores
% 5.65/1.18 # Starting sh5l with 300s (1) cores
% 5.65/1.18 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 19202 completed with status 0
% 5.65/1.18 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 5.65/1.18 # Preprocessing class: FSMSSMSSSSSNFFN.
% 5.65/1.18 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 5.65/1.18 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 5.65/1.18 # No SInE strategy applied
% 5.65/1.18 # Search class: FHUNM-FFSF21-DFFFFFNN
% 5.65/1.18 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 5.65/1.18 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 355s (1) cores
% 5.65/1.18 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 5.65/1.18 # Starting new_bool_3 with 296s (1) cores
% 5.65/1.18 # Starting new_bool_1 with 291s (1) cores
% 5.65/1.18 # Starting G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 5.65/1.18 # G-E--_302_C18_F1_URBAN_RG_S04BN with pid 19208 completed with status 0
% 5.65/1.18 # Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 5.65/1.18 # Preprocessing class: FSMSSMSSSSSNFFN.
% 5.65/1.18 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 5.65/1.18 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 5.65/1.18 # No SInE strategy applied
% 5.65/1.18 # Search class: FHUNM-FFSF21-DFFFFFNN
% 5.65/1.18 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 5.65/1.18 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 355s (1) cores
% 5.65/1.18 # Preprocessing time : 0.038 s
% 5.65/1.18
% 5.65/1.18 # Proof found!
% 5.65/1.18 # SZS status Unsatisfiable
% 5.65/1.18 # SZS output start CNFRefutation
% See solution above
% 5.65/1.18 # Parsed axioms : 11
% 5.65/1.18 # Removed by relevancy pruning/SinE : 0
% 5.65/1.18 # Initial clauses : 11
% 5.65/1.18 # Removed in clause preprocessing : 3
% 5.65/1.18 # Initial clauses in saturation : 8
% 5.65/1.18 # Processed clauses : 4435
% 5.65/1.18 # ...of these trivial : 2
% 5.65/1.18 # ...subsumed : 2869
% 5.65/1.18 # ...remaining for further processing : 1564
% 5.65/1.18 # Other redundant clauses eliminated : 0
% 5.65/1.18 # Clauses deleted for lack of memory : 0
% 5.65/1.18 # Backward-subsumed : 820
% 5.65/1.18 # Backward-rewritten : 0
% 5.65/1.18 # Generated clauses : 34437
% 5.65/1.18 # ...of the previous two non-redundant : 34039
% 5.65/1.18 # ...aggressively subsumed : 0
% 5.65/1.18 # Contextual simplify-reflections : 16
% 5.65/1.18 # Paramodulations : 34437
% 5.65/1.18 # Factorizations : 0
% 5.65/1.18 # NegExts : 0
% 5.65/1.18 # Equation resolutions : 0
% 5.65/1.18 # Disequality decompositions : 0
% 5.65/1.18 # Total rewrite steps : 327
% 5.65/1.18 # ...of those cached : 253
% 5.65/1.18 # Propositional unsat checks : 0
% 5.65/1.18 # Propositional check models : 0
% 5.65/1.18 # Propositional check unsatisfiable : 0
% 5.65/1.18 # Propositional clauses : 0
% 5.65/1.18 # Propositional clauses after purity: 0
% 5.65/1.18 # Propositional unsat core size : 0
% 5.65/1.18 # Propositional preprocessing time : 0.000
% 5.65/1.18 # Propositional encoding time : 0.000
% 5.65/1.18 # Propositional solver time : 0.000
% 5.65/1.18 # Success case prop preproc time : 0.000
% 5.65/1.18 # Success case prop encoding time : 0.000
% 5.65/1.18 # Success case prop solver time : 0.000
% 5.65/1.18 # Current number of processed clauses : 744
% 5.65/1.18 # Positive orientable unit clauses : 17
% 5.65/1.18 # Positive unorientable unit clauses: 0
% 5.65/1.18 # Negative unit clauses : 32
% 5.65/1.18 # Non-unit-clauses : 695
% 5.65/1.18 # Current number of unprocessed clauses: 28254
% 5.65/1.18 # ...number of literals in the above : 97471
% 5.65/1.18 # Current number of archived formulas : 0
% 5.65/1.18 # Current number of archived clauses : 823
% 5.65/1.18 # Clause-clause subsumption calls (NU) : 340275
% 5.65/1.18 # Rec. Clause-clause subsumption calls : 243366
% 5.65/1.18 # Non-unit clause-clause subsumptions : 2187
% 5.65/1.18 # Unit Clause-clause subsumption calls : 3328
% 5.65/1.18 # Rewrite failures with RHS unbound : 0
% 5.65/1.18 # BW rewrite match attempts : 583
% 5.65/1.18 # BW rewrite match successes : 2
% 5.65/1.18 # Condensation attempts : 0
% 5.65/1.18 # Condensation successes : 0
% 5.65/1.18 # Termbank termtop insertions : 651622
% 5.65/1.18 # Search garbage collected termcells : 11
% 5.65/1.18
% 5.65/1.18 # -------------------------------------------------
% 5.65/1.18 # User time : 0.653 s
% 5.65/1.18 # System time : 0.025 s
% 5.65/1.18 # Total time : 0.678 s
% 5.65/1.18 # Maximum resident set size: 1660 pages
% 5.65/1.18
% 5.65/1.18 # -------------------------------------------------
% 5.65/1.18 # User time : 3.267 s
% 5.65/1.18 # System time : 0.072 s
% 5.65/1.18 # Total time : 3.339 s
% 5.65/1.18 # Maximum resident set size: 1712 pages
% 5.65/1.18 % E---3.1 exiting
% 5.65/1.18 % E exiting
%------------------------------------------------------------------------------