TSTP Solution File: LCL330-3 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : LCL330-3 : TPTP v8.1.2. 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 : 2400s
% WCLimit : 300s
% DateTime : Tue Oct 10 18:24:35 EDT 2023
% Result : Unsatisfiable 86.28s 11.96s
% Output : CNFRefutation 86.28s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 11
% Syntax : Number of clauses : 65 ( 33 unt; 0 nHn; 29 RR)
% Number of literals : 110 ( 7 equ; 51 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 10 ( 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 : 134 ( 10 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(rule_2,axiom,
( theorem(X1)
| ~ theorem(implies(X2,X1))
| ~ theorem(X2) ),
file('/export/starexec/sandbox2/tmp/tmp.WuuvL6CKXh/E---3.1_28065.p',rule_2) ).
cnf(implies_definition,axiom,
implies(X1,X2) = or(not(X1),X2),
file('/export/starexec/sandbox2/tmp/tmp.WuuvL6CKXh/E---3.1_28065.p',implies_definition) ).
cnf(rule_1,axiom,
( theorem(X1)
| ~ axiom(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.WuuvL6CKXh/E---3.1_28065.p',rule_1) ).
cnf(axiom_1_5,axiom,
axiom(implies(or(X1,or(X2,X3)),or(X2,or(X1,X3)))),
file('/export/starexec/sandbox2/tmp/tmp.WuuvL6CKXh/E---3.1_28065.p',axiom_1_5) ).
cnf(axiom_1_6,axiom,
axiom(implies(implies(X1,X2),implies(or(X3,X1),or(X3,X2)))),
file('/export/starexec/sandbox2/tmp/tmp.WuuvL6CKXh/E---3.1_28065.p',axiom_1_6) ).
cnf(axiom_1_2,axiom,
axiom(implies(or(X1,X1),X1)),
file('/export/starexec/sandbox2/tmp/tmp.WuuvL6CKXh/E---3.1_28065.p',axiom_1_2) ).
cnf(axiom_1_4,axiom,
axiom(implies(or(X1,X2),or(X2,X1))),
file('/export/starexec/sandbox2/tmp/tmp.WuuvL6CKXh/E---3.1_28065.p',axiom_1_4) ).
cnf(axiom_1_3,axiom,
axiom(implies(X1,or(X2,X1))),
file('/export/starexec/sandbox2/tmp/tmp.WuuvL6CKXh/E---3.1_28065.p',axiom_1_3) ).
cnf(equivalent_defn,axiom,
equivalent(X1,X2) = and(implies(X1,X2),implies(X2,X1)),
file('/export/starexec/sandbox2/tmp/tmp.WuuvL6CKXh/E---3.1_28065.p',equivalent_defn) ).
cnf(and_defn,axiom,
and(X1,X2) = not(or(not(X1),not(X2))),
file('/export/starexec/sandbox2/tmp/tmp.WuuvL6CKXh/E---3.1_28065.p',and_defn) ).
cnf(prove_this,negated_conjecture,
~ theorem(equivalent(or(p,q),implies(implies(p,q),q))),
file('/export/starexec/sandbox2/tmp/tmp.WuuvL6CKXh/E---3.1_28065.p',prove_this) ).
cnf(c_0_11,axiom,
( theorem(X1)
| ~ theorem(implies(X2,X1))
| ~ theorem(X2) ),
rule_2 ).
cnf(c_0_12,axiom,
implies(X1,X2) = or(not(X1),X2),
implies_definition ).
cnf(c_0_13,plain,
( theorem(X1)
| ~ theorem(X2)
| ~ theorem(or(not(X2),X1)) ),
inference(rw,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_14,axiom,
( theorem(X1)
| ~ axiom(X1) ),
rule_1 ).
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(implies(X1,X2),implies(or(X3,X1),or(X3,X2)))),
axiom_1_6 ).
cnf(c_0_17,axiom,
axiom(implies(or(X1,X1),X1)),
axiom_1_2 ).
cnf(c_0_18,plain,
( theorem(X1)
| ~ theorem(X2)
| ~ axiom(or(not(X2),X1)) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_19,plain,
axiom(or(not(or(X1,or(X2,X3))),or(X2,or(X1,X3)))),
inference(rw,[status(thm)],[c_0_15,c_0_12]) ).
cnf(c_0_20,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_21,plain,
axiom(or(not(or(X1,X1)),X1)),
inference(rw,[status(thm)],[c_0_17,c_0_12]) ).
cnf(c_0_22,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_23,plain,
( theorem(or(not(or(X1,X2)),or(X1,X3)))
| ~ theorem(or(not(X2),X3)) ),
inference(spm,[status(thm)],[c_0_18,c_0_20]) ).
cnf(c_0_24,axiom,
axiom(implies(or(X1,X2),or(X2,X1))),
axiom_1_4 ).
cnf(c_0_25,plain,
( theorem(X1)
| ~ theorem(or(X1,X1)) ),
inference(spm,[status(thm)],[c_0_18,c_0_21]) ).
cnf(c_0_26,plain,
( theorem(or(X1,or(X2,X3)))
| ~ axiom(or(X2,or(X1,X3))) ),
inference(spm,[status(thm)],[c_0_22,c_0_14]) ).
cnf(c_0_27,axiom,
axiom(implies(X1,or(X2,X1))),
axiom_1_3 ).
cnf(c_0_28,plain,
( theorem(or(X1,X2))
| ~ theorem(or(not(X3),X2))
| ~ theorem(or(X1,X3)) ),
inference(spm,[status(thm)],[c_0_13,c_0_23]) ).
cnf(c_0_29,plain,
axiom(or(not(or(X1,X2)),or(X2,X1))),
inference(rw,[status(thm)],[c_0_24,c_0_12]) ).
cnf(c_0_30,plain,
( theorem(or(X1,X2))
| ~ axiom(or(X1,or(or(X1,X2),X2))) ),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_31,plain,
axiom(or(not(X1),or(X2,X1))),
inference(rw,[status(thm)],[c_0_27,c_0_12]) ).
cnf(c_0_32,plain,
( theorem(or(X1,X2))
| ~ theorem(X3)
| ~ axiom(or(X1,or(not(X3),X2))) ),
inference(spm,[status(thm)],[c_0_13,c_0_26]) ).
cnf(c_0_33,plain,
( theorem(or(X1,or(X2,X3)))
| ~ theorem(or(X1,X4))
| ~ axiom(or(X2,or(not(X4),X3))) ),
inference(spm,[status(thm)],[c_0_28,c_0_26]) ).
cnf(c_0_34,plain,
( theorem(or(X1,X2))
| ~ theorem(or(X2,X1)) ),
inference(spm,[status(thm)],[c_0_18,c_0_29]) ).
cnf(c_0_35,plain,
theorem(or(not(X1),X1)),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_36,axiom,
equivalent(X1,X2) = and(implies(X1,X2),implies(X2,X1)),
equivalent_defn ).
cnf(c_0_37,axiom,
and(X1,X2) = not(or(not(X1),not(X2))),
and_defn ).
cnf(c_0_38,plain,
( theorem(or(not(or(X1,not(X2))),X1))
| ~ theorem(X2) ),
inference(spm,[status(thm)],[c_0_32,c_0_29]) ).
cnf(c_0_39,plain,
( theorem(or(X1,or(not(X2),X2)))
| ~ theorem(or(X1,X3)) ),
inference(spm,[status(thm)],[c_0_33,c_0_31]) ).
cnf(c_0_40,plain,
theorem(or(X1,not(X1))),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_41,negated_conjecture,
~ theorem(equivalent(or(p,q),implies(implies(p,q),q))),
prove_this ).
cnf(c_0_42,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_36,c_0_12]),c_0_12]),c_0_37]) ).
cnf(c_0_43,plain,
( theorem(X1)
| ~ theorem(or(X1,not(X2)))
| ~ theorem(X2) ),
inference(spm,[status(thm)],[c_0_13,c_0_38]) ).
cnf(c_0_44,plain,
( theorem(or(X1,X2))
| ~ theorem(or(X1,X3))
| ~ axiom(or(not(X3),X2)) ),
inference(spm,[status(thm)],[c_0_28,c_0_14]) ).
cnf(c_0_45,plain,
theorem(or(X1,or(not(X2),X2))),
inference(spm,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_46,plain,
( theorem(or(X1,X2))
| ~ theorem(X2) ),
inference(spm,[status(thm)],[c_0_18,c_0_31]) ).
cnf(c_0_47,negated_conjecture,
~ theorem(not(or(not(or(not(or(p,q)),or(not(or(not(p),q)),q))),not(or(not(or(not(or(not(p),q)),q)),or(p,q)))))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_41,c_0_12]),c_0_12]),c_0_42]) ).
cnf(c_0_48,plain,
( theorem(not(or(not(X1),not(X2))))
| ~ theorem(X1)
| ~ theorem(X2) ),
inference(spm,[status(thm)],[c_0_43,c_0_38]) ).
cnf(c_0_49,plain,
( theorem(or(X1,or(X2,X3)))
| ~ theorem(or(X1,or(X3,X2))) ),
inference(spm,[status(thm)],[c_0_44,c_0_29]) ).
cnf(c_0_50,plain,
theorem(or(not(X1),or(X2,X1))),
inference(spm,[status(thm)],[c_0_22,c_0_45]) ).
cnf(c_0_51,plain,
( theorem(or(X1,or(X2,X3)))
| ~ theorem(or(X1,X3)) ),
inference(spm,[status(thm)],[c_0_22,c_0_46]) ).
cnf(c_0_52,plain,
( theorem(or(X1,or(not(or(X1,X2)),X3)))
| ~ theorem(or(not(X2),X3)) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_53,negated_conjecture,
( ~ theorem(or(not(or(p,q)),or(not(or(not(p),q)),q)))
| ~ theorem(or(not(or(not(or(not(p),q)),q)),or(p,q))) ),
inference(spm,[status(thm)],[c_0_47,c_0_48]) ).
cnf(c_0_54,plain,
( theorem(or(not(or(not(X1),X2)),or(X3,X2)))
| ~ theorem(or(X3,X1)) ),
inference(spm,[status(thm)],[c_0_32,c_0_20]) ).
cnf(c_0_55,plain,
theorem(or(not(X1),or(X1,X2))),
inference(spm,[status(thm)],[c_0_49,c_0_50]) ).
cnf(c_0_56,plain,
( theorem(or(X1,X2))
| ~ theorem(or(or(X1,X2),X2)) ),
inference(spm,[status(thm)],[c_0_25,c_0_51]) ).
cnf(c_0_57,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_28,c_0_52]) ).
cnf(c_0_58,negated_conjecture,
( ~ theorem(or(not(or(p,q)),or(not(or(not(p),q)),q)))
| ~ theorem(or(p,or(not(p),q))) ),
inference(spm,[status(thm)],[c_0_53,c_0_54]) ).
cnf(c_0_59,plain,
theorem(or(X1,or(not(X1),X2))),
inference(spm,[status(thm)],[c_0_22,c_0_55]) ).
cnf(c_0_60,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_56,c_0_57]) ).
cnf(c_0_61,plain,
( theorem(or(or(not(or(X1,X2)),X3),X1))
| ~ theorem(or(not(X2),X3)) ),
inference(spm,[status(thm)],[c_0_34,c_0_52]) ).
cnf(c_0_62,negated_conjecture,
~ theorem(or(not(or(p,q)),or(not(or(not(p),q)),q))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_58,c_0_59])]) ).
cnf(c_0_63,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_60,c_0_61]) ).
cnf(c_0_64,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_62,c_0_63]),c_0_50]),c_0_35])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.14 % Problem : LCL330-3 : TPTP v8.1.2. Released v2.3.0.
% 0.07/0.15 % Command : run_E %s %d THM
% 0.16/0.37 % Computer : n011.cluster.edu
% 0.16/0.37 % Model : x86_64 x86_64
% 0.16/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.37 % Memory : 8042.1875MB
% 0.16/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.37 % CPULimit : 2400
% 0.16/0.37 % WCLimit : 300
% 0.16/0.37 % DateTime : Mon Oct 2 11:46:08 EDT 2023
% 0.16/0.37 % CPUTime :
% 0.23/0.52 Running first-order model finding
% 0.23/0.52 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/tmp/tmp.WuuvL6CKXh/E---3.1_28065.p
% 86.28/11.96 # Version: 3.1pre001
% 86.28/11.96 # Preprocessing class: FSSSSMSSSSSNFFN.
% 86.28/11.96 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 86.28/11.96 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 86.28/11.96 # Starting new_bool_3 with 300s (1) cores
% 86.28/11.96 # Starting new_bool_1 with 300s (1) cores
% 86.28/11.96 # Starting sh5l with 300s (1) cores
% 86.28/11.96 # G-E--_302_C18_F1_URBAN_RG_S04BN with pid 28142 completed with status 0
% 86.28/11.96 # Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 86.28/11.96 # Preprocessing class: FSSSSMSSSSSNFFN.
% 86.28/11.96 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 86.28/11.96 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 86.28/11.96 # No SInE strategy applied
% 86.28/11.96 # Search class: FHUNM-FFSF21-DFFFFFNN
% 86.28/11.96 # Scheduled 5 strats onto 5 cores with 1500 seconds (1500 total)
% 86.28/11.96 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 395s (1) cores
% 86.28/11.96 # Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN with 334s (1) cores
% 86.28/11.96 # Starting new_bool_3 with 329s (1) cores
% 86.28/11.96 # Starting new_bool_1 with 324s (1) cores
% 86.28/11.96 # Starting G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 118s (1) cores
% 86.28/11.96 # G-E--_302_C18_F1_URBAN_RG_S04BN with pid 28147 completed with status 0
% 86.28/11.96 # Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 86.28/11.96 # Preprocessing class: FSSSSMSSSSSNFFN.
% 86.28/11.96 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 86.28/11.96 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 86.28/11.96 # No SInE strategy applied
% 86.28/11.96 # Search class: FHUNM-FFSF21-DFFFFFNN
% 86.28/11.96 # Scheduled 5 strats onto 5 cores with 1500 seconds (1500 total)
% 86.28/11.96 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 395s (1) cores
% 86.28/11.96 # Preprocessing time : 0.032 s
% 86.28/11.96
% 86.28/11.96 # Proof found!
% 86.28/11.96 # SZS status Unsatisfiable
% 86.28/11.96 # SZS output start CNFRefutation
% See solution above
% 86.28/11.96 # Parsed axioms : 11
% 86.28/11.96 # Removed by relevancy pruning/SinE : 0
% 86.28/11.96 # Initial clauses : 11
% 86.28/11.96 # Removed in clause preprocessing : 3
% 86.28/11.96 # Initial clauses in saturation : 8
% 86.28/11.96 # Processed clauses : 12983
% 86.28/11.96 # ...of these trivial : 17
% 86.28/11.96 # ...subsumed : 9458
% 86.28/11.96 # ...remaining for further processing : 3508
% 86.28/11.96 # Other redundant clauses eliminated : 0
% 86.28/11.96 # Clauses deleted for lack of memory : 0
% 86.28/11.96 # Backward-subsumed : 486
% 86.28/11.96 # Backward-rewritten : 25
% 86.28/11.96 # Generated clauses : 494051
% 86.28/11.96 # ...of the previous two non-redundant : 492210
% 86.28/11.96 # ...aggressively subsumed : 0
% 86.28/11.96 # Contextual simplify-reflections : 3
% 86.28/11.96 # Paramodulations : 494051
% 86.28/11.96 # Factorizations : 0
% 86.28/11.96 # NegExts : 0
% 86.28/11.96 # Equation resolutions : 0
% 86.28/11.96 # Total rewrite steps : 1588
% 86.28/11.96 # Propositional unsat checks : 0
% 86.28/11.96 # Propositional check models : 0
% 86.28/11.96 # Propositional check unsatisfiable : 0
% 86.28/11.96 # Propositional clauses : 0
% 86.28/11.96 # Propositional clauses after purity: 0
% 86.28/11.96 # Propositional unsat core size : 0
% 86.28/11.96 # Propositional preprocessing time : 0.000
% 86.28/11.96 # Propositional encoding time : 0.000
% 86.28/11.96 # Propositional solver time : 0.000
% 86.28/11.96 # Success case prop preproc time : 0.000
% 86.28/11.96 # Success case prop encoding time : 0.000
% 86.28/11.96 # Success case prop solver time : 0.000
% 86.28/11.96 # Current number of processed clauses : 2997
% 86.28/11.96 # Positive orientable unit clauses : 41
% 86.28/11.96 # Positive unorientable unit clauses: 0
% 86.28/11.96 # Negative unit clauses : 60
% 86.28/11.96 # Non-unit-clauses : 2896
% 86.28/11.96 # Current number of unprocessed clauses: 478288
% 86.28/11.96 # ...number of literals in the above : 1962952
% 86.28/11.96 # Current number of archived formulas : 0
% 86.28/11.96 # Current number of archived clauses : 514
% 86.28/11.96 # Clause-clause subsumption calls (NU) : 1878339
% 86.28/11.96 # Rec. Clause-clause subsumption calls : 1222797
% 86.28/11.96 # Non-unit clause-clause subsumptions : 9092
% 86.28/11.96 # Unit Clause-clause subsumption calls : 10240
% 86.28/11.96 # Rewrite failures with RHS unbound : 0
% 86.28/11.96 # BW rewrite match attempts : 3703
% 86.28/11.96 # BW rewrite match successes : 4
% 86.28/11.96 # Condensation attempts : 0
% 86.28/11.96 # Condensation successes : 0
% 86.28/11.96 # Termbank termtop insertions : 11703184
% 86.28/11.96
% 86.28/11.96 # -------------------------------------------------
% 86.28/11.96 # User time : 10.390 s
% 86.28/11.96 # System time : 0.323 s
% 86.28/11.96 # Total time : 10.713 s
% 86.28/11.96 # Maximum resident set size: 1656 pages
% 86.28/11.96
% 86.28/11.96 # -------------------------------------------------
% 86.28/11.96 # User time : 52.145 s
% 86.28/11.96 # System time : 1.033 s
% 86.28/11.96 # Total time : 53.178 s
% 86.28/11.96 # Maximum resident set size: 1680 pages
% 86.28/11.96 % E---3.1 exiting
%------------------------------------------------------------------------------