TSTP Solution File: LCL341-3 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : LCL341-3 : TPTP v8.1.2. Released v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n022.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:37 EDT 2023
% Result : Unsatisfiable 56.40s 7.62s
% Output : CNFRefutation 56.40s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 11
% Syntax : Number of clauses : 57 ( 32 unt; 0 nHn; 25 RR)
% Number of literals : 91 ( 7 equ; 38 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 9 ( 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 : 113 ( 8 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(rule_2,axiom,
( theorem(X1)
| ~ theorem(implies(X2,X1))
| ~ theorem(X2) ),
file('/export/starexec/sandbox/tmp/tmp.xey0xa74bZ/E---3.1_18072.p',rule_2) ).
cnf(implies_definition,axiom,
implies(X1,X2) = or(not(X1),X2),
file('/export/starexec/sandbox/tmp/tmp.xey0xa74bZ/E---3.1_18072.p',implies_definition) ).
cnf(rule_1,axiom,
( theorem(X1)
| ~ axiom(X1) ),
file('/export/starexec/sandbox/tmp/tmp.xey0xa74bZ/E---3.1_18072.p',rule_1) ).
cnf(axiom_1_6,axiom,
axiom(implies(implies(X1,X2),implies(or(X3,X1),or(X3,X2)))),
file('/export/starexec/sandbox/tmp/tmp.xey0xa74bZ/E---3.1_18072.p',axiom_1_6) ).
cnf(axiom_1_5,axiom,
axiom(implies(or(X1,or(X2,X3)),or(X2,or(X1,X3)))),
file('/export/starexec/sandbox/tmp/tmp.xey0xa74bZ/E---3.1_18072.p',axiom_1_5) ).
cnf(axiom_1_3,axiom,
axiom(implies(X1,or(X2,X1))),
file('/export/starexec/sandbox/tmp/tmp.xey0xa74bZ/E---3.1_18072.p',axiom_1_3) ).
cnf(axiom_1_2,axiom,
axiom(implies(or(X1,X1),X1)),
file('/export/starexec/sandbox/tmp/tmp.xey0xa74bZ/E---3.1_18072.p',axiom_1_2) ).
cnf(axiom_1_4,axiom,
axiom(implies(or(X1,X2),or(X2,X1))),
file('/export/starexec/sandbox/tmp/tmp.xey0xa74bZ/E---3.1_18072.p',axiom_1_4) ).
cnf(equivalent_defn,axiom,
equivalent(X1,X2) = and(implies(X1,X2),implies(X2,X1)),
file('/export/starexec/sandbox/tmp/tmp.xey0xa74bZ/E---3.1_18072.p',equivalent_defn) ).
cnf(and_defn,axiom,
and(X1,X2) = not(or(not(X1),not(X2))),
file('/export/starexec/sandbox/tmp/tmp.xey0xa74bZ/E---3.1_18072.p',and_defn) ).
cnf(prove_this,negated_conjecture,
~ theorem(implies(p,equivalent(implies(p,q),q))),
file('/export/starexec/sandbox/tmp/tmp.xey0xa74bZ/E---3.1_18072.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(implies(X1,X2),implies(or(X3,X1),or(X3,X2)))),
axiom_1_6 ).
cnf(c_0_16,plain,
( theorem(X1)
| ~ theorem(X2)
| ~ axiom(or(not(X2),X1)) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_17,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_15,c_0_12]),c_0_12]),c_0_12]) ).
cnf(c_0_18,axiom,
axiom(implies(or(X1,or(X2,X3)),or(X2,or(X1,X3)))),
axiom_1_5 ).
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_16,c_0_17]) ).
cnf(c_0_20,axiom,
axiom(implies(X1,or(X2,X1))),
axiom_1_3 ).
cnf(c_0_21,plain,
axiom(or(not(or(X1,or(X2,X3))),or(X2,or(X1,X3)))),
inference(rw,[status(thm)],[c_0_18,c_0_12]) ).
cnf(c_0_22,plain,
( theorem(or(X1,X2))
| ~ theorem(or(not(X3),X2))
| ~ theorem(or(X1,X3)) ),
inference(spm,[status(thm)],[c_0_13,c_0_19]) ).
cnf(c_0_23,axiom,
axiom(implies(or(X1,X1),X1)),
axiom_1_2 ).
cnf(c_0_24,plain,
axiom(or(not(X1),or(X2,X1))),
inference(rw,[status(thm)],[c_0_20,c_0_12]) ).
cnf(c_0_25,plain,
( theorem(or(X1,or(X2,X3)))
| ~ theorem(or(X2,or(X1,X3))) ),
inference(spm,[status(thm)],[c_0_16,c_0_21]) ).
cnf(c_0_26,axiom,
axiom(implies(or(X1,X2),or(X2,X1))),
axiom_1_4 ).
cnf(c_0_27,plain,
( theorem(or(X1,X2))
| ~ theorem(or(X1,X3))
| ~ axiom(or(not(X3),X2)) ),
inference(spm,[status(thm)],[c_0_22,c_0_14]) ).
cnf(c_0_28,plain,
axiom(or(not(or(X1,X1)),X1)),
inference(rw,[status(thm)],[c_0_23,c_0_12]) ).
cnf(c_0_29,plain,
( theorem(or(X1,X2))
| ~ theorem(X2) ),
inference(spm,[status(thm)],[c_0_16,c_0_24]) ).
cnf(c_0_30,plain,
( theorem(or(X1,or(not(or(X1,X2)),X3)))
| ~ theorem(or(not(X2),X3)) ),
inference(spm,[status(thm)],[c_0_25,c_0_19]) ).
cnf(c_0_31,plain,
axiom(or(not(or(X1,X2)),or(X2,X1))),
inference(rw,[status(thm)],[c_0_26,c_0_12]) ).
cnf(c_0_32,plain,
( theorem(or(X1,X2))
| ~ theorem(or(X1,or(X2,X2))) ),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_33,plain,
( theorem(X1)
| ~ theorem(or(X1,X1)) ),
inference(spm,[status(thm)],[c_0_16,c_0_28]) ).
cnf(c_0_34,plain,
( theorem(or(X1,or(X2,X3)))
| ~ theorem(or(X1,X3)) ),
inference(spm,[status(thm)],[c_0_25,c_0_29]) ).
cnf(c_0_35,axiom,
equivalent(X1,X2) = and(implies(X1,X2),implies(X2,X1)),
equivalent_defn ).
cnf(c_0_36,axiom,
and(X1,X2) = not(or(not(X1),not(X2))),
and_defn ).
cnf(c_0_37,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_22,c_0_30]) ).
cnf(c_0_38,plain,
( theorem(or(X1,X2))
| ~ theorem(or(X2,X1)) ),
inference(spm,[status(thm)],[c_0_16,c_0_31]) ).
cnf(c_0_39,plain,
( theorem(or(X1,X2))
| ~ axiom(or(X1,or(X2,X2))) ),
inference(spm,[status(thm)],[c_0_32,c_0_14]) ).
cnf(c_0_40,plain,
( theorem(or(X1,X2))
| ~ theorem(or(or(X1,X2),X2)) ),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_41,plain,
( theorem(or(X1,or(X2,X3)))
| ~ axiom(or(X2,or(X1,X3))) ),
inference(spm,[status(thm)],[c_0_25,c_0_14]) ).
cnf(c_0_42,negated_conjecture,
~ theorem(implies(p,equivalent(implies(p,q),q))),
prove_this ).
cnf(c_0_43,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_35,c_0_12]),c_0_12]),c_0_36]) ).
cnf(c_0_44,plain,
( theorem(or(X1,not(or(not(X2),X3))))
| ~ theorem(or(not(X3),not(or(not(X2),X3))))
| ~ theorem(or(X1,X2)) ),
inference(spm,[status(thm)],[c_0_32,c_0_37]) ).
cnf(c_0_45,plain,
( theorem(or(X1,X2))
| ~ theorem(X1) ),
inference(spm,[status(thm)],[c_0_38,c_0_29]) ).
cnf(c_0_46,plain,
theorem(or(not(X1),X1)),
inference(spm,[status(thm)],[c_0_39,c_0_24]) ).
cnf(c_0_47,plain,
( theorem(or(X1,or(X2,X3)))
| ~ axiom(or(X2,or(or(X1,or(X2,X3)),X3))) ),
inference(spm,[status(thm)],[c_0_40,c_0_41]) ).
cnf(c_0_48,negated_conjecture,
~ theorem(or(not(p),not(or(not(or(not(or(not(p),q)),q)),not(or(not(q),or(not(p),q))))))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_42,c_0_12]),c_0_12]),c_0_43]) ).
cnf(c_0_49,plain,
( theorem(or(X1,not(or(not(X2),X3))))
| ~ theorem(or(X1,X2))
| ~ theorem(not(X3)) ),
inference(spm,[status(thm)],[c_0_44,c_0_45]) ).
cnf(c_0_50,plain,
theorem(or(X1,or(not(or(X1,X2)),X2))),
inference(spm,[status(thm)],[c_0_25,c_0_46]) ).
cnf(c_0_51,plain,
theorem(or(X1,not(X1))),
inference(spm,[status(thm)],[c_0_38,c_0_46]) ).
cnf(c_0_52,plain,
theorem(or(X1,or(not(X2),X2))),
inference(spm,[status(thm)],[c_0_47,c_0_24]) ).
cnf(c_0_53,negated_conjecture,
~ theorem(not(not(or(not(q),or(not(p),q))))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_49]),c_0_50])]) ).
cnf(c_0_54,plain,
( theorem(not(not(X1)))
| ~ theorem(X1) ),
inference(spm,[status(thm)],[c_0_13,c_0_51]) ).
cnf(c_0_55,plain,
theorem(or(not(X1),or(X2,X1))),
inference(spm,[status(thm)],[c_0_25,c_0_52]) ).
cnf(c_0_56,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_54]),c_0_55])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.14 % Problem : LCL341-3 : TPTP v8.1.2. Released v2.3.0.
% 0.08/0.15 % Command : run_E %s %d THM
% 0.15/0.37 % Computer : n022.cluster.edu
% 0.15/0.37 % Model : x86_64 x86_64
% 0.15/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.37 % Memory : 8042.1875MB
% 0.15/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.37 % CPULimit : 2400
% 0.15/0.37 % WCLimit : 300
% 0.15/0.37 % DateTime : Mon Oct 2 12:33:09 EDT 2023
% 0.15/0.37 % CPUTime :
% 0.22/0.46 Running first-order model finding
% 0.22/0.46 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/tmp/tmp.xey0xa74bZ/E---3.1_18072.p
% 56.40/7.62 # Version: 3.1pre001
% 56.40/7.62 # Preprocessing class: FSSSSMSSSSSNFFN.
% 56.40/7.62 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 56.40/7.62 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 56.40/7.62 # Starting new_bool_3 with 300s (1) cores
% 56.40/7.62 # Starting new_bool_1 with 300s (1) cores
% 56.40/7.62 # Starting sh5l with 300s (1) cores
% 56.40/7.62 # G-E--_302_C18_F1_URBAN_RG_S04BN with pid 18189 completed with status 0
% 56.40/7.62 # Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 56.40/7.62 # Preprocessing class: FSSSSMSSSSSNFFN.
% 56.40/7.62 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 56.40/7.62 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 56.40/7.62 # No SInE strategy applied
% 56.40/7.62 # Search class: FHUNM-FFSF21-DFFFFFNN
% 56.40/7.62 # Scheduled 5 strats onto 5 cores with 1500 seconds (1500 total)
% 56.40/7.62 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 395s (1) cores
% 56.40/7.62 # Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN with 334s (1) cores
% 56.40/7.62 # Starting new_bool_3 with 329s (1) cores
% 56.40/7.62 # Starting new_bool_1 with 324s (1) cores
% 56.40/7.62 # Starting G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 118s (1) cores
% 56.40/7.62 # G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN with pid 18194 completed with status 0
% 56.40/7.62 # Result found by G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN
% 56.40/7.62 # Preprocessing class: FSSSSMSSSSSNFFN.
% 56.40/7.62 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 56.40/7.62 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 56.40/7.62 # No SInE strategy applied
% 56.40/7.62 # Search class: FHUNM-FFSF21-DFFFFFNN
% 56.40/7.62 # Scheduled 5 strats onto 5 cores with 1500 seconds (1500 total)
% 56.40/7.62 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 395s (1) cores
% 56.40/7.62 # Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN with 334s (1) cores
% 56.40/7.62 # Preprocessing time : 0.026 s
% 56.40/7.62
% 56.40/7.62 # Proof found!
% 56.40/7.62 # SZS status Unsatisfiable
% 56.40/7.62 # SZS output start CNFRefutation
% See solution above
% 56.40/7.62 # Parsed axioms : 11
% 56.40/7.62 # Removed by relevancy pruning/SinE : 0
% 56.40/7.62 # Initial clauses : 11
% 56.40/7.62 # Removed in clause preprocessing : 3
% 56.40/7.62 # Initial clauses in saturation : 8
% 56.40/7.62 # Processed clauses : 13195
% 56.40/7.62 # ...of these trivial : 26
% 56.40/7.62 # ...subsumed : 10200
% 56.40/7.62 # ...remaining for further processing : 2969
% 56.40/7.62 # Other redundant clauses eliminated : 0
% 56.40/7.62 # Clauses deleted for lack of memory : 0
% 56.40/7.62 # Backward-subsumed : 68
% 56.40/7.62 # Backward-rewritten : 1
% 56.40/7.62 # Generated clauses : 414349
% 56.40/7.62 # ...of the previous two non-redundant : 411236
% 56.40/7.62 # ...aggressively subsumed : 0
% 56.40/7.62 # Contextual simplify-reflections : 2
% 56.40/7.62 # Paramodulations : 414349
% 56.40/7.62 # Factorizations : 0
% 56.40/7.62 # NegExts : 0
% 56.40/7.62 # Equation resolutions : 0
% 56.40/7.62 # Total rewrite steps : 2591
% 56.40/7.62 # Propositional unsat checks : 0
% 56.40/7.62 # Propositional check models : 0
% 56.40/7.62 # Propositional check unsatisfiable : 0
% 56.40/7.62 # Propositional clauses : 0
% 56.40/7.62 # Propositional clauses after purity: 0
% 56.40/7.62 # Propositional unsat core size : 0
% 56.40/7.62 # Propositional preprocessing time : 0.000
% 56.40/7.62 # Propositional encoding time : 0.000
% 56.40/7.62 # Propositional solver time : 0.000
% 56.40/7.62 # Success case prop preproc time : 0.000
% 56.40/7.62 # Success case prop encoding time : 0.000
% 56.40/7.62 # Success case prop solver time : 0.000
% 56.40/7.62 # Current number of processed clauses : 2900
% 56.40/7.62 # Positive orientable unit clauses : 95
% 56.40/7.62 # Positive unorientable unit clauses: 0
% 56.40/7.62 # Negative unit clauses : 32
% 56.40/7.62 # Non-unit-clauses : 2773
% 56.40/7.62 # Current number of unprocessed clauses: 397817
% 56.40/7.62 # ...number of literals in the above : 1458700
% 56.40/7.62 # Current number of archived formulas : 0
% 56.40/7.62 # Current number of archived clauses : 72
% 56.40/7.62 # Clause-clause subsumption calls (NU) : 1565238
% 56.40/7.62 # Rec. Clause-clause subsumption calls : 1116332
% 56.40/7.62 # Non-unit clause-clause subsumptions : 10163
% 56.40/7.62 # Unit Clause-clause subsumption calls : 7515
% 56.40/7.62 # Rewrite failures with RHS unbound : 0
% 56.40/7.62 # BW rewrite match attempts : 12134
% 56.40/7.62 # BW rewrite match successes : 3
% 56.40/7.62 # Condensation attempts : 0
% 56.40/7.62 # Condensation successes : 0
% 56.40/7.62 # Termbank termtop insertions : 9731148
% 56.40/7.62
% 56.40/7.62 # -------------------------------------------------
% 56.40/7.62 # User time : 6.676 s
% 56.40/7.62 # System time : 0.258 s
% 56.40/7.62 # Total time : 6.934 s
% 56.40/7.62 # Maximum resident set size: 1656 pages
% 56.40/7.62
% 56.40/7.62 # -------------------------------------------------
% 56.40/7.62 # User time : 34.086 s
% 56.40/7.62 # System time : 0.809 s
% 56.40/7.62 # Total time : 34.895 s
% 56.40/7.62 # Maximum resident set size: 1680 pages
% 56.40/7.62 % E---3.1 exiting
%------------------------------------------------------------------------------