TSTP Solution File: LCL326-3 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : LCL326-3 : TPTP v8.2.0. Released v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n023.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:29 EDT 2024
% Result : Unsatisfiable 2.39s 0.79s
% Output : CNFRefutation 2.39s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 11
% Syntax : Number of clauses : 68 ( 31 unt; 0 nHn; 36 RR)
% Number of literals : 118 ( 7 equ; 56 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 : 6 ( 6 usr; 1 con; 0-2 aty)
% Number of variables : 131 ( 6 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(rule_2,axiom,
( theorem(X1)
| ~ theorem(implies(X2,X1))
| ~ theorem(X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL004-0.ax',rule_2) ).
cnf(implies_definition,axiom,
implies(X1,X2) = or(not(X1),X2),
file('/export/starexec/sandbox/benchmark/Axioms/LCL004-0.ax',implies_definition) ).
cnf(rule_1,axiom,
( theorem(X1)
| ~ axiom(X1) ),
file('/export/starexec/sandbox/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/sandbox/benchmark/Axioms/LCL004-0.ax',axiom_1_5) ).
cnf(axiom_1_2,axiom,
axiom(implies(or(X1,X1),X1)),
file('/export/starexec/sandbox/benchmark/Axioms/LCL004-0.ax',axiom_1_2) ).
cnf(axiom_1_3,axiom,
axiom(implies(X1,or(X2,X1))),
file('/export/starexec/sandbox/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/sandbox/benchmark/Axioms/LCL004-0.ax',axiom_1_6) ).
cnf(axiom_1_4,axiom,
axiom(implies(or(X1,X2),or(X2,X1))),
file('/export/starexec/sandbox/benchmark/Axioms/LCL004-0.ax',axiom_1_4) ).
cnf(prove_this,negated_conjecture,
~ theorem(not(equivalent(p,not(p)))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this) ).
cnf(equivalent_defn,axiom,
equivalent(X1,X2) = and(implies(X1,X2),implies(X2,X1)),
file('/export/starexec/sandbox/benchmark/Axioms/LCL004-2.ax',equivalent_defn) ).
cnf(and_defn,axiom,
and(X1,X2) = not(or(not(X1),not(X2))),
file('/export/starexec/sandbox/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(or(X1,or(X2,X3)),or(X2,or(X1,X3)))),
axiom_1_5 ).
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(X1,or(X2,X3))),or(X2,or(X1,X3)))),
inference(rw,[status(thm)],[c_0_17,c_0_13]) ).
cnf(c_0_20,plain,
( theorem(or(X1,or(X2,X3)))
| ~ theorem(or(X2,or(X1,X3))) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_21,axiom,
axiom(implies(or(X1,X1),X1)),
axiom_1_2 ).
cnf(c_0_22,plain,
( theorem(or(X1,or(X2,X3)))
| ~ axiom(or(X2,or(X1,X3))) ),
inference(spm,[status(thm)],[c_0_20,c_0_16]) ).
cnf(c_0_23,axiom,
axiom(implies(X1,or(X2,X1))),
axiom_1_3 ).
cnf(c_0_24,axiom,
axiom(implies(implies(X1,X2),implies(or(X3,X1),or(X3,X2)))),
axiom_1_6 ).
cnf(c_0_25,plain,
axiom(or(not(or(X1,X1)),X1)),
inference(rw,[status(thm)],[c_0_21,c_0_13]) ).
cnf(c_0_26,plain,
( theorem(or(X1,X2))
| ~ theorem(X3)
| ~ axiom(or(X1,or(not(X3),X2))) ),
inference(spm,[status(thm)],[c_0_15,c_0_22]) ).
cnf(c_0_27,plain,
axiom(or(not(X1),or(X2,X1))),
inference(rw,[status(thm)],[c_0_23,c_0_13]) ).
cnf(c_0_28,axiom,
axiom(implies(or(X1,X2),or(X2,X1))),
axiom_1_4 ).
cnf(c_0_29,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_24,c_0_13]),c_0_13]),c_0_13]) ).
cnf(c_0_30,plain,
( theorem(X1)
| ~ theorem(or(X1,X1)) ),
inference(spm,[status(thm)],[c_0_18,c_0_25]) ).
cnf(c_0_31,plain,
( theorem(or(not(or(or(not(X1),X2),or(not(X1),X2))),X2))
| ~ theorem(X1) ),
inference(spm,[status(thm)],[c_0_26,c_0_25]) ).
cnf(c_0_32,plain,
( theorem(or(X1,X2))
| ~ theorem(X2) ),
inference(spm,[status(thm)],[c_0_18,c_0_27]) ).
cnf(c_0_33,plain,
axiom(or(not(or(X1,X2)),or(X2,X1))),
inference(rw,[status(thm)],[c_0_28,c_0_13]) ).
cnf(c_0_34,plain,
( theorem(or(not(or(X1,X2)),or(X1,X3)))
| ~ theorem(or(not(X2),X3)) ),
inference(spm,[status(thm)],[c_0_18,c_0_29]) ).
cnf(c_0_35,plain,
( theorem(or(X1,X2))
| ~ axiom(or(X1,or(or(X1,X2),X2))) ),
inference(spm,[status(thm)],[c_0_30,c_0_22]) ).
cnf(c_0_36,plain,
( theorem(X1)
| ~ theorem(or(or(not(X2),X1),or(not(X2),X1)))
| ~ theorem(X2) ),
inference(spm,[status(thm)],[c_0_15,c_0_31]) ).
cnf(c_0_37,plain,
( theorem(or(X1,or(X2,X3)))
| ~ theorem(or(X1,X3)) ),
inference(spm,[status(thm)],[c_0_20,c_0_32]) ).
cnf(c_0_38,plain,
( theorem(or(X1,X2))
| ~ theorem(or(X2,X1)) ),
inference(spm,[status(thm)],[c_0_18,c_0_33]) ).
cnf(c_0_39,plain,
( theorem(or(X1,or(not(or(X1,X2)),X3)))
| ~ theorem(or(not(X2),X3)) ),
inference(spm,[status(thm)],[c_0_20,c_0_34]) ).
cnf(c_0_40,plain,
theorem(or(not(X1),X1)),
inference(spm,[status(thm)],[c_0_35,c_0_27]) ).
cnf(c_0_41,plain,
( theorem(X1)
| ~ theorem(or(or(not(X2),X1),X1))
| ~ theorem(X2) ),
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_42,plain,
( theorem(or(or(not(or(X1,X2)),X3),X1))
| ~ theorem(or(not(X2),X3)) ),
inference(spm,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_43,plain,
( theorem(or(X1,X2))
| ~ theorem(or(not(X3),X2))
| ~ theorem(or(X1,X3)) ),
inference(spm,[status(thm)],[c_0_15,c_0_34]) ).
cnf(c_0_44,plain,
theorem(or(X1,not(X1))),
inference(spm,[status(thm)],[c_0_38,c_0_40]) ).
cnf(c_0_45,plain,
( theorem(X1)
| ~ theorem(or(not(X2),X1))
| ~ theorem(or(X1,X2)) ),
inference(spm,[status(thm)],[c_0_41,c_0_42]) ).
cnf(c_0_46,plain,
( theorem(or(X1,not(not(X2))))
| ~ theorem(or(X1,X2)) ),
inference(spm,[status(thm)],[c_0_43,c_0_44]) ).
cnf(c_0_47,plain,
( theorem(or(X1,X2))
| ~ theorem(or(X1,X3))
| ~ axiom(or(not(X3),X2)) ),
inference(spm,[status(thm)],[c_0_43,c_0_16]) ).
cnf(c_0_48,negated_conjecture,
~ theorem(not(equivalent(p,not(p)))),
inference(fof_simplification,[status(thm)],[prove_this]) ).
cnf(c_0_49,axiom,
equivalent(X1,X2) = and(implies(X1,X2),implies(X2,X1)),
equivalent_defn ).
cnf(c_0_50,axiom,
and(X1,X2) = not(or(not(X1),not(X2))),
and_defn ).
cnf(c_0_51,plain,
( theorem(not(not(X1)))
| ~ theorem(or(not(not(X1)),X2))
| ~ theorem(or(not(X2),X1)) ),
inference(spm,[status(thm)],[c_0_45,c_0_46]) ).
cnf(c_0_52,plain,
( theorem(or(X1,or(X2,X3)))
| ~ theorem(or(X1,or(X3,X2))) ),
inference(spm,[status(thm)],[c_0_47,c_0_33]) ).
cnf(c_0_53,negated_conjecture,
~ theorem(not(equivalent(p,not(p)))),
c_0_48 ).
cnf(c_0_54,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_49,c_0_13]),c_0_13]),c_0_50]) ).
cnf(c_0_55,plain,
( theorem(not(not(X1)))
| ~ theorem(or(not(not(not(not(X1)))),X1)) ),
inference(spm,[status(thm)],[c_0_51,c_0_44]) ).
cnf(c_0_56,plain,
( theorem(or(X1,or(X2,X3)))
| ~ theorem(or(X3,X2)) ),
inference(spm,[status(thm)],[c_0_52,c_0_32]) ).
cnf(c_0_57,plain,
( theorem(or(X1,X2))
| ~ axiom(or(X2,X1)) ),
inference(spm,[status(thm)],[c_0_38,c_0_16]) ).
cnf(c_0_58,negated_conjecture,
~ theorem(not(not(or(not(or(not(p),not(p))),not(or(not(not(p)),p)))))),
inference(rw,[status(thm)],[c_0_53,c_0_54]) ).
cnf(c_0_59,plain,
( theorem(not(not(or(X1,X2))))
| ~ theorem(or(X2,X1)) ),
inference(spm,[status(thm)],[c_0_55,c_0_56]) ).
cnf(c_0_60,plain,
( theorem(or(X1,X2))
| ~ theorem(or(X1,X3))
| ~ axiom(or(X2,not(X3))) ),
inference(spm,[status(thm)],[c_0_43,c_0_57]) ).
cnf(c_0_61,negated_conjecture,
~ theorem(or(not(or(not(not(p)),p)),not(or(not(p),not(p))))),
inference(spm,[status(thm)],[c_0_58,c_0_59]) ).
cnf(c_0_62,plain,
( theorem(or(X1,not(or(not(X2),not(X2)))))
| ~ theorem(or(X1,X2)) ),
inference(spm,[status(thm)],[c_0_60,c_0_25]) ).
cnf(c_0_63,plain,
( theorem(or(X1,X2))
| ~ theorem(or(X1,or(X2,X2))) ),
inference(spm,[status(thm)],[c_0_47,c_0_25]) ).
cnf(c_0_64,plain,
( theorem(or(not(or(not(X1),X2)),or(X3,X2)))
| ~ theorem(or(X3,X1)) ),
inference(spm,[status(thm)],[c_0_26,c_0_29]) ).
cnf(c_0_65,negated_conjecture,
~ theorem(or(not(or(not(not(p)),p)),p)),
inference(spm,[status(thm)],[c_0_61,c_0_62]) ).
cnf(c_0_66,plain,
( theorem(or(not(or(not(X1),X2)),X2))
| ~ theorem(or(X2,X1)) ),
inference(spm,[status(thm)],[c_0_63,c_0_64]) ).
cnf(c_0_67,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_65,c_0_66]),c_0_44])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.14 % Problem : LCL326-3 : TPTP v8.2.0. Released v2.3.0.
% 0.08/0.15 % Command : run_E %s %d THM
% 0.15/0.36 % Computer : n023.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.37 % CPULimit : 300
% 0.15/0.37 % WCLimit : 300
% 0.15/0.37 % DateTime : Mon May 20 03:17:08 EDT 2024
% 0.15/0.37 % CPUTime :
% 0.22/0.50 Running first-order model finding
% 0.22/0.50 Running: /export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p
% 2.39/0.79 # Version: 3.1.0
% 2.39/0.79 # Preprocessing class: FSSSSMSSSSSNFFN.
% 2.39/0.79 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.39/0.79 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 2.39/0.79 # Starting new_bool_3 with 300s (1) cores
% 2.39/0.79 # Starting new_bool_1 with 300s (1) cores
% 2.39/0.79 # Starting sh5l with 300s (1) cores
% 2.39/0.79 # G-E--_302_C18_F1_URBAN_RG_S04BN with pid 32516 completed with status 0
% 2.39/0.79 # Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 2.39/0.79 # Preprocessing class: FSSSSMSSSSSNFFN.
% 2.39/0.79 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.39/0.79 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 2.39/0.79 # No SInE strategy applied
% 2.39/0.79 # Search class: FHUNM-FFSF21-DFFFFFNN
% 2.39/0.79 # Scheduled 5 strats onto 5 cores with 1500 seconds (1500 total)
% 2.39/0.79 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 395s (1) cores
% 2.39/0.79 # Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN with 334s (1) cores
% 2.39/0.79 # Starting new_bool_3 with 329s (1) cores
% 2.39/0.79 # Starting new_bool_1 with 324s (1) cores
% 2.39/0.79 # Starting G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 118s (1) cores
% 2.39/0.79 # G-E--_302_C18_F1_URBAN_RG_S04BN with pid 32521 completed with status 0
% 2.39/0.79 # Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 2.39/0.79 # Preprocessing class: FSSSSMSSSSSNFFN.
% 2.39/0.79 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.39/0.79 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 2.39/0.79 # No SInE strategy applied
% 2.39/0.79 # Search class: FHUNM-FFSF21-DFFFFFNN
% 2.39/0.79 # Scheduled 5 strats onto 5 cores with 1500 seconds (1500 total)
% 2.39/0.79 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 395s (1) cores
% 2.39/0.79 # Preprocessing time : 0.011 s
% 2.39/0.79
% 2.39/0.79 # Proof found!
% 2.39/0.79 # SZS status Unsatisfiable
% 2.39/0.79 # SZS output start CNFRefutation
% See solution above
% 2.39/0.79 # Parsed axioms : 11
% 2.39/0.79 # Removed by relevancy pruning/SinE : 0
% 2.39/0.79 # Initial clauses : 11
% 2.39/0.79 # Removed in clause preprocessing : 3
% 2.39/0.79 # Initial clauses in saturation : 8
% 2.39/0.79 # Processed clauses : 1888
% 2.39/0.79 # ...of these trivial : 18
% 2.39/0.79 # ...subsumed : 1239
% 2.39/0.79 # ...remaining for further processing : 631
% 2.39/0.79 # Other redundant clauses eliminated : 0
% 2.39/0.79 # Clauses deleted for lack of memory : 0
% 2.39/0.79 # Backward-subsumed : 6
% 2.39/0.79 # Backward-rewritten : 0
% 2.39/0.79 # Generated clauses : 18682
% 2.39/0.79 # ...of the previous two non-redundant : 18186
% 2.39/0.79 # ...aggressively subsumed : 0
% 2.39/0.79 # Contextual simplify-reflections : 1
% 2.39/0.79 # Paramodulations : 18682
% 2.39/0.79 # Factorizations : 0
% 2.39/0.79 # NegExts : 0
% 2.39/0.79 # Equation resolutions : 0
% 2.39/0.79 # Disequality decompositions : 0
% 2.39/0.79 # Total rewrite steps : 363
% 2.39/0.79 # ...of those cached : 302
% 2.39/0.79 # Propositional unsat checks : 0
% 2.39/0.79 # Propositional check models : 0
% 2.39/0.79 # Propositional check unsatisfiable : 0
% 2.39/0.79 # Propositional clauses : 0
% 2.39/0.79 # Propositional clauses after purity: 0
% 2.39/0.79 # Propositional unsat core size : 0
% 2.39/0.79 # Propositional preprocessing time : 0.000
% 2.39/0.79 # Propositional encoding time : 0.000
% 2.39/0.79 # Propositional solver time : 0.000
% 2.39/0.79 # Success case prop preproc time : 0.000
% 2.39/0.79 # Success case prop encoding time : 0.000
% 2.39/0.79 # Success case prop solver time : 0.000
% 2.39/0.79 # Current number of processed clauses : 625
% 2.39/0.79 # Positive orientable unit clauses : 32
% 2.39/0.79 # Positive unorientable unit clauses: 0
% 2.39/0.79 # Negative unit clauses : 22
% 2.39/0.79 # Non-unit-clauses : 571
% 2.39/0.79 # Current number of unprocessed clauses: 16281
% 2.39/0.79 # ...number of literals in the above : 55209
% 2.39/0.79 # Current number of archived formulas : 0
% 2.39/0.79 # Current number of archived clauses : 9
% 2.39/0.79 # Clause-clause subsumption calls (NU) : 51249
% 2.39/0.79 # Rec. Clause-clause subsumption calls : 45086
% 2.39/0.79 # Non-unit clause-clause subsumptions : 1219
% 2.39/0.79 # Unit Clause-clause subsumption calls : 1227
% 2.39/0.79 # Rewrite failures with RHS unbound : 0
% 2.39/0.79 # BW rewrite match attempts : 716
% 2.39/0.79 # BW rewrite match successes : 2
% 2.39/0.79 # Condensation attempts : 0
% 2.39/0.79 # Condensation successes : 0
% 2.39/0.79 # Termbank termtop insertions : 317152
% 2.39/0.79 # Search garbage collected termcells : 11
% 2.39/0.79
% 2.39/0.79 # -------------------------------------------------
% 2.39/0.79 # User time : 0.267 s
% 2.39/0.79 # System time : 0.010 s
% 2.39/0.79 # Total time : 0.277 s
% 2.39/0.79 # Maximum resident set size: 1652 pages
% 2.39/0.79
% 2.39/0.79 # -------------------------------------------------
% 2.39/0.79 # User time : 1.346 s
% 2.39/0.79 # System time : 0.039 s
% 2.39/0.79 # Total time : 1.384 s
% 2.39/0.79 # Maximum resident set size: 1708 pages
% 2.39/0.79 % E---3.1 exiting
%------------------------------------------------------------------------------