TSTP Solution File: LCL289-3 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : LCL289-3 : TPTP v8.1.2. Released v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n007.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 : Sat May 4 08:27:07 EDT 2024
% Result : Unsatisfiable 0.36s 1.02s
% Output : CNFRefutation 0.36s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 11
% Syntax : Number of clauses : 56 ( 31 unt; 0 nHn; 29 RR)
% Number of literals : 90 ( 7 equ; 43 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 11 ( 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 : 95 ( 3 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(rule_2,axiom,
( theorem(X1)
| ~ theorem(implies(X2,X1))
| ~ theorem(X2) ),
file('/export/starexec/sandbox2/tmp/tmp.4hU0PYE8bS/E---3.1_20938.p',rule_2) ).
cnf(implies_definition,axiom,
implies(X1,X2) = or(not(X1),X2),
file('/export/starexec/sandbox2/tmp/tmp.4hU0PYE8bS/E---3.1_20938.p',implies_definition) ).
cnf(rule_1,axiom,
( theorem(X1)
| ~ axiom(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.4hU0PYE8bS/E---3.1_20938.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.4hU0PYE8bS/E---3.1_20938.p',axiom_1_5) ).
cnf(axiom_1_2,axiom,
axiom(implies(or(X1,X1),X1)),
file('/export/starexec/sandbox2/tmp/tmp.4hU0PYE8bS/E---3.1_20938.p',axiom_1_2) ).
cnf(axiom_1_4,axiom,
axiom(implies(or(X1,X2),or(X2,X1))),
file('/export/starexec/sandbox2/tmp/tmp.4hU0PYE8bS/E---3.1_20938.p',axiom_1_4) ).
cnf(axiom_1_6,axiom,
axiom(implies(implies(X1,X2),implies(or(X3,X1),or(X3,X2)))),
file('/export/starexec/sandbox2/tmp/tmp.4hU0PYE8bS/E---3.1_20938.p',axiom_1_6) ).
cnf(axiom_1_3,axiom,
axiom(implies(X1,or(X2,X1))),
file('/export/starexec/sandbox2/tmp/tmp.4hU0PYE8bS/E---3.1_20938.p',axiom_1_3) ).
cnf(prove_this,negated_conjecture,
~ theorem(equivalent(not(and(p,not(q))),or(not(p),q))),
file('/export/starexec/sandbox2/tmp/tmp.4hU0PYE8bS/E---3.1_20938.p',prove_this) ).
cnf(equivalent_defn,axiom,
equivalent(X1,X2) = and(implies(X1,X2),implies(X2,X1)),
file('/export/starexec/sandbox2/tmp/tmp.4hU0PYE8bS/E---3.1_20938.p',equivalent_defn) ).
cnf(and_defn,axiom,
and(X1,X2) = not(or(not(X1),not(X2))),
file('/export/starexec/sandbox2/tmp/tmp.4hU0PYE8bS/E---3.1_20938.p',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,axiom,
axiom(implies(or(X1,X1),X1)),
axiom_1_2 ).
cnf(c_0_21,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_22,plain,
axiom(or(not(or(X1,X1)),X1)),
inference(rw,[status(thm)],[c_0_20,c_0_13]) ).
cnf(c_0_23,plain,
( theorem(or(X1,or(X2,X3)))
| ~ axiom(or(X2,or(X1,X3))) ),
inference(spm,[status(thm)],[c_0_21,c_0_16]) ).
cnf(c_0_24,axiom,
axiom(implies(or(X1,X2),or(X2,X1))),
axiom_1_4 ).
cnf(c_0_25,axiom,
axiom(implies(implies(X1,X2),implies(or(X3,X1),or(X3,X2)))),
axiom_1_6 ).
cnf(c_0_26,plain,
( theorem(X1)
| ~ theorem(or(X1,X1)) ),
inference(spm,[status(thm)],[c_0_18,c_0_22]) ).
cnf(c_0_27,axiom,
axiom(implies(X1,or(X2,X1))),
axiom_1_3 ).
cnf(c_0_28,plain,
( theorem(or(X1,X2))
| ~ theorem(X3)
| ~ axiom(or(X1,or(not(X3),X2))) ),
inference(spm,[status(thm)],[c_0_15,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_13]) ).
cnf(c_0_30,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_25,c_0_13]),c_0_13]),c_0_13]) ).
cnf(c_0_31,plain,
( theorem(or(X1,X2))
| ~ axiom(or(X1,or(or(X1,X2),X2))) ),
inference(spm,[status(thm)],[c_0_26,c_0_23]) ).
cnf(c_0_32,plain,
axiom(or(not(X1),or(X2,X1))),
inference(rw,[status(thm)],[c_0_27,c_0_13]) ).
cnf(c_0_33,negated_conjecture,
~ theorem(equivalent(not(and(p,not(q))),or(not(p),q))),
inference(fof_simplification,[status(thm)],[prove_this]) ).
cnf(c_0_34,axiom,
equivalent(X1,X2) = and(implies(X1,X2),implies(X2,X1)),
equivalent_defn ).
cnf(c_0_35,axiom,
and(X1,X2) = not(or(not(X1),not(X2))),
and_defn ).
cnf(c_0_36,plain,
( theorem(or(not(or(X1,not(X2))),X1))
| ~ theorem(X2) ),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_37,plain,
( theorem(or(not(or(X1,X2)),or(X1,X3)))
| ~ theorem(or(not(X2),X3)) ),
inference(spm,[status(thm)],[c_0_18,c_0_30]) ).
cnf(c_0_38,plain,
( theorem(or(X1,X2))
| ~ theorem(or(X2,X1)) ),
inference(spm,[status(thm)],[c_0_18,c_0_29]) ).
cnf(c_0_39,plain,
theorem(or(not(X1),X1)),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_40,negated_conjecture,
~ theorem(equivalent(not(and(p,not(q))),or(not(p),q))),
c_0_33 ).
cnf(c_0_41,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_34,c_0_13]),c_0_13]),c_0_35]) ).
cnf(c_0_42,plain,
( theorem(X1)
| ~ theorem(or(X1,not(X2)))
| ~ theorem(X2) ),
inference(spm,[status(thm)],[c_0_15,c_0_36]) ).
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_37]) ).
cnf(c_0_44,plain,
theorem(or(X1,not(X1))),
inference(spm,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_45,negated_conjecture,
~ theorem(not(or(not(or(not(not(not(or(not(p),not(not(q)))))),or(not(p),q))),not(or(not(or(not(p),q)),not(not(or(not(p),not(not(q)))))))))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_40,c_0_35]),c_0_41]) ).
cnf(c_0_46,plain,
( theorem(not(or(not(X1),not(X2))))
| ~ theorem(X1)
| ~ theorem(X2) ),
inference(spm,[status(thm)],[c_0_42,c_0_36]) ).
cnf(c_0_47,plain,
( theorem(or(X1,not(not(X2))))
| ~ theorem(or(X1,X2)) ),
inference(spm,[status(thm)],[c_0_43,c_0_44]) ).
cnf(c_0_48,negated_conjecture,
( ~ theorem(or(not(not(not(or(not(p),not(not(q)))))),or(not(p),q)))
| ~ theorem(or(not(or(not(p),q)),not(not(or(not(p),not(not(q))))))) ),
inference(spm,[status(thm)],[c_0_45,c_0_46]) ).
cnf(c_0_49,plain,
( theorem(or(not(not(X1)),X2))
| ~ theorem(or(X2,X1)) ),
inference(spm,[status(thm)],[c_0_38,c_0_47]) ).
cnf(c_0_50,negated_conjecture,
( ~ theorem(or(not(or(not(p),q)),not(not(or(not(p),not(not(q)))))))
| ~ theorem(or(or(not(p),q),not(or(not(p),not(not(q)))))) ),
inference(spm,[status(thm)],[c_0_48,c_0_49]) ).
cnf(c_0_51,negated_conjecture,
( ~ theorem(or(or(not(p),q),not(or(not(p),not(not(q))))))
| ~ theorem(or(not(or(not(p),q)),or(not(p),not(not(q))))) ),
inference(spm,[status(thm)],[c_0_50,c_0_47]) ).
cnf(c_0_52,negated_conjecture,
~ theorem(or(or(not(p),q),not(or(not(p),not(not(q)))))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_37]),c_0_44])]) ).
cnf(c_0_53,plain,
( theorem(or(or(X1,X2),not(or(X1,X3))))
| ~ theorem(or(not(X3),X2)) ),
inference(spm,[status(thm)],[c_0_38,c_0_37]) ).
cnf(c_0_54,negated_conjecture,
~ theorem(or(not(not(not(q))),q)),
inference(spm,[status(thm)],[c_0_52,c_0_53]) ).
cnf(c_0_55,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_49]),c_0_44])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : LCL289-3 : TPTP v8.1.2. Released v2.3.0.
% 0.07/0.14 % Command : run_E %s %d THM
% 0.15/0.35 % Computer : n007.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 300
% 0.15/0.35 % WCLimit : 300
% 0.15/0.35 % DateTime : Fri May 3 08:42:20 EDT 2024
% 0.15/0.35 % CPUTime :
% 0.21/0.51 Running first-order model finding
% 0.21/0.51 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.4hU0PYE8bS/E---3.1_20938.p
% 0.36/1.02 # Version: 3.1.0
% 0.36/1.02 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.36/1.02 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.36/1.02 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.36/1.02 # Starting new_bool_3 with 300s (1) cores
% 0.36/1.02 # Starting new_bool_1 with 300s (1) cores
% 0.36/1.02 # Starting sh5l with 300s (1) cores
% 0.36/1.02 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 21031 completed with status 0
% 0.36/1.02 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.36/1.02 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.36/1.02 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.36/1.02 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.36/1.02 # No SInE strategy applied
% 0.36/1.02 # Search class: FHUNM-FFSF21-DFFFFFNN
% 0.36/1.02 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.36/1.02 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 355s (1) cores
% 0.36/1.02 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.36/1.02 # Starting new_bool_3 with 296s (1) cores
% 0.36/1.02 # Starting new_bool_1 with 291s (1) cores
% 0.36/1.02 # Starting G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.36/1.02 # G-E--_302_C18_F1_URBAN_RG_S04BN with pid 21036 completed with status 0
% 0.36/1.02 # Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 0.36/1.02 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.36/1.02 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.36/1.02 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.36/1.02 # No SInE strategy applied
% 0.36/1.02 # Search class: FHUNM-FFSF21-DFFFFFNN
% 0.36/1.02 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.36/1.02 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 355s (1) cores
% 0.36/1.02 # Preprocessing time : 0.043 s
% 0.36/1.02
% 0.36/1.02 # Proof found!
% 0.36/1.02 # SZS status Unsatisfiable
% 0.36/1.02 # SZS output start CNFRefutation
% See solution above
% 0.36/1.02 # Parsed axioms : 11
% 0.36/1.02 # Removed by relevancy pruning/SinE : 0
% 0.36/1.02 # Initial clauses : 11
% 0.36/1.02 # Removed in clause preprocessing : 3
% 0.36/1.02 # Initial clauses in saturation : 8
% 0.36/1.02 # Processed clauses : 2488
% 0.36/1.02 # ...of these trivial : 10
% 0.36/1.02 # ...subsumed : 1409
% 0.36/1.02 # ...remaining for further processing : 1069
% 0.36/1.02 # Other redundant clauses eliminated : 0
% 0.36/1.02 # Clauses deleted for lack of memory : 0
% 0.36/1.02 # Backward-subsumed : 333
% 0.36/1.02 # Backward-rewritten : 0
% 0.36/1.02 # Generated clauses : 24503
% 0.36/1.02 # ...of the previous two non-redundant : 24217
% 0.36/1.02 # ...aggressively subsumed : 0
% 0.36/1.02 # Contextual simplify-reflections : 6
% 0.36/1.02 # Paramodulations : 24503
% 0.36/1.02 # Factorizations : 0
% 0.36/1.02 # NegExts : 0
% 0.36/1.02 # Equation resolutions : 0
% 0.36/1.02 # Disequality decompositions : 0
% 0.36/1.02 # Total rewrite steps : 263
% 0.36/1.02 # ...of those cached : 213
% 0.36/1.02 # Propositional unsat checks : 0
% 0.36/1.02 # Propositional check models : 0
% 0.36/1.02 # Propositional check unsatisfiable : 0
% 0.36/1.02 # Propositional clauses : 0
% 0.36/1.02 # Propositional clauses after purity: 0
% 0.36/1.02 # Propositional unsat core size : 0
% 0.36/1.02 # Propositional preprocessing time : 0.000
% 0.36/1.02 # Propositional encoding time : 0.000
% 0.36/1.02 # Propositional solver time : 0.000
% 0.36/1.02 # Success case prop preproc time : 0.000
% 0.36/1.02 # Success case prop encoding time : 0.000
% 0.36/1.02 # Success case prop solver time : 0.000
% 0.36/1.02 # Current number of processed clauses : 736
% 0.36/1.02 # Positive orientable unit clauses : 26
% 0.36/1.02 # Positive unorientable unit clauses: 0
% 0.36/1.02 # Negative unit clauses : 51
% 0.36/1.02 # Non-unit-clauses : 659
% 0.36/1.02 # Current number of unprocessed clauses: 21423
% 0.36/1.02 # ...number of literals in the above : 71292
% 0.36/1.02 # Current number of archived formulas : 0
% 0.36/1.02 # Current number of archived clauses : 336
% 0.36/1.02 # Clause-clause subsumption calls (NU) : 94206
% 0.36/1.02 # Rec. Clause-clause subsumption calls : 83026
% 0.36/1.02 # Non-unit clause-clause subsumptions : 1104
% 0.36/1.02 # Unit Clause-clause subsumption calls : 5833
% 0.36/1.02 # Rewrite failures with RHS unbound : 0
% 0.36/1.02 # BW rewrite match attempts : 771
% 0.36/1.02 # BW rewrite match successes : 2
% 0.36/1.02 # Condensation attempts : 0
% 0.36/1.02 # Condensation successes : 0
% 0.36/1.02 # Termbank termtop insertions : 423555
% 0.36/1.02 # Search garbage collected termcells : 11
% 0.36/1.02
% 0.36/1.02 # -------------------------------------------------
% 0.36/1.02 # User time : 0.482 s
% 0.36/1.02 # System time : 0.019 s
% 0.36/1.02 # Total time : 0.501 s
% 0.36/1.02 # Maximum resident set size: 1656 pages
% 0.36/1.02
% 0.36/1.02 # -------------------------------------------------
% 0.36/1.02 # User time : 2.434 s
% 0.36/1.02 # System time : 0.061 s
% 0.36/1.02 # Total time : 2.495 s
% 0.36/1.02 # Maximum resident set size: 1700 pages
% 0.36/1.02 % E---3.1 exiting
%------------------------------------------------------------------------------