TSTP Solution File: LCL250-10 by E---3.2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.2.0
% Problem : LCL250-10 : TPTP v8.2.0. Released v7.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n032.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 Jun 24 10:44:13 EDT 2024
% Result : Timeout 324.37s 36.80s
% Output : None
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 11
% Syntax : Number of clauses : 57 ( 57 unt; 0 nHn; 4 RR)
% Number of literals : 57 ( 56 equ; 3 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 7 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 4 con; 0-4 aty)
% Number of variables : 119 ( 14 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(rule_1,axiom,
ifeq(axiom(X1),true,theorem(X1),true) = true,
file('/export/starexec/sandbox/tmp/tmp.ci0PL9Byfu/E---3.1_20206.p',rule_1) ).
cnf(axiom_1_2,axiom,
axiom(implies(or(X1,X1),X1)) = true,
file('/export/starexec/sandbox/tmp/tmp.ci0PL9Byfu/E---3.1_20206.p',axiom_1_2) ).
cnf(ifeq_axiom,axiom,
ifeq(X1,X1,X2,X3) = X2,
file('/export/starexec/sandbox/tmp/tmp.ci0PL9Byfu/E---3.1_20206.p',ifeq_axiom) ).
cnf(axiom_1_6,axiom,
axiom(implies(implies(X1,X2),implies(or(X3,X1),or(X3,X2)))) = true,
file('/export/starexec/sandbox/tmp/tmp.ci0PL9Byfu/E---3.1_20206.p',axiom_1_6) ).
cnf(axiom_1_3,axiom,
axiom(implies(X1,or(X2,X1))) = true,
file('/export/starexec/sandbox/tmp/tmp.ci0PL9Byfu/E---3.1_20206.p',axiom_1_3) ).
cnf(rule_2,axiom,
ifeq(theorem(implies(X1,X2)),true,ifeq(theorem(X1),true,theorem(X2),true),true) = true,
file('/export/starexec/sandbox/tmp/tmp.ci0PL9Byfu/E---3.1_20206.p',rule_2) ).
cnf(implies_definition,axiom,
implies(X1,X2) = or(not(X1),X2),
file('/export/starexec/sandbox/tmp/tmp.ci0PL9Byfu/E---3.1_20206.p',implies_definition) ).
cnf(axiom_1_4,axiom,
axiom(implies(or(X1,X2),or(X2,X1))) = true,
file('/export/starexec/sandbox/tmp/tmp.ci0PL9Byfu/E---3.1_20206.p',axiom_1_4) ).
cnf(axiom_1_5,axiom,
axiom(implies(or(X1,or(X2,X3)),or(X2,or(X1,X3)))) = true,
file('/export/starexec/sandbox/tmp/tmp.ci0PL9Byfu/E---3.1_20206.p',axiom_1_5) ).
cnf(and_defn,axiom,
and(X1,X2) = not(or(not(X1),not(X2))),
file('/export/starexec/sandbox/tmp/tmp.ci0PL9Byfu/E---3.1_20206.p',and_defn) ).
cnf(prove_this,negated_conjecture,
theorem(implies(implies(q,r),implies(and(p,q),r))) != true,
file('/export/starexec/sandbox/tmp/tmp.ci0PL9Byfu/E---3.1_20206.p',prove_this) ).
cnf(c_0_11,axiom,
ifeq(axiom(X1),true,theorem(X1),true) = true,
rule_1 ).
cnf(c_0_12,axiom,
axiom(implies(or(X1,X1),X1)) = true,
axiom_1_2 ).
cnf(c_0_13,axiom,
ifeq(X1,X1,X2,X3) = X2,
ifeq_axiom ).
cnf(c_0_14,axiom,
axiom(implies(implies(X1,X2),implies(or(X3,X1),or(X3,X2)))) = true,
axiom_1_6 ).
cnf(c_0_15,axiom,
axiom(implies(X1,or(X2,X1))) = true,
axiom_1_3 ).
cnf(c_0_16,axiom,
ifeq(theorem(implies(X1,X2)),true,ifeq(theorem(X1),true,theorem(X2),true),true) = true,
rule_2 ).
cnf(c_0_17,plain,
theorem(implies(or(X1,X1),X1)) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12]),c_0_13]) ).
cnf(c_0_18,plain,
theorem(implies(implies(X1,X2),implies(or(X3,X1),or(X3,X2)))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_14]),c_0_13]) ).
cnf(c_0_19,axiom,
implies(X1,X2) = or(not(X1),X2),
implies_definition ).
cnf(c_0_20,plain,
theorem(implies(X1,or(X2,X1))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_15]),c_0_13]) ).
cnf(c_0_21,plain,
ifeq(theorem(implies(implies(or(X1,X1),X1),X2)),true,theorem(X2),true) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_13]) ).
cnf(c_0_22,plain,
theorem(implies(implies(X1,X2),implies(implies(X3,X1),implies(X3,X2)))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_19]) ).
cnf(c_0_23,plain,
ifeq(theorem(implies(implies(X1,or(X2,X1)),X3)),true,theorem(X3),true) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_20]),c_0_13]) ).
cnf(c_0_24,plain,
theorem(implies(implies(X1,or(X2,X2)),implies(X1,X2))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_13]) ).
cnf(c_0_25,axiom,
axiom(implies(or(X1,X2),or(X2,X1))) = true,
axiom_1_4 ).
cnf(c_0_26,plain,
theorem(implies(X1,X1)) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_13]) ).
cnf(c_0_27,plain,
theorem(implies(or(X1,X2),or(X2,X1))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_25]),c_0_13]) ).
cnf(c_0_28,plain,
ifeq(theorem(implies(implies(X1,X1),X2)),true,theorem(X2),true) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_26]),c_0_13]) ).
cnf(c_0_29,plain,
theorem(implies(implies(X1,X2),or(X2,not(X1)))) = true,
inference(spm,[status(thm)],[c_0_27,c_0_19]) ).
cnf(c_0_30,plain,
theorem(or(X1,not(X1))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_13]) ).
cnf(c_0_31,plain,
ifeq(theorem(implies(X1,X2)),true,theorem(implies(implies(X3,X1),implies(X3,X2))),true) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_22]),c_0_13]) ).
cnf(c_0_32,plain,
theorem(implies(X1,not(not(X1)))) = true,
inference(spm,[status(thm)],[c_0_30,c_0_19]) ).
cnf(c_0_33,axiom,
axiom(implies(or(X1,or(X2,X3)),or(X2,or(X1,X3)))) = true,
axiom_1_5 ).
cnf(c_0_34,plain,
theorem(implies(implies(X1,X2),implies(X1,not(not(X2))))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_13]) ).
cnf(c_0_35,plain,
theorem(implies(or(X1,or(X2,X3)),or(X2,or(X1,X3)))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_33]),c_0_13]) ).
cnf(c_0_36,plain,
ifeq(theorem(implies(X1,X2)),true,theorem(implies(or(X3,X1),or(X3,X2))),true) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_18]),c_0_13]) ).
cnf(c_0_37,plain,
theorem(implies(X1,not(not(or(X2,X1))))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_34]),c_0_13]) ).
cnf(c_0_38,plain,
theorem(implies(implies(X1,or(X2,X3)),or(X2,implies(X1,X3)))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_19]),c_0_19]) ).
cnf(c_0_39,plain,
ifeq(theorem(implies(or(X1,not(X1)),X2)),true,theorem(X2),true) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_30]),c_0_13]) ).
cnf(c_0_40,plain,
theorem(implies(or(X1,X2),or(X1,not(not(or(X3,X2)))))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_13]) ).
cnf(c_0_41,axiom,
and(X1,X2) = not(or(not(X1),not(X2))),
and_defn ).
cnf(c_0_42,plain,
theorem(implies(implies(X1,implies(X2,X3)),implies(X2,implies(X1,X3)))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_19]),c_0_19]) ).
cnf(c_0_43,plain,
theorem(or(X1,not(not(or(X2,not(X1)))))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_40]),c_0_13]) ).
cnf(c_0_44,plain,
not(implies(X1,not(X2))) = and(X1,X2),
inference(rw,[status(thm)],[c_0_41,c_0_19]) ).
cnf(c_0_45,plain,
theorem(implies(X1,implies(implies(X1,X2),X2))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_42]),c_0_13]) ).
cnf(c_0_46,plain,
ifeq(theorem(or(X1,X2)),true,theorem(or(X2,X1)),true) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_27]),c_0_13]) ).
cnf(c_0_47,plain,
theorem(or(X1,not(and(X2,X1)))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_19]),c_0_44]) ).
cnf(c_0_48,plain,
ifeq(theorem(X1),true,theorem(implies(implies(X1,X2),X2)),true) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_45]),c_0_13]) ).
cnf(c_0_49,plain,
theorem(implies(and(X1,X2),X2)) = true,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_47]),c_0_19]),c_0_13]) ).
cnf(c_0_50,plain,
theorem(implies(implies(implies(and(X1,X2),X2),X3),X3)) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_49]),c_0_13]) ).
cnf(c_0_51,negated_conjecture,
theorem(implies(implies(q,r),implies(and(p,q),r))) != true,
inference(fof_simplification,[status(thm)],[prove_this]) ).
cnf(c_0_52,plain,
ifeq(theorem(implies(implies(implies(X1,X2),implies(implies(X3,X1),implies(X3,X2))),X4)),true,theorem(X4),true) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_22]),c_0_13]) ).
cnf(c_0_53,plain,
theorem(implies(implies(X1,implies(implies(and(X2,X3),X3),X4)),implies(X1,X4))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_50]),c_0_13]) ).
cnf(c_0_54,negated_conjecture,
theorem(implies(implies(q,r),implies(and(p,q),r))) != true,
c_0_51 ).
cnf(c_0_55,plain,
theorem(implies(implies(X1,X2),implies(and(X3,X1),X2))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_53]),c_0_13]) ).
cnf(c_0_56,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_54,c_0_55])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.10 % Problem : LCL250-10 : TPTP v8.2.0. Released v7.3.0.
% 0.05/0.10 % Command : run_E %s %d THM
% 0.10/0.30 % Computer : n032.cluster.edu
% 0.10/0.30 % Model : x86_64 x86_64
% 0.10/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.30 % Memory : 8042.1875MB
% 0.10/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.30 % CPULimit : 300
% 0.10/0.30 % WCLimit : 300
% 0.10/0.30 % DateTime : Sat Jun 22 13:06:08 EDT 2024
% 0.10/0.30 % CPUTime :
% 0.16/0.43 Running first-order theorem proving
% 0.16/0.43 Running: /export/starexec/sandbox/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/sandbox/tmp/tmp.ci0PL9Byfu/E---3.1_20206.p
% 324.37/36.80 # Version: 3.2.0
% 324.37/36.80 # Preprocessing class: FSSSSMSSSSSNFFN.
% 324.37/36.80 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 324.37/36.80 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 324.37/36.80 # Starting new_bool_3 with 300s (1) cores
% 324.37/36.80 # Starting new_bool_1 with 300s (1) cores
% 324.37/36.80 # Starting sh5l with 300s (1) cores
% 324.37/36.80 # new_bool_3 with pid 20286 completed with status 0
% 324.37/36.80 # Result found by new_bool_3
% 324.37/36.80 # Preprocessing class: FSSSSMSSSSSNFFN.
% 324.37/36.80 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 324.37/36.80 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 324.37/36.80 # Starting new_bool_3 with 300s (1) cores
% 324.37/36.80 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 324.37/36.80 # Search class: FUUPM-FFSF31-MFFFFFNN
% 324.37/36.80 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 324.37/36.80 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 100s (1) cores
% 324.37/36.80 # G-E--_302_C18_F1_URBAN_RG_S04BN with pid 20289 completed with status 0
% 324.37/36.80 # Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 324.37/36.80 # Preprocessing class: FSSSSMSSSSSNFFN.
% 324.37/36.80 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 324.37/36.80 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 324.37/36.80 # Starting new_bool_3 with 300s (1) cores
% 324.37/36.80 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 324.37/36.80 # Search class: FUUPM-FFSF31-MFFFFFNN
% 324.37/36.80 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 324.37/36.80 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 100s (1) cores
% 324.37/36.80 # Preprocessing time : 0.002 s
% 324.37/36.80
% 324.37/36.80 # Proof found!
% 324.37/36.80 # SZS status Unsatisfiable
% 324.37/36.80 # SZS output start CNFRefutation
% See solution above
% 324.37/36.80 # Parsed axioms : 11
% 324.37/36.80 # Removed by relevancy pruning/SinE : 0
% 324.37/36.80 # Initial clauses : 11
% 324.37/36.80 # Removed in clause preprocessing : 0
% 324.37/36.80 # Initial clauses in saturation : 11
% 324.37/36.80 # Processed clauses : 11278
% 324.37/36.80 # ...of these trivial : 4468
% 324.37/36.80 # ...subsumed : 0
% 324.37/36.80 # ...remaining for further processing : 6810
% 324.37/36.80 # Other redundant clauses eliminated : 0
% 324.37/36.80 # Clauses deleted for lack of memory : 0
% 324.37/36.80 # Backward-subsumed : 0
% 324.37/36.80 # Backward-rewritten : 91
% 324.37/36.80 # Generated clauses : 2080099
% 324.37/36.80 # ...of the previous two non-redundant : 399375
% 324.37/36.80 # ...aggressively subsumed : 0
% 324.37/36.80 # Contextual simplify-reflections : 0
% 324.37/36.80 # Paramodulations : 2080099
% 324.37/36.80 # Factorizations : 0
% 324.37/36.80 # NegExts : 0
% 324.37/36.80 # Equation resolutions : 0
% 324.37/36.80 # Disequality decompositions : 0
% 324.37/36.80 # Total rewrite steps : 2504356
% 324.37/36.80 # ...of those cached : 960979
% 324.37/36.80 # Propositional unsat checks : 0
% 324.37/36.80 # Propositional check models : 0
% 324.37/36.80 # Propositional check unsatisfiable : 0
% 324.37/36.80 # Propositional clauses : 0
% 324.37/36.80 # Propositional clauses after purity: 0
% 324.37/36.80 # Propositional unsat core size : 0
% 324.37/36.80 # Propositional preprocessing time : 0.000
% 324.37/36.80 # Propositional encoding time : 0.000
% 324.37/36.80 # Propositional solver time : 0.000
% 324.37/36.80 # Success case prop preproc time : 0.000
% 324.37/36.80 # Success case prop encoding time : 0.000
% 324.37/36.80 # Success case prop solver time : 0.000
% 324.37/36.80 # Current number of processed clauses : 6719
% 324.37/36.80 # Positive orientable unit clauses : 6719
% 324.37/36.80 # Positive unorientable unit clauses: 0
% 324.37/36.80 # Negative unit clauses : 0
% 324.37/36.80 # Non-unit-clauses : 0
% 324.37/36.80 # Current number of unprocessed clauses: 387716
% 324.37/36.80 # ...number of literals in the above : 387716
% 324.37/36.80 # Current number of archived formulas : 0
% 324.37/36.80 # Current number of archived clauses : 91
% 324.37/36.80 # Clause-clause subsumption calls (NU) : 0
% 324.37/36.80 # Rec. Clause-clause subsumption calls : 0
% 324.37/36.80 # Non-unit clause-clause subsumptions : 0
% 324.37/36.80 # Unit Clause-clause subsumption calls : 0
% 324.37/36.80 # Rewrite failures with RHS unbound : 0
% 324.37/36.80 # BW rewrite match attempts : 2205412
% 324.37/36.80 # BW rewrite match successes : 89
% 324.37/36.80 # Condensation attempts : 0
% 324.37/36.80 # Condensation successes : 0
% 324.37/36.80 # Termbank termtop insertions : 61465231
% 324.37/36.80 # Search garbage collected termcells : 2
% 324.37/36.80
% 324.37/36.80 # -------------------------------------------------
% 324.37/36.80 # User time : 35.202 s
% 324.37/36.80 # System time : 0.954 s
% 324.37/36.80 # Total time : 36.156 s
% 324.37/36.80 # Maximum resident set size: 1656 pages
% 324.37/36.80
% 324.37/36.80 # -------------------------------------------------
% 324.37/36.80 # User time : 35.202 s
% 324.37/36.80 # System time : 0.957 s
% 324.37/36.80 # Total time : 36.159 s
% 324.37/36.80 # Maximum resident set size: 1692 pages
% 324.37/36.80 % E---3.1 exiting
% 324.37/36.80 % E exiting
%------------------------------------------------------------------------------