TSTP Solution File: LCL269-3 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : LCL269-3 : TPTP v8.2.0. Released v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n026.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:56:19 EDT 2024
% Result : Unsatisfiable 8.32s 1.49s
% Output : CNFRefutation 8.32s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 10
% Syntax : Number of clauses : 63 ( 28 unt; 0 nHn; 34 RR)
% Number of literals : 111 ( 7 equ; 56 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 11 ( 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 : 107 ( 10 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_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(axiom_1_3,axiom,
axiom(implies(X1,or(X2,X1))),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-0.ax',axiom_1_3) ).
cnf(prove_this,negated_conjecture,
~ theorem(equivalent(equivalent(p,q),equivalent(q,p))),
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_10,plain,
( theorem(X1)
| ~ theorem(implies(X2,X1))
| ~ theorem(X2) ),
inference(fof_simplification,[status(thm)],[rule_2]) ).
cnf(c_0_11,plain,
( theorem(X1)
| ~ theorem(implies(X2,X1))
| ~ theorem(X2) ),
c_0_10 ).
cnf(c_0_12,axiom,
implies(X1,X2) = or(not(X1),X2),
implies_definition ).
cnf(c_0_13,plain,
( theorem(X1)
| ~ axiom(X1) ),
inference(fof_simplification,[status(thm)],[rule_1]) ).
cnf(c_0_14,plain,
( theorem(X1)
| ~ theorem(X2)
| ~ theorem(or(not(X2),X1)) ),
inference(rw,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_15,plain,
( theorem(X1)
| ~ axiom(X1) ),
c_0_13 ).
cnf(c_0_16,axiom,
axiom(implies(implies(X1,X2),implies(or(X3,X1),or(X3,X2)))),
axiom_1_6 ).
cnf(c_0_17,plain,
( theorem(X1)
| ~ theorem(X2)
| ~ axiom(or(not(X2),X1)) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_18,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_16,c_0_12]),c_0_12]),c_0_12]) ).
cnf(c_0_19,plain,
( theorem(or(not(or(X1,X2)),or(X1,X3)))
| ~ theorem(or(not(X2),X3)) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_20,plain,
( theorem(or(X1,X2))
| ~ theorem(or(not(X3),X2))
| ~ theorem(or(X1,X3)) ),
inference(spm,[status(thm)],[c_0_14,c_0_19]) ).
cnf(c_0_21,axiom,
axiom(implies(or(X1,X1),X1)),
axiom_1_2 ).
cnf(c_0_22,axiom,
axiom(implies(or(X1,X2),or(X2,X1))),
axiom_1_4 ).
cnf(c_0_23,axiom,
axiom(implies(X1,or(X2,X1))),
axiom_1_3 ).
cnf(c_0_24,plain,
( theorem(or(X1,X2))
| ~ theorem(or(X1,X3))
| ~ axiom(or(not(X3),X2)) ),
inference(spm,[status(thm)],[c_0_20,c_0_15]) ).
cnf(c_0_25,plain,
axiom(or(not(or(X1,X1)),X1)),
inference(rw,[status(thm)],[c_0_21,c_0_12]) ).
cnf(c_0_26,plain,
axiom(or(not(or(X1,X2)),or(X2,X1))),
inference(rw,[status(thm)],[c_0_22,c_0_12]) ).
cnf(c_0_27,plain,
axiom(or(not(X1),or(X2,X1))),
inference(rw,[status(thm)],[c_0_23,c_0_12]) ).
cnf(c_0_28,plain,
( theorem(or(X1,X2))
| ~ theorem(or(X1,or(X2,X2))) ),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_29,plain,
( theorem(or(X1,X2))
| ~ theorem(or(X2,X1)) ),
inference(spm,[status(thm)],[c_0_17,c_0_26]) ).
cnf(c_0_30,plain,
( theorem(or(X1,X2))
| ~ theorem(X2) ),
inference(spm,[status(thm)],[c_0_17,c_0_27]) ).
cnf(c_0_31,plain,
( theorem(or(not(or(X1,X2)),X1))
| ~ theorem(or(not(X2),X1)) ),
inference(spm,[status(thm)],[c_0_28,c_0_19]) ).
cnf(c_0_32,plain,
( theorem(or(X1,X2))
| ~ theorem(X1) ),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_33,negated_conjecture,
~ theorem(equivalent(equivalent(p,q),equivalent(q,p))),
inference(fof_simplification,[status(thm)],[prove_this]) ).
cnf(c_0_34,axiom,
equivalent(X1,X2) = and(implies(X1,X2),implies(X2,X1)),
equivalent_defn ).
cnf(c_0_35,axiom,
and(X1,X2) = not(or(not(X1),not(X2))),
and_defn ).
cnf(c_0_36,plain,
( theorem(X1)
| ~ theorem(or(not(X2),X1))
| ~ theorem(or(X1,X2)) ),
inference(spm,[status(thm)],[c_0_14,c_0_31]) ).
cnf(c_0_37,plain,
( theorem(or(X1,X2))
| ~ theorem(or(X1,X3))
| ~ theorem(not(X3)) ),
inference(spm,[status(thm)],[c_0_20,c_0_32]) ).
cnf(c_0_38,plain,
( theorem(or(X1,X2))
| ~ axiom(or(X2,X1)) ),
inference(spm,[status(thm)],[c_0_29,c_0_15]) ).
cnf(c_0_39,negated_conjecture,
~ theorem(equivalent(equivalent(p,q),equivalent(q,p))),
c_0_33 ).
cnf(c_0_40,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_34,c_0_12]),c_0_12]),c_0_35]) ).
cnf(c_0_41,plain,
( theorem(X1)
| ~ theorem(or(X1,X2))
| ~ theorem(not(X2)) ),
inference(spm,[status(thm)],[c_0_36,c_0_32]) ).
cnf(c_0_42,plain,
( theorem(or(X1,X2))
| ~ theorem(not(X3))
| ~ axiom(or(X1,X3)) ),
inference(spm,[status(thm)],[c_0_37,c_0_15]) ).
cnf(c_0_43,plain,
( theorem(X1)
| ~ theorem(X2)
| ~ axiom(or(X1,not(X2))) ),
inference(spm,[status(thm)],[c_0_14,c_0_38]) ).
cnf(c_0_44,plain,
( theorem(or(X1,X2))
| ~ axiom(or(X1,or(X2,X2))) ),
inference(spm,[status(thm)],[c_0_28,c_0_15]) ).
cnf(c_0_45,negated_conjecture,
~ theorem(not(or(not(or(not(not(or(not(or(not(p),q)),not(or(not(q),p))))),not(or(not(or(not(q),p)),not(or(not(p),q)))))),not(or(not(not(or(not(or(not(q),p)),not(or(not(p),q))))),not(or(not(or(not(p),q)),not(or(not(q),p))))))))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_39,c_0_40]),c_0_40]),c_0_40]) ).
cnf(c_0_46,plain,
( theorem(not(or(X1,X2)))
| ~ theorem(or(not(X2),X1))
| ~ theorem(not(X1)) ),
inference(spm,[status(thm)],[c_0_41,c_0_31]) ).
cnf(c_0_47,plain,
( theorem(or(not(X1),X2))
| ~ theorem(not(or(X3,X1))) ),
inference(spm,[status(thm)],[c_0_42,c_0_27]) ).
cnf(c_0_48,plain,
( theorem(not(or(not(X1),not(X1))))
| ~ theorem(X1) ),
inference(spm,[status(thm)],[c_0_43,c_0_25]) ).
cnf(c_0_49,plain,
theorem(or(not(X1),X1)),
inference(spm,[status(thm)],[c_0_44,c_0_27]) ).
cnf(c_0_50,negated_conjecture,
( ~ theorem(or(not(not(or(not(not(or(not(or(not(q),p)),not(or(not(p),q))))),not(or(not(or(not(p),q)),not(or(not(q),p))))))),not(or(not(not(or(not(or(not(p),q)),not(or(not(q),p))))),not(or(not(or(not(q),p)),not(or(not(p),q))))))))
| ~ theorem(not(not(or(not(not(or(not(or(not(p),q)),not(or(not(q),p))))),not(or(not(or(not(q),p)),not(or(not(p),q)))))))) ),
inference(spm,[status(thm)],[c_0_45,c_0_46]) ).
cnf(c_0_51,plain,
( theorem(or(not(not(X1)),X2))
| ~ theorem(X1) ),
inference(spm,[status(thm)],[c_0_47,c_0_48]) ).
cnf(c_0_52,plain,
( theorem(X1)
| ~ theorem(or(X1,X1)) ),
inference(spm,[status(thm)],[c_0_17,c_0_25]) ).
cnf(c_0_53,plain,
theorem(or(X1,not(X1))),
inference(spm,[status(thm)],[c_0_29,c_0_49]) ).
cnf(c_0_54,negated_conjecture,
( ~ theorem(not(not(or(not(not(or(not(or(not(p),q)),not(or(not(q),p))))),not(or(not(or(not(q),p)),not(or(not(p),q))))))))
| ~ theorem(or(not(not(or(not(or(not(q),p)),not(or(not(p),q))))),not(or(not(or(not(p),q)),not(or(not(q),p)))))) ),
inference(spm,[status(thm)],[c_0_50,c_0_51]) ).
cnf(c_0_55,plain,
( theorem(not(not(X1)))
| ~ theorem(X1) ),
inference(spm,[status(thm)],[c_0_52,c_0_51]) ).
cnf(c_0_56,plain,
( theorem(or(X1,not(not(X2))))
| ~ theorem(or(X1,X2)) ),
inference(spm,[status(thm)],[c_0_20,c_0_53]) ).
cnf(c_0_57,plain,
( theorem(or(X1,or(X2,X3)))
| ~ theorem(or(X1,or(X3,X2))) ),
inference(spm,[status(thm)],[c_0_24,c_0_26]) ).
cnf(c_0_58,negated_conjecture,
( ~ theorem(or(not(not(or(not(or(not(q),p)),not(or(not(p),q))))),not(or(not(or(not(p),q)),not(or(not(q),p))))))
| ~ theorem(or(not(not(or(not(or(not(p),q)),not(or(not(q),p))))),not(or(not(or(not(q),p)),not(or(not(p),q)))))) ),
inference(spm,[status(thm)],[c_0_54,c_0_55]) ).
cnf(c_0_59,plain,
( theorem(or(not(not(X1)),X2))
| ~ theorem(or(X2,X1)) ),
inference(spm,[status(thm)],[c_0_29,c_0_56]) ).
cnf(c_0_60,plain,
theorem(or(not(or(X1,X2)),or(X2,X1))),
inference(spm,[status(thm)],[c_0_57,c_0_49]) ).
cnf(c_0_61,negated_conjecture,
~ theorem(or(not(not(or(not(or(not(p),q)),not(or(not(q),p))))),not(or(not(or(not(q),p)),not(or(not(p),q)))))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_59]),c_0_60])]) ).
cnf(c_0_62,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_61,c_0_59]),c_0_60])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.11 % Problem : LCL269-3 : TPTP v8.2.0. Released v2.3.0.
% 0.11/0.13 % Command : run_E %s %d THM
% 0.13/0.33 % Computer : n026.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 300
% 0.13/0.33 % DateTime : Mon May 20 01:52:38 EDT 2024
% 0.13/0.33 % CPUTime :
% 0.20/0.46 Running first-order model finding
% 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 --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 8.32/1.49 # Version: 3.1.0
% 8.32/1.49 # Preprocessing class: FSSSSMSSSSSNFFN.
% 8.32/1.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 8.32/1.49 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 8.32/1.49 # Starting new_bool_3 with 300s (1) cores
% 8.32/1.49 # Starting new_bool_1 with 300s (1) cores
% 8.32/1.49 # Starting sh5l with 300s (1) cores
% 8.32/1.49 # G-E--_302_C18_F1_URBAN_RG_S04BN with pid 26957 completed with status 0
% 8.32/1.49 # Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 8.32/1.49 # Preprocessing class: FSSSSMSSSSSNFFN.
% 8.32/1.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 8.32/1.49 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 8.32/1.49 # No SInE strategy applied
% 8.32/1.49 # Search class: FHUNM-FFSF21-DFFFFFNN
% 8.32/1.49 # Scheduled 5 strats onto 5 cores with 1500 seconds (1500 total)
% 8.32/1.49 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 395s (1) cores
% 8.32/1.49 # Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN with 334s (1) cores
% 8.32/1.49 # Starting new_bool_3 with 329s (1) cores
% 8.32/1.49 # Starting new_bool_1 with 324s (1) cores
% 8.32/1.49 # Starting G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 118s (1) cores
% 8.32/1.49 # G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with pid 26968 completed with status 0
% 8.32/1.49 # Result found by G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 8.32/1.49 # Preprocessing class: FSSSSMSSSSSNFFN.
% 8.32/1.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 8.32/1.49 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 8.32/1.49 # No SInE strategy applied
% 8.32/1.49 # Search class: FHUNM-FFSF21-DFFFFFNN
% 8.32/1.49 # Scheduled 5 strats onto 5 cores with 1500 seconds (1500 total)
% 8.32/1.49 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 395s (1) cores
% 8.32/1.49 # Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN with 334s (1) cores
% 8.32/1.49 # Starting new_bool_3 with 329s (1) cores
% 8.32/1.49 # Starting new_bool_1 with 324s (1) cores
% 8.32/1.49 # Starting G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 118s (1) cores
% 8.32/1.49 # Preprocessing time : 0.001 s
% 8.32/1.49 # Presaturation interreduction done
% 8.32/1.49
% 8.32/1.49 # Proof found!
% 8.32/1.49 # SZS status Unsatisfiable
% 8.32/1.49 # SZS output start CNFRefutation
% See solution above
% 8.32/1.49 # Parsed axioms : 11
% 8.32/1.49 # Removed by relevancy pruning/SinE : 0
% 8.32/1.49 # Initial clauses : 11
% 8.32/1.49 # Removed in clause preprocessing : 3
% 8.32/1.49 # Initial clauses in saturation : 8
% 8.32/1.49 # Processed clauses : 12505
% 8.32/1.49 # ...of these trivial : 176
% 8.32/1.49 # ...subsumed : 10393
% 8.32/1.49 # ...remaining for further processing : 1936
% 8.32/1.49 # Other redundant clauses eliminated : 0
% 8.32/1.49 # Clauses deleted for lack of memory : 0
% 8.32/1.49 # Backward-subsumed : 73
% 8.32/1.49 # Backward-rewritten : 14
% 8.32/1.49 # Generated clauses : 91525
% 8.32/1.49 # ...of the previous two non-redundant : 87023
% 8.32/1.49 # ...aggressively subsumed : 0
% 8.32/1.49 # Contextual simplify-reflections : 5
% 8.32/1.49 # Paramodulations : 91525
% 8.32/1.49 # Factorizations : 0
% 8.32/1.49 # NegExts : 0
% 8.32/1.49 # Equation resolutions : 0
% 8.32/1.49 # Disequality decompositions : 0
% 8.32/1.49 # Total rewrite steps : 4654
% 8.32/1.49 # ...of those cached : 4127
% 8.32/1.49 # Propositional unsat checks : 0
% 8.32/1.49 # Propositional check models : 0
% 8.32/1.49 # Propositional check unsatisfiable : 0
% 8.32/1.49 # Propositional clauses : 0
% 8.32/1.49 # Propositional clauses after purity: 0
% 8.32/1.49 # Propositional unsat core size : 0
% 8.32/1.49 # Propositional preprocessing time : 0.000
% 8.32/1.49 # Propositional encoding time : 0.000
% 8.32/1.49 # Propositional solver time : 0.000
% 8.32/1.49 # Success case prop preproc time : 0.000
% 8.32/1.49 # Success case prop encoding time : 0.000
% 8.32/1.49 # Success case prop solver time : 0.000
% 8.32/1.49 # Current number of processed clauses : 1841
% 8.32/1.49 # Positive orientable unit clauses : 111
% 8.32/1.49 # Positive unorientable unit clauses: 0
% 8.32/1.49 # Negative unit clauses : 32
% 8.32/1.49 # Non-unit-clauses : 1698
% 8.32/1.49 # Current number of unprocessed clauses: 73642
% 8.32/1.49 # ...number of literals in the above : 204872
% 8.32/1.49 # Current number of archived formulas : 0
% 8.32/1.49 # Current number of archived clauses : 98
% 8.32/1.49 # Clause-clause subsumption calls (NU) : 425676
% 8.32/1.49 # Rec. Clause-clause subsumption calls : 391560
% 8.32/1.49 # Non-unit clause-clause subsumptions : 10380
% 8.32/1.49 # Unit Clause-clause subsumption calls : 3753
% 8.32/1.49 # Rewrite failures with RHS unbound : 0
% 8.32/1.49 # BW rewrite match attempts : 6018
% 8.32/1.49 # BW rewrite match successes : 14
% 8.32/1.49 # Condensation attempts : 0
% 8.32/1.49 # Condensation successes : 0
% 8.32/1.49 # Termbank termtop insertions : 1404110
% 8.32/1.49 # Search garbage collected termcells : 11
% 8.32/1.49
% 8.32/1.49 # -------------------------------------------------
% 8.32/1.49 # User time : 0.957 s
% 8.32/1.49 # System time : 0.042 s
% 8.32/1.49 # Total time : 0.999 s
% 8.32/1.49 # Maximum resident set size: 1652 pages
% 8.32/1.49
% 8.32/1.49 # -------------------------------------------------
% 8.32/1.49 # User time : 4.883 s
% 8.32/1.49 # System time : 0.108 s
% 8.32/1.49 # Total time : 4.992 s
% 8.32/1.49 # Maximum resident set size: 1712 pages
% 8.32/1.49 % E---3.1 exiting
%------------------------------------------------------------------------------