TSTP Solution File: LCL249-3 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : LCL249-3 : TPTP v8.1.2. Released v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n018.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:22 EDT 2023
% Result : Unsatisfiable 0.21s 0.59s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 10
% Syntax : Number of clauses : 70 ( 33 unt; 0 nHn; 29 RR)
% Number of literals : 119 ( 4 equ; 53 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 7 ( 2 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 3 con; 0-2 aty)
% Number of variables : 137 ( 20 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(rule_2,axiom,
( theorem(X1)
| ~ theorem(implies(X2,X1))
| ~ theorem(X2) ),
file('/export/starexec/sandbox2/tmp/tmp.VHLHbEcaVO/E---3.1_20238.p',rule_2) ).
cnf(implies_definition,axiom,
implies(X1,X2) = or(not(X1),X2),
file('/export/starexec/sandbox2/tmp/tmp.VHLHbEcaVO/E---3.1_20238.p',implies_definition) ).
cnf(rule_1,axiom,
( theorem(X1)
| ~ axiom(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.VHLHbEcaVO/E---3.1_20238.p',rule_1) ).
cnf(axiom_1_6,axiom,
axiom(implies(implies(X1,X2),implies(or(X3,X1),or(X3,X2)))),
file('/export/starexec/sandbox2/tmp/tmp.VHLHbEcaVO/E---3.1_20238.p',axiom_1_6) ).
cnf(axiom_1_4,axiom,
axiom(implies(or(X1,X2),or(X2,X1))),
file('/export/starexec/sandbox2/tmp/tmp.VHLHbEcaVO/E---3.1_20238.p',axiom_1_4) ).
cnf(axiom_1_3,axiom,
axiom(implies(X1,or(X2,X1))),
file('/export/starexec/sandbox2/tmp/tmp.VHLHbEcaVO/E---3.1_20238.p',axiom_1_3) ).
cnf(axiom_1_2,axiom,
axiom(implies(or(X1,X1),X1)),
file('/export/starexec/sandbox2/tmp/tmp.VHLHbEcaVO/E---3.1_20238.p',axiom_1_2) ).
cnf(axiom_1_5,axiom,
axiom(implies(or(X1,or(X2,X3)),or(X2,or(X1,X3)))),
file('/export/starexec/sandbox2/tmp/tmp.VHLHbEcaVO/E---3.1_20238.p',axiom_1_5) ).
cnf(prove_this,negated_conjecture,
~ theorem(implies(implies(p,r),implies(and(p,q),r))),
file('/export/starexec/sandbox2/tmp/tmp.VHLHbEcaVO/E---3.1_20238.p',prove_this) ).
cnf(and_defn,axiom,
and(X1,X2) = not(or(not(X1),not(X2))),
file('/export/starexec/sandbox2/tmp/tmp.VHLHbEcaVO/E---3.1_20238.p',and_defn) ).
cnf(c_0_10,axiom,
( theorem(X1)
| ~ theorem(implies(X2,X1))
| ~ theorem(X2) ),
rule_2 ).
cnf(c_0_11,axiom,
implies(X1,X2) = or(not(X1),X2),
implies_definition ).
cnf(c_0_12,plain,
( theorem(X1)
| ~ theorem(X2)
| ~ theorem(or(not(X2),X1)) ),
inference(rw,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_13,axiom,
( theorem(X1)
| ~ axiom(X1) ),
rule_1 ).
cnf(c_0_14,axiom,
axiom(implies(implies(X1,X2),implies(or(X3,X1),or(X3,X2)))),
axiom_1_6 ).
cnf(c_0_15,axiom,
axiom(implies(or(X1,X2),or(X2,X1))),
axiom_1_4 ).
cnf(c_0_16,axiom,
axiom(implies(X1,or(X2,X1))),
axiom_1_3 ).
cnf(c_0_17,plain,
( theorem(X1)
| ~ theorem(X2)
| ~ axiom(or(not(X2),X1)) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_18,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_14,c_0_11]),c_0_11]),c_0_11]) ).
cnf(c_0_19,plain,
axiom(or(not(or(X1,X2)),or(X2,X1))),
inference(rw,[status(thm)],[c_0_15,c_0_11]) ).
cnf(c_0_20,plain,
axiom(or(not(X1),or(X2,X1))),
inference(rw,[status(thm)],[c_0_16,c_0_11]) ).
cnf(c_0_21,plain,
( theorem(or(not(or(X1,X2)),or(X1,X3)))
| ~ theorem(or(not(X2),X3)) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_22,plain,
( theorem(or(X1,X2))
| ~ theorem(or(X2,X1)) ),
inference(spm,[status(thm)],[c_0_17,c_0_19]) ).
cnf(c_0_23,plain,
( theorem(or(X1,X2))
| ~ theorem(X2) ),
inference(spm,[status(thm)],[c_0_17,c_0_20]) ).
cnf(c_0_24,plain,
( theorem(or(X1,X2))
| ~ theorem(or(not(X3),X2))
| ~ theorem(or(X1,X3)) ),
inference(spm,[status(thm)],[c_0_12,c_0_21]) ).
cnf(c_0_25,axiom,
axiom(implies(or(X1,X1),X1)),
axiom_1_2 ).
cnf(c_0_26,plain,
( theorem(or(X1,X2))
| ~ theorem(X1) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_27,plain,
( theorem(or(X1,X2))
| ~ theorem(or(X1,X3))
| ~ axiom(or(not(X3),X2)) ),
inference(spm,[status(thm)],[c_0_24,c_0_13]) ).
cnf(c_0_28,plain,
axiom(or(not(or(X1,X1)),X1)),
inference(rw,[status(thm)],[c_0_25,c_0_11]) ).
cnf(c_0_29,plain,
( theorem(or(X1,X2))
| ~ theorem(or(X1,X3))
| ~ theorem(not(X3)) ),
inference(spm,[status(thm)],[c_0_24,c_0_26]) ).
cnf(c_0_30,plain,
( theorem(or(X1,X2))
| ~ axiom(or(X2,X1)) ),
inference(spm,[status(thm)],[c_0_22,c_0_13]) ).
cnf(c_0_31,plain,
( theorem(or(X1,X2))
| ~ theorem(or(X1,or(X2,X2))) ),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_32,plain,
( theorem(or(X1,X2))
| ~ theorem(not(X3))
| ~ axiom(or(X1,X3)) ),
inference(spm,[status(thm)],[c_0_29,c_0_13]) ).
cnf(c_0_33,plain,
( theorem(X1)
| ~ theorem(X2)
| ~ axiom(or(X1,not(X2))) ),
inference(spm,[status(thm)],[c_0_12,c_0_30]) ).
cnf(c_0_34,plain,
( theorem(or(X1,X2))
| ~ axiom(or(X1,or(X2,X2))) ),
inference(spm,[status(thm)],[c_0_31,c_0_13]) ).
cnf(c_0_35,plain,
( theorem(or(not(X1),X2))
| ~ theorem(not(or(X3,X1))) ),
inference(spm,[status(thm)],[c_0_32,c_0_20]) ).
cnf(c_0_36,plain,
( theorem(not(or(not(X1),not(X1))))
| ~ theorem(X1) ),
inference(spm,[status(thm)],[c_0_33,c_0_28]) ).
cnf(c_0_37,axiom,
axiom(implies(or(X1,or(X2,X3)),or(X2,or(X1,X3)))),
axiom_1_5 ).
cnf(c_0_38,plain,
theorem(or(not(X1),X1)),
inference(spm,[status(thm)],[c_0_34,c_0_20]) ).
cnf(c_0_39,plain,
( theorem(or(X1,X2))
| ~ theorem(not(X3))
| ~ axiom(or(X3,X1)) ),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_40,plain,
( theorem(X1)
| ~ theorem(or(X1,X1)) ),
inference(spm,[status(thm)],[c_0_17,c_0_28]) ).
cnf(c_0_41,plain,
( theorem(or(not(not(X1)),X2))
| ~ theorem(X1) ),
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_42,plain,
axiom(or(not(or(X1,or(X2,X3))),or(X2,or(X1,X3)))),
inference(rw,[status(thm)],[c_0_37,c_0_11]) ).
cnf(c_0_43,plain,
theorem(or(X1,not(X1))),
inference(spm,[status(thm)],[c_0_22,c_0_38]) ).
cnf(c_0_44,plain,
( theorem(or(X1,X2))
| ~ theorem(not(not(or(X1,X1)))) ),
inference(spm,[status(thm)],[c_0_39,c_0_28]) ).
cnf(c_0_45,plain,
( theorem(not(not(X1)))
| ~ theorem(X1) ),
inference(spm,[status(thm)],[c_0_40,c_0_41]) ).
cnf(c_0_46,plain,
( theorem(or(X1,or(X2,X3)))
| ~ theorem(or(X2,or(X1,X3))) ),
inference(spm,[status(thm)],[c_0_17,c_0_42]) ).
cnf(c_0_47,plain,
( theorem(or(X1,not(not(X2))))
| ~ theorem(or(X1,X2)) ),
inference(spm,[status(thm)],[c_0_24,c_0_43]) ).
cnf(c_0_48,plain,
( theorem(or(X1,X2))
| ~ theorem(or(X1,X1)) ),
inference(spm,[status(thm)],[c_0_44,c_0_45]) ).
cnf(c_0_49,plain,
( theorem(or(X1,or(X2,X3)))
| ~ axiom(or(X2,or(X1,X3))) ),
inference(spm,[status(thm)],[c_0_46,c_0_13]) ).
cnf(c_0_50,plain,
( theorem(not(not(X1)))
| ~ theorem(or(not(X2),X1))
| ~ theorem(X2) ),
inference(spm,[status(thm)],[c_0_12,c_0_47]) ).
cnf(c_0_51,plain,
theorem(or(not(or(X1,X1)),X1)),
inference(spm,[status(thm)],[c_0_34,c_0_19]) ).
cnf(c_0_52,plain,
( theorem(or(or(X1,X2),X3))
| ~ axiom(or(X1,or(or(X1,X2),X2))) ),
inference(spm,[status(thm)],[c_0_48,c_0_49]) ).
cnf(c_0_53,plain,
( theorem(not(not(X1)))
| ~ theorem(or(X1,X1)) ),
inference(spm,[status(thm)],[c_0_50,c_0_51]) ).
cnf(c_0_54,plain,
theorem(or(or(not(X1),X1),X2)),
inference(spm,[status(thm)],[c_0_52,c_0_20]) ).
cnf(c_0_55,plain,
( theorem(or(or(X1,X2),X3))
| ~ theorem(not(not(or(X2,X1)))) ),
inference(spm,[status(thm)],[c_0_39,c_0_19]) ).
cnf(c_0_56,plain,
theorem(not(not(or(not(X1),X1)))),
inference(spm,[status(thm)],[c_0_53,c_0_54]) ).
cnf(c_0_57,plain,
theorem(or(or(X1,not(X1)),X2)),
inference(spm,[status(thm)],[c_0_55,c_0_56]) ).
cnf(c_0_58,negated_conjecture,
~ theorem(implies(implies(p,r),implies(and(p,q),r))),
prove_this ).
cnf(c_0_59,axiom,
and(X1,X2) = not(or(not(X1),not(X2))),
and_defn ).
cnf(c_0_60,plain,
( theorem(or(X1,X2))
| ~ theorem(X3)
| ~ axiom(or(X1,or(not(X3),X2))) ),
inference(spm,[status(thm)],[c_0_12,c_0_49]) ).
cnf(c_0_61,plain,
theorem(or(X1,or(X2,not(X2)))),
inference(spm,[status(thm)],[c_0_22,c_0_57]) ).
cnf(c_0_62,negated_conjecture,
~ theorem(or(not(or(not(p),r)),or(not(not(or(not(p),not(q)))),r))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_58,c_0_11]),c_0_11]),c_0_11]),c_0_59]) ).
cnf(c_0_63,plain,
( theorem(or(not(or(not(X1),X2)),or(X3,X2)))
| ~ theorem(or(X3,X1)) ),
inference(spm,[status(thm)],[c_0_60,c_0_18]) ).
cnf(c_0_64,plain,
( theorem(or(X1,or(X2,X3)))
| ~ theorem(or(X1,or(X3,X2))) ),
inference(spm,[status(thm)],[c_0_27,c_0_19]) ).
cnf(c_0_65,plain,
theorem(or(X1,or(X2,not(X1)))),
inference(spm,[status(thm)],[c_0_46,c_0_61]) ).
cnf(c_0_66,negated_conjecture,
~ theorem(or(not(not(or(not(p),not(q)))),p)),
inference(spm,[status(thm)],[c_0_62,c_0_63]) ).
cnf(c_0_67,plain,
( theorem(or(not(not(X1)),X2))
| ~ theorem(or(X2,X1)) ),
inference(spm,[status(thm)],[c_0_22,c_0_47]) ).
cnf(c_0_68,plain,
theorem(or(X1,or(not(X1),X2))),
inference(spm,[status(thm)],[c_0_64,c_0_65]) ).
cnf(c_0_69,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_66,c_0_67]),c_0_68])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : LCL249-3 : TPTP v8.1.2. Released v2.3.0.
% 0.07/0.14 % Command : run_E %s %d THM
% 0.13/0.35 % Computer : n018.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 2400
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Mon Oct 2 12:42:39 EDT 2023
% 0.13/0.36 % CPUTime :
% 0.21/0.49 Running first-order model finding
% 0.21/0.49 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.VHLHbEcaVO/E---3.1_20238.p
% 0.21/0.59 # Version: 3.1pre001
% 0.21/0.59 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.21/0.59 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.59 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.21/0.59 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.59 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.59 # Starting sh5l with 300s (1) cores
% 0.21/0.59 # G-E--_302_C18_F1_URBAN_RG_S04BN with pid 20382 completed with status 0
% 0.21/0.59 # Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 0.21/0.59 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.21/0.59 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.59 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.21/0.59 # No SInE strategy applied
% 0.21/0.59 # Search class: FHUNM-FFSF21-DFFFFFNN
% 0.21/0.59 # Scheduled 5 strats onto 5 cores with 1500 seconds (1500 total)
% 0.21/0.59 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 395s (1) cores
% 0.21/0.59 # Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN with 334s (1) cores
% 0.21/0.59 # Starting new_bool_3 with 329s (1) cores
% 0.21/0.59 # Starting new_bool_1 with 324s (1) cores
% 0.21/0.59 # Starting G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 118s (1) cores
% 0.21/0.59 # G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with pid 20395 completed with status 0
% 0.21/0.59 # Result found by G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.21/0.59 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.21/0.59 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.59 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.21/0.59 # No SInE strategy applied
% 0.21/0.59 # Search class: FHUNM-FFSF21-DFFFFFNN
% 0.21/0.59 # Scheduled 5 strats onto 5 cores with 1500 seconds (1500 total)
% 0.21/0.59 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 395s (1) cores
% 0.21/0.59 # Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN with 334s (1) cores
% 0.21/0.59 # Starting new_bool_3 with 329s (1) cores
% 0.21/0.59 # Starting new_bool_1 with 324s (1) cores
% 0.21/0.59 # Starting G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 118s (1) cores
% 0.21/0.59 # Preprocessing time : 0.001 s
% 0.21/0.59 # Presaturation interreduction done
% 0.21/0.59
% 0.21/0.59 # Proof found!
% 0.21/0.59 # SZS status Unsatisfiable
% 0.21/0.59 # SZS output start CNFRefutation
% See solution above
% 0.21/0.59 # Parsed axioms : 10
% 0.21/0.59 # Removed by relevancy pruning/SinE : 0
% 0.21/0.59 # Initial clauses : 10
% 0.21/0.59 # Removed in clause preprocessing : 2
% 0.21/0.59 # Initial clauses in saturation : 8
% 0.21/0.59 # Processed clauses : 1350
% 0.21/0.59 # ...of these trivial : 28
% 0.21/0.59 # ...subsumed : 869
% 0.21/0.59 # ...remaining for further processing : 453
% 0.21/0.59 # Other redundant clauses eliminated : 0
% 0.21/0.59 # Clauses deleted for lack of memory : 0
% 0.21/0.59 # Backward-subsumed : 5
% 0.21/0.59 # Backward-rewritten : 2
% 0.21/0.59 # Generated clauses : 4270
% 0.21/0.59 # ...of the previous two non-redundant : 3992
% 0.21/0.59 # ...aggressively subsumed : 0
% 0.21/0.59 # Contextual simplify-reflections : 0
% 0.21/0.59 # Paramodulations : 4270
% 0.21/0.59 # Factorizations : 0
% 0.21/0.59 # NegExts : 0
% 0.21/0.59 # Equation resolutions : 0
% 0.21/0.59 # Total rewrite steps : 243
% 0.21/0.59 # Propositional unsat checks : 0
% 0.21/0.59 # Propositional check models : 0
% 0.21/0.59 # Propositional check unsatisfiable : 0
% 0.21/0.59 # Propositional clauses : 0
% 0.21/0.59 # Propositional clauses after purity: 0
% 0.21/0.59 # Propositional unsat core size : 0
% 0.21/0.59 # Propositional preprocessing time : 0.000
% 0.21/0.59 # Propositional encoding time : 0.000
% 0.21/0.59 # Propositional solver time : 0.000
% 0.21/0.59 # Success case prop preproc time : 0.000
% 0.21/0.59 # Success case prop encoding time : 0.000
% 0.21/0.59 # Success case prop solver time : 0.000
% 0.21/0.59 # Current number of processed clauses : 438
% 0.21/0.59 # Positive orientable unit clauses : 36
% 0.21/0.59 # Positive unorientable unit clauses: 0
% 0.21/0.59 # Negative unit clauses : 37
% 0.21/0.59 # Non-unit-clauses : 365
% 0.21/0.59 # Current number of unprocessed clauses: 2619
% 0.21/0.59 # ...number of literals in the above : 6398
% 0.21/0.59 # Current number of archived formulas : 0
% 0.21/0.59 # Current number of archived clauses : 17
% 0.21/0.59 # Clause-clause subsumption calls (NU) : 15639
% 0.21/0.59 # Rec. Clause-clause subsumption calls : 15639
% 0.21/0.59 # Non-unit clause-clause subsumptions : 856
% 0.21/0.59 # Unit Clause-clause subsumption calls : 373
% 0.21/0.59 # Rewrite failures with RHS unbound : 0
% 0.21/0.59 # BW rewrite match attempts : 521
% 0.21/0.59 # BW rewrite match successes : 2
% 0.21/0.59 # Condensation attempts : 0
% 0.21/0.59 # Condensation successes : 0
% 0.21/0.59 # Termbank termtop insertions : 55756
% 0.21/0.59
% 0.21/0.59 # -------------------------------------------------
% 0.21/0.59 # User time : 0.084 s
% 0.21/0.59 # System time : 0.003 s
% 0.21/0.59 # Total time : 0.087 s
% 0.21/0.59 # Maximum resident set size: 1652 pages
% 0.21/0.59
% 0.21/0.59 # -------------------------------------------------
% 0.21/0.59 # User time : 0.413 s
% 0.21/0.59 # System time : 0.025 s
% 0.21/0.59 # Total time : 0.438 s
% 0.21/0.59 # Maximum resident set size: 1680 pages
% 0.21/0.59 % E---3.1 exiting
%------------------------------------------------------------------------------