TSTP Solution File: LCL265-10 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : LCL265-10 : TPTP v8.1.2. Released v7.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n017.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 : 2400s
% WCLimit : 300s
% DateTime : Tue Oct 10 18:12:15 EDT 2023
% Result : Unsatisfiable 237.02s 31.16s
% Output : CNFRefutation 237.02s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 11
% Syntax : Number of clauses : 51 ( 51 unt; 0 nHn; 4 RR)
% Number of literals : 51 ( 50 equ; 3 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 10 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 2 con; 0-4 aty)
% Number of variables : 102 ( 7 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(axiom_1_5,axiom,
axiom(implies(or(X1,or(X2,X3)),or(X2,or(X1,X3)))) = true,
file('/export/starexec/sandbox2/tmp/tmp.H6m4Xq13gi/E---3.1_16922.p',axiom_1_5) ).
cnf(implies_definition,axiom,
implies(X1,X2) = or(not(X1),X2),
file('/export/starexec/sandbox2/tmp/tmp.H6m4Xq13gi/E---3.1_16922.p',implies_definition) ).
cnf(rule_2,axiom,
ifeq(theorem(implies(X1,X2)),true,ifeq(theorem(X1),true,theorem(X2),true),true) = true,
file('/export/starexec/sandbox2/tmp/tmp.H6m4Xq13gi/E---3.1_16922.p',rule_2) ).
cnf(rule_1,axiom,
ifeq(axiom(X1),true,theorem(X1),true) = true,
file('/export/starexec/sandbox2/tmp/tmp.H6m4Xq13gi/E---3.1_16922.p',rule_1) ).
cnf(ifeq_axiom,axiom,
ifeq(X1,X1,X2,X3) = X2,
file('/export/starexec/sandbox2/tmp/tmp.H6m4Xq13gi/E---3.1_16922.p',ifeq_axiom) ).
cnf(axiom_1_3,axiom,
axiom(implies(X1,or(X2,X1))) = true,
file('/export/starexec/sandbox2/tmp/tmp.H6m4Xq13gi/E---3.1_16922.p',axiom_1_3) ).
cnf(axiom_1_4,axiom,
axiom(implies(or(X1,X2),or(X2,X1))) = true,
file('/export/starexec/sandbox2/tmp/tmp.H6m4Xq13gi/E---3.1_16922.p',axiom_1_4) ).
cnf(axiom_1_6,axiom,
axiom(implies(implies(X1,X2),implies(or(X3,X1),or(X3,X2)))) = true,
file('/export/starexec/sandbox2/tmp/tmp.H6m4Xq13gi/E---3.1_16922.p',axiom_1_6) ).
cnf(equivalent_defn,axiom,
equivalent(X1,X2) = and(implies(X1,X2),implies(X2,X1)),
file('/export/starexec/sandbox2/tmp/tmp.H6m4Xq13gi/E---3.1_16922.p',equivalent_defn) ).
cnf(and_defn,axiom,
and(X1,X2) = not(or(not(X1),not(X2))),
file('/export/starexec/sandbox2/tmp/tmp.H6m4Xq13gi/E---3.1_16922.p',and_defn) ).
cnf(prove_this,negated_conjecture,
theorem(equivalent(p,not(not(p)))) != true,
file('/export/starexec/sandbox2/tmp/tmp.H6m4Xq13gi/E---3.1_16922.p',prove_this) ).
cnf(c_0_11,axiom,
axiom(implies(or(X1,or(X2,X3)),or(X2,or(X1,X3)))) = true,
axiom_1_5 ).
cnf(c_0_12,axiom,
implies(X1,X2) = or(not(X1),X2),
implies_definition ).
cnf(c_0_13,axiom,
ifeq(theorem(implies(X1,X2)),true,ifeq(theorem(X1),true,theorem(X2),true),true) = true,
rule_2 ).
cnf(c_0_14,axiom,
ifeq(axiom(X1),true,theorem(X1),true) = true,
rule_1 ).
cnf(c_0_15,plain,
axiom(or(not(or(X1,or(X2,X3))),or(X2,or(X1,X3)))) = true,
inference(rw,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_16,axiom,
ifeq(X1,X1,X2,X3) = X2,
ifeq_axiom ).
cnf(c_0_17,axiom,
axiom(implies(X1,or(X2,X1))) = true,
axiom_1_3 ).
cnf(c_0_18,axiom,
axiom(implies(or(X1,X2),or(X2,X1))) = true,
axiom_1_4 ).
cnf(c_0_19,plain,
ifeq(theorem(or(not(X1),X2)),true,ifeq(theorem(X1),true,theorem(X2),true),true) = true,
inference(rw,[status(thm)],[c_0_13,c_0_12]) ).
cnf(c_0_20,plain,
theorem(or(not(or(X1,or(X2,X3))),or(X2,or(X1,X3)))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16]) ).
cnf(c_0_21,plain,
axiom(or(not(X1),or(X2,X1))) = true,
inference(rw,[status(thm)],[c_0_17,c_0_12]) ).
cnf(c_0_22,plain,
axiom(or(not(or(X1,X2)),or(X2,X1))) = true,
inference(rw,[status(thm)],[c_0_18,c_0_12]) ).
cnf(c_0_23,plain,
ifeq(theorem(or(X1,or(X2,X3))),true,theorem(or(X2,or(X1,X3))),true) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_16]) ).
cnf(c_0_24,plain,
theorem(or(not(X1),or(X2,X1))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_21]),c_0_16]) ).
cnf(c_0_25,axiom,
axiom(implies(implies(X1,X2),implies(or(X3,X1),or(X3,X2)))) = true,
axiom_1_6 ).
cnf(c_0_26,plain,
theorem(or(not(or(X1,X2)),or(X2,X1))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_22]),c_0_16]) ).
cnf(c_0_27,plain,
ifeq(theorem(or(not(or(not(or(X1,or(X2,X3))),or(X2,or(X1,X3)))),X4)),true,theorem(X4),true) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_16]) ).
cnf(c_0_28,plain,
theorem(or(X1,or(not(X2),X2))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_16]) ).
cnf(c_0_29,plain,
axiom(or(not(or(not(X1),X2)),or(not(or(X3,X1)),or(X3,X2)))) = true,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_25,c_0_12]),c_0_12]),c_0_12]) ).
cnf(c_0_30,plain,
ifeq(theorem(or(X1,X2)),true,theorem(or(X2,X1)),true) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_26]),c_0_16]) ).
cnf(c_0_31,plain,
theorem(or(not(X1),X1)) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_16]) ).
cnf(c_0_32,plain,
theorem(or(not(or(not(X1),X2)),or(not(or(X3,X1)),or(X3,X2)))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_29]),c_0_16]) ).
cnf(c_0_33,plain,
theorem(or(X1,not(X1))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_16]) ).
cnf(c_0_34,plain,
ifeq(theorem(or(not(X1),X2)),true,theorem(or(not(or(X3,X1)),or(X3,X2))),true) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_32]),c_0_16]) ).
cnf(c_0_35,plain,
ifeq(theorem(or(not(or(X1,not(X1))),X2)),true,theorem(X2),true) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_33]),c_0_16]) ).
cnf(c_0_36,plain,
theorem(or(not(or(X1,X2)),or(X1,not(not(X2))))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_33]),c_0_16]) ).
cnf(c_0_37,plain,
theorem(or(X1,or(not(or(X2,X1)),X2))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_26]),c_0_16]) ).
cnf(c_0_38,plain,
theorem(or(X1,not(not(not(X1))))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_16]) ).
cnf(c_0_39,axiom,
equivalent(X1,X2) = and(implies(X1,X2),implies(X2,X1)),
equivalent_defn ).
cnf(c_0_40,axiom,
and(X1,X2) = not(or(not(X1),not(X2))),
and_defn ).
cnf(c_0_41,plain,
theorem(or(not(or(X1,not(or(X2,not(X2))))),X1)) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_37]),c_0_16]) ).
cnf(c_0_42,plain,
ifeq(theorem(X1),true,theorem(or(not(or(X2,not(X1))),X2)),true) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_37]),c_0_16]) ).
cnf(c_0_43,plain,
theorem(or(not(not(not(X1))),X1)) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_38]),c_0_16]) ).
cnf(c_0_44,negated_conjecture,
theorem(equivalent(p,not(not(p)))) != true,
prove_this ).
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_39,c_0_12]),c_0_12]),c_0_40]) ).
cnf(c_0_46,plain,
ifeq(theorem(or(X1,not(or(X2,not(X2))))),true,theorem(X1),true) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_41]),c_0_16]) ).
cnf(c_0_47,plain,
theorem(or(not(or(X1,not(or(not(not(not(X2))),X2)))),X1)) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_43]),c_0_16]) ).
cnf(c_0_48,negated_conjecture,
theorem(not(or(not(or(not(p),not(not(p)))),not(or(not(not(not(p))),p))))) != true,
inference(rw,[status(thm)],[c_0_44,c_0_45]) ).
cnf(c_0_49,plain,
theorem(not(or(not(or(X1,not(X1))),not(or(not(not(not(X2))),X2))))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_47]),c_0_16]) ).
cnf(c_0_50,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_48,c_0_49])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : LCL265-10 : TPTP v8.1.2. Released v7.3.0.
% 0.07/0.14 % Command : run_E %s %d THM
% 0.15/0.36 % Computer : n017.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.36 % CPULimit : 2400
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Mon Oct 2 11:59:41 EDT 2023
% 0.15/0.36 % 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/tmp/tmp.H6m4Xq13gi/E---3.1_16922.p
% 237.02/31.16 # Version: 3.1pre001
% 237.02/31.16 # Preprocessing class: FSSSSMSSSSSNFFN.
% 237.02/31.16 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 237.02/31.16 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 237.02/31.16 # Starting new_bool_3 with 300s (1) cores
% 237.02/31.16 # Starting new_bool_1 with 300s (1) cores
% 237.02/31.16 # Starting sh5l with 300s (1) cores
% 237.02/31.16 # G-E--_302_C18_F1_URBAN_RG_S04BN with pid 17001 completed with status 0
% 237.02/31.16 # Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 237.02/31.16 # Preprocessing class: FSSSSMSSSSSNFFN.
% 237.02/31.16 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 237.02/31.16 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 237.02/31.16 # No SInE strategy applied
% 237.02/31.16 # Search class: FUUPM-FFSF31-DFFFFFNN
% 237.02/31.16 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 237.02/31.16 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 338s (1) cores
% 237.02/31.16 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 237.02/31.16 # Starting new_bool_3 with 254s (1) cores
% 237.02/31.16 # Starting new_bool_1 with 254s (1) cores
% 237.02/31.16 # Starting sh5l with 254s (1) cores
% 237.02/31.16 # G-E--_302_C18_F1_URBAN_RG_S04BN with pid 17009 completed with status 0
% 237.02/31.16 # Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 237.02/31.16 # Preprocessing class: FSSSSMSSSSSNFFN.
% 237.02/31.16 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 237.02/31.16 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 237.02/31.16 # No SInE strategy applied
% 237.02/31.16 # Search class: FUUPM-FFSF31-DFFFFFNN
% 237.02/31.16 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 237.02/31.16 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 338s (1) cores
% 237.02/31.16 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 237.02/31.16 # Preprocessing time : 0.027 s
% 237.02/31.16
% 237.02/31.16 # Proof found!
% 237.02/31.16 # SZS status Unsatisfiable
% 237.02/31.16 # SZS output start CNFRefutation
% See solution above
% 237.02/31.16 # Parsed axioms : 12
% 237.02/31.16 # Removed by relevancy pruning/SinE : 0
% 237.02/31.16 # Initial clauses : 12
% 237.02/31.16 # Removed in clause preprocessing : 3
% 237.02/31.16 # Initial clauses in saturation : 9
% 237.02/31.16 # Processed clauses : 8797
% 237.02/31.16 # ...of these trivial : 3548
% 237.02/31.16 # ...subsumed : 0
% 237.02/31.16 # ...remaining for further processing : 5249
% 237.02/31.16 # Other redundant clauses eliminated : 0
% 237.02/31.16 # Clauses deleted for lack of memory : 0
% 237.02/31.16 # Backward-subsumed : 0
% 237.02/31.16 # Backward-rewritten : 4
% 237.02/31.16 # Generated clauses : 1871258
% 237.02/31.16 # ...of the previous two non-redundant : 372944
% 237.02/31.16 # ...aggressively subsumed : 0
% 237.02/31.16 # Contextual simplify-reflections : 0
% 237.02/31.16 # Paramodulations : 1871258
% 237.02/31.16 # Factorizations : 0
% 237.02/31.16 # NegExts : 0
% 237.02/31.16 # Equation resolutions : 0
% 237.02/31.16 # Total rewrite steps : 2207482
% 237.02/31.16 # Propositional unsat checks : 0
% 237.02/31.16 # Propositional check models : 0
% 237.02/31.16 # Propositional check unsatisfiable : 0
% 237.02/31.16 # Propositional clauses : 0
% 237.02/31.16 # Propositional clauses after purity: 0
% 237.02/31.16 # Propositional unsat core size : 0
% 237.02/31.16 # Propositional preprocessing time : 0.000
% 237.02/31.16 # Propositional encoding time : 0.000
% 237.02/31.16 # Propositional solver time : 0.000
% 237.02/31.16 # Success case prop preproc time : 0.000
% 237.02/31.16 # Success case prop encoding time : 0.000
% 237.02/31.16 # Success case prop solver time : 0.000
% 237.02/31.16 # Current number of processed clauses : 5245
% 237.02/31.16 # Positive orientable unit clauses : 5245
% 237.02/31.16 # Positive unorientable unit clauses: 0
% 237.02/31.16 # Negative unit clauses : 0
% 237.02/31.16 # Non-unit-clauses : 0
% 237.02/31.16 # Current number of unprocessed clauses: 364138
% 237.02/31.16 # ...number of literals in the above : 364138
% 237.02/31.16 # Current number of archived formulas : 0
% 237.02/31.16 # Current number of archived clauses : 7
% 237.02/31.16 # Clause-clause subsumption calls (NU) : 0
% 237.02/31.16 # Rec. Clause-clause subsumption calls : 0
% 237.02/31.16 # Non-unit clause-clause subsumptions : 0
% 237.02/31.16 # Unit Clause-clause subsumption calls : 0
% 237.02/31.16 # Rewrite failures with RHS unbound : 0
% 237.02/31.16 # BW rewrite match attempts : 1949378
% 237.02/31.16 # BW rewrite match successes : 4
% 237.02/31.16 # Condensation attempts : 0
% 237.02/31.16 # Condensation successes : 0
% 237.02/31.16 # Termbank termtop insertions : 57479158
% 237.02/31.16
% 237.02/31.16 # -------------------------------------------------
% 237.02/31.16 # User time : 28.589 s
% 237.02/31.16 # System time : 0.730 s
% 237.02/31.16 # Total time : 29.319 s
% 237.02/31.16 # Maximum resident set size: 1628 pages
% 237.02/31.16
% 237.02/31.16 # -------------------------------------------------
% 237.02/31.16 # User time : 146.324 s
% 237.02/31.16 # System time : 1.495 s
% 237.02/31.16 # Total time : 147.819 s
% 237.02/31.16 # Maximum resident set size: 1672 pages
% 237.02/31.16 % E---3.1 exiting
% 237.02/31.16 % E---3.1 exiting
%------------------------------------------------------------------------------