TSTP Solution File: LCL214-3 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : LCL214-3 : TPTP v8.2.0. Released v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n011.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 53.67s 7.30s
% Output : CNFRefutation 53.67s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 9
% Syntax : Number of clauses : 49 ( 25 unt; 0 nHn; 24 RR)
% Number of literals : 82 ( 2 equ; 37 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 7 ( 2 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 100 ( 7 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_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_3,axiom,
axiom(implies(X1,or(X2,X1))),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-0.ax',axiom_1_3) ).
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_2,axiom,
axiom(implies(or(X1,X1),X1)),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-0.ax',axiom_1_2) ).
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(implies(or(p,q),implies(implies(p,q),q))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).
cnf(c_0_9,plain,
( theorem(X1)
| ~ theorem(implies(X2,X1))
| ~ theorem(X2) ),
inference(fof_simplification,[status(thm)],[rule_2]) ).
cnf(c_0_10,plain,
( theorem(X1)
| ~ theorem(implies(X2,X1))
| ~ theorem(X2) ),
c_0_9 ).
cnf(c_0_11,axiom,
implies(X1,X2) = or(not(X1),X2),
implies_definition ).
cnf(c_0_12,plain,
( theorem(X1)
| ~ axiom(X1) ),
inference(fof_simplification,[status(thm)],[rule_1]) ).
cnf(c_0_13,plain,
( theorem(X1)
| ~ theorem(X2)
| ~ theorem(or(not(X2),X1)) ),
inference(rw,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_14,plain,
( theorem(X1)
| ~ axiom(X1) ),
c_0_12 ).
cnf(c_0_15,axiom,
axiom(implies(or(X1,or(X2,X3)),or(X2,or(X1,X3)))),
axiom_1_5 ).
cnf(c_0_16,axiom,
axiom(implies(X1,or(X2,X1))),
axiom_1_3 ).
cnf(c_0_17,axiom,
axiom(implies(implies(X1,X2),implies(or(X3,X1),or(X3,X2)))),
axiom_1_6 ).
cnf(c_0_18,axiom,
axiom(implies(or(X1,X1),X1)),
axiom_1_2 ).
cnf(c_0_19,plain,
( theorem(X1)
| ~ theorem(X2)
| ~ axiom(or(not(X2),X1)) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_20,plain,
axiom(or(not(or(X1,or(X2,X3))),or(X2,or(X1,X3)))),
inference(rw,[status(thm)],[c_0_15,c_0_11]) ).
cnf(c_0_21,plain,
axiom(or(not(X1),or(X2,X1))),
inference(rw,[status(thm)],[c_0_16,c_0_11]) ).
cnf(c_0_22,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_11]),c_0_11]),c_0_11]) ).
cnf(c_0_23,plain,
axiom(or(not(or(X1,X1)),X1)),
inference(rw,[status(thm)],[c_0_18,c_0_11]) ).
cnf(c_0_24,plain,
( theorem(or(X1,or(X2,X3)))
| ~ theorem(or(X2,or(X1,X3))) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_25,plain,
( theorem(or(X1,X2))
| ~ theorem(X2) ),
inference(spm,[status(thm)],[c_0_19,c_0_21]) ).
cnf(c_0_26,plain,
( theorem(or(not(or(X1,X2)),or(X1,X3)))
| ~ theorem(or(not(X2),X3)) ),
inference(spm,[status(thm)],[c_0_19,c_0_22]) ).
cnf(c_0_27,axiom,
axiom(implies(or(X1,X2),or(X2,X1))),
axiom_1_4 ).
cnf(c_0_28,plain,
( theorem(X1)
| ~ theorem(or(X1,X1)) ),
inference(spm,[status(thm)],[c_0_19,c_0_23]) ).
cnf(c_0_29,plain,
( theorem(or(X1,or(X2,X3)))
| ~ theorem(or(X1,X3)) ),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_30,plain,
( theorem(or(X1,X2))
| ~ theorem(or(not(X3),X2))
| ~ theorem(or(X1,X3)) ),
inference(spm,[status(thm)],[c_0_13,c_0_26]) ).
cnf(c_0_31,plain,
( theorem(or(X1,or(not(or(X1,X2)),X3)))
| ~ theorem(or(not(X2),X3)) ),
inference(spm,[status(thm)],[c_0_24,c_0_26]) ).
cnf(c_0_32,plain,
axiom(or(not(or(X1,X2)),or(X2,X1))),
inference(rw,[status(thm)],[c_0_27,c_0_11]) ).
cnf(c_0_33,plain,
( theorem(or(X1,X2))
| ~ theorem(or(or(X1,X2),X2)) ),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_34,plain,
( theorem(or(X1,or(X2,X3)))
| ~ axiom(or(X2,or(X1,X3))) ),
inference(spm,[status(thm)],[c_0_24,c_0_14]) ).
cnf(c_0_35,negated_conjecture,
~ theorem(implies(or(p,q),implies(implies(p,q),q))),
inference(fof_simplification,[status(thm)],[prove_this]) ).
cnf(c_0_36,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_30,c_0_31]) ).
cnf(c_0_37,plain,
( theorem(or(X1,X2))
| ~ theorem(or(X2,X1)) ),
inference(spm,[status(thm)],[c_0_19,c_0_32]) ).
cnf(c_0_38,plain,
( theorem(or(X1,or(X2,X3)))
| ~ axiom(or(X2,or(or(X1,or(X2,X3)),X3))) ),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_39,negated_conjecture,
~ theorem(implies(or(p,q),implies(implies(p,q),q))),
c_0_35 ).
cnf(c_0_40,plain,
( theorem(or(X1,or(not(or(not(X2),X3)),X4)))
| ~ theorem(or(or(X1,or(not(or(not(X2),X3)),X4)),X2))
| ~ theorem(or(not(X3),X4)) ),
inference(spm,[status(thm)],[c_0_33,c_0_36]) ).
cnf(c_0_41,plain,
( theorem(or(or(not(or(X1,X2)),X3),X1))
| ~ theorem(or(not(X2),X3)) ),
inference(spm,[status(thm)],[c_0_37,c_0_31]) ).
cnf(c_0_42,plain,
theorem(or(X1,or(not(X2),X2))),
inference(spm,[status(thm)],[c_0_38,c_0_21]) ).
cnf(c_0_43,plain,
( theorem(or(X1,X2))
| ~ axiom(or(X1,or(or(X1,X2),X2))) ),
inference(spm,[status(thm)],[c_0_28,c_0_34]) ).
cnf(c_0_44,negated_conjecture,
~ theorem(or(not(or(p,q)),or(not(or(not(p),q)),q))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_39,c_0_11]),c_0_11]),c_0_11]) ).
cnf(c_0_45,plain,
( theorem(or(not(or(X1,X2)),or(not(or(not(X1),X3)),X4)))
| ~ theorem(or(not(X2),or(not(or(not(X1),X3)),X4)))
| ~ theorem(or(not(X3),X4)) ),
inference(spm,[status(thm)],[c_0_40,c_0_41]) ).
cnf(c_0_46,plain,
theorem(or(not(X1),or(X2,X1))),
inference(spm,[status(thm)],[c_0_24,c_0_42]) ).
cnf(c_0_47,plain,
theorem(or(not(X1),X1)),
inference(spm,[status(thm)],[c_0_43,c_0_21]) ).
cnf(c_0_48,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_45]),c_0_46]),c_0_47])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : LCL214-3 : TPTP v8.2.0. Released v2.3.0.
% 0.03/0.13 % Command : run_E %s %d THM
% 0.14/0.34 % Computer : n011.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Mon May 20 03:07:08 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.21/0.50 Running first-order theorem proving
% 0.21/0.50 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
% 53.67/7.30 # Version: 3.1.0
% 53.67/7.30 # Preprocessing class: FSSSSMSSSSSNFFN.
% 53.67/7.30 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 53.67/7.30 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 53.67/7.30 # Starting new_bool_3 with 300s (1) cores
% 53.67/7.30 # Starting new_bool_1 with 300s (1) cores
% 53.67/7.30 # Starting sh5l with 300s (1) cores
% 53.67/7.30 # G-E--_302_C18_F1_URBAN_RG_S04BN with pid 8190 completed with status 0
% 53.67/7.30 # Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 53.67/7.30 # Preprocessing class: FSSSSMSSSSSNFFN.
% 53.67/7.30 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 53.67/7.30 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 53.67/7.30 # No SInE strategy applied
% 53.67/7.30 # Search class: FHUNM-FFSF21-MFFFFFNN
% 53.67/7.30 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 53.67/7.30 # Starting G----_Z1410__C12_02_nc_F1_AE_CS_SP_S2S with 811s (1) cores
% 53.67/7.30 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 53.67/7.30 # Starting new_bool_3 with 136s (1) cores
% 53.67/7.30 # Starting new_bool_1 with 136s (1) cores
% 53.67/7.30 # Starting C12_02_nc_SAT001_MinMin_p005000_rr with 136s (1) cores
% 53.67/7.30 # G-E--_302_C18_F1_URBAN_RG_S04BN with pid 8198 completed with status 0
% 53.67/7.30 # Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 53.67/7.30 # Preprocessing class: FSSSSMSSSSSNFFN.
% 53.67/7.30 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 53.67/7.30 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 53.67/7.30 # No SInE strategy applied
% 53.67/7.30 # Search class: FHUNM-FFSF21-MFFFFFNN
% 53.67/7.30 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 53.67/7.30 # Starting G----_Z1410__C12_02_nc_F1_AE_CS_SP_S2S with 811s (1) cores
% 53.67/7.30 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 53.67/7.30 # Preprocessing time : 0.008 s
% 53.67/7.30
% 53.67/7.30 # Proof found!
% 53.67/7.30 # SZS status Unsatisfiable
% 53.67/7.30 # SZS output start CNFRefutation
% See solution above
% 53.67/7.30 # Parsed axioms : 9
% 53.67/7.30 # Removed by relevancy pruning/SinE : 0
% 53.67/7.30 # Initial clauses : 9
% 53.67/7.30 # Removed in clause preprocessing : 1
% 53.67/7.30 # Initial clauses in saturation : 8
% 53.67/7.30 # Processed clauses : 11292
% 53.67/7.30 # ...of these trivial : 37
% 53.67/7.30 # ...subsumed : 8749
% 53.67/7.30 # ...remaining for further processing : 2506
% 53.67/7.30 # Other redundant clauses eliminated : 0
% 53.67/7.30 # Clauses deleted for lack of memory : 0
% 53.67/7.30 # Backward-subsumed : 37
% 53.67/7.30 # Backward-rewritten : 0
% 53.67/7.30 # Generated clauses : 326109
% 53.67/7.30 # ...of the previous two non-redundant : 321131
% 53.67/7.30 # ...aggressively subsumed : 0
% 53.67/7.30 # Contextual simplify-reflections : 1
% 53.67/7.30 # Paramodulations : 326109
% 53.67/7.30 # Factorizations : 0
% 53.67/7.30 # NegExts : 0
% 53.67/7.30 # Equation resolutions : 0
% 53.67/7.30 # Disequality decompositions : 0
% 53.67/7.30 # Total rewrite steps : 4585
% 53.67/7.30 # ...of those cached : 4007
% 53.67/7.30 # Propositional unsat checks : 0
% 53.67/7.30 # Propositional check models : 0
% 53.67/7.30 # Propositional check unsatisfiable : 0
% 53.67/7.30 # Propositional clauses : 0
% 53.67/7.30 # Propositional clauses after purity: 0
% 53.67/7.30 # Propositional unsat core size : 0
% 53.67/7.30 # Propositional preprocessing time : 0.000
% 53.67/7.30 # Propositional encoding time : 0.000
% 53.67/7.30 # Propositional solver time : 0.000
% 53.67/7.30 # Success case prop preproc time : 0.000
% 53.67/7.30 # Success case prop encoding time : 0.000
% 53.67/7.30 # Success case prop solver time : 0.000
% 53.67/7.30 # Current number of processed clauses : 2469
% 53.67/7.30 # Positive orientable unit clauses : 80
% 53.67/7.30 # Positive unorientable unit clauses: 0
% 53.67/7.30 # Negative unit clauses : 62
% 53.67/7.30 # Non-unit-clauses : 2327
% 53.67/7.30 # Current number of unprocessed clauses: 309303
% 53.67/7.30 # ...number of literals in the above : 1040004
% 53.67/7.30 # Current number of archived formulas : 0
% 53.67/7.30 # Current number of archived clauses : 38
% 53.67/7.30 # Clause-clause subsumption calls (NU) : 964037
% 53.67/7.30 # Rec. Clause-clause subsumption calls : 786844
% 53.67/7.30 # Non-unit clause-clause subsumptions : 8634
% 53.67/7.30 # Unit Clause-clause subsumption calls : 8890
% 53.67/7.30 # Rewrite failures with RHS unbound : 0
% 53.67/7.30 # BW rewrite match attempts : 11240
% 53.67/7.30 # BW rewrite match successes : 3
% 53.67/7.30 # Condensation attempts : 0
% 53.67/7.30 # Condensation successes : 0
% 53.67/7.30 # Termbank termtop insertions : 6329888
% 53.67/7.30 # Search garbage collected termcells : 11
% 53.67/7.30
% 53.67/7.30 # -------------------------------------------------
% 53.67/7.30 # User time : 6.404 s
% 53.67/7.30 # System time : 0.248 s
% 53.67/7.30 # Total time : 6.653 s
% 53.67/7.30 # Maximum resident set size: 1652 pages
% 53.67/7.30
% 53.67/7.30 # -------------------------------------------------
% 53.67/7.30 # User time : 32.695 s
% 53.67/7.30 # System time : 0.687 s
% 53.67/7.30 # Total time : 33.382 s
% 53.67/7.30 # Maximum resident set size: 1708 pages
% 53.67/7.30 % E---3.1 exiting
% 53.67/7.30 % E exiting
%------------------------------------------------------------------------------