TSTP Solution File: LCL271-3 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : LCL271-3 : TPTP v8.1.2. Released v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n020.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:26 EDT 2023
% Result : Unsatisfiable 0.20s 0.55s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 11
% Syntax : Number of clauses : 61 ( 36 unt; 0 nHn; 24 RR)
% Number of literals : 92 ( 8 equ; 34 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 1 con; 0-2 aty)
% Number of variables : 122 ( 13 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(rule_1,axiom,
( theorem(X1)
| ~ axiom(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.dbH4ruCEQb/E---3.1_1799.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.dbH4ruCEQb/E---3.1_1799.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.dbH4ruCEQb/E---3.1_1799.p',axiom_1_6) ).
cnf(rule_2,axiom,
( theorem(X1)
| ~ theorem(implies(X2,X1))
| ~ theorem(X2) ),
file('/export/starexec/sandbox2/tmp/tmp.dbH4ruCEQb/E---3.1_1799.p',rule_2) ).
cnf(axiom_1_2,axiom,
axiom(implies(or(X1,X1),X1)),
file('/export/starexec/sandbox2/tmp/tmp.dbH4ruCEQb/E---3.1_1799.p',axiom_1_2) ).
cnf(implies_definition,axiom,
implies(X1,X2) = or(not(X1),X2),
file('/export/starexec/sandbox2/tmp/tmp.dbH4ruCEQb/E---3.1_1799.p',implies_definition) ).
cnf(axiom_1_3,axiom,
axiom(implies(X1,or(X2,X1))),
file('/export/starexec/sandbox2/tmp/tmp.dbH4ruCEQb/E---3.1_1799.p',axiom_1_3) ).
cnf(axiom_1_4,axiom,
axiom(implies(or(X1,X2),or(X2,X1))),
file('/export/starexec/sandbox2/tmp/tmp.dbH4ruCEQb/E---3.1_1799.p',axiom_1_4) ).
cnf(and_defn,axiom,
and(X1,X2) = not(or(not(X1),not(X2))),
file('/export/starexec/sandbox2/tmp/tmp.dbH4ruCEQb/E---3.1_1799.p',and_defn) ).
cnf(equivalent_defn,axiom,
equivalent(X1,X2) = and(implies(X1,X2),implies(X2,X1)),
file('/export/starexec/sandbox2/tmp/tmp.dbH4ruCEQb/E---3.1_1799.p',equivalent_defn) ).
cnf(prove_this,negated_conjecture,
~ theorem(equivalent(p,and(p,p))),
file('/export/starexec/sandbox2/tmp/tmp.dbH4ruCEQb/E---3.1_1799.p',prove_this) ).
cnf(c_0_11,axiom,
( theorem(X1)
| ~ axiom(X1) ),
rule_1 ).
cnf(c_0_12,axiom,
axiom(implies(or(X1,or(X2,X3)),or(X2,or(X1,X3)))),
axiom_1_5 ).
cnf(c_0_13,axiom,
axiom(implies(implies(X1,X2),implies(or(X3,X1),or(X3,X2)))),
axiom_1_6 ).
cnf(c_0_14,axiom,
( theorem(X1)
| ~ theorem(implies(X2,X1))
| ~ theorem(X2) ),
rule_2 ).
cnf(c_0_15,plain,
theorem(implies(or(X1,or(X2,X3)),or(X2,or(X1,X3)))),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_16,plain,
theorem(implies(implies(X1,X2),implies(or(X3,X1),or(X3,X2)))),
inference(spm,[status(thm)],[c_0_11,c_0_13]) ).
cnf(c_0_17,axiom,
axiom(implies(or(X1,X1),X1)),
axiom_1_2 ).
cnf(c_0_18,plain,
( theorem(or(X1,or(X2,X3)))
| ~ theorem(or(X2,or(X1,X3))) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_19,axiom,
implies(X1,X2) = or(not(X1),X2),
implies_definition ).
cnf(c_0_20,axiom,
axiom(implies(X1,or(X2,X1))),
axiom_1_3 ).
cnf(c_0_21,plain,
( theorem(implies(or(X1,X2),or(X1,X3)))
| ~ theorem(implies(X2,X3)) ),
inference(spm,[status(thm)],[c_0_14,c_0_16]) ).
cnf(c_0_22,axiom,
axiom(implies(or(X1,X2),or(X2,X1))),
axiom_1_4 ).
cnf(c_0_23,plain,
theorem(implies(or(X1,X1),X1)),
inference(spm,[status(thm)],[c_0_11,c_0_17]) ).
cnf(c_0_24,plain,
( theorem(or(X1,implies(X2,X3)))
| ~ theorem(implies(X2,or(X1,X3))) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_19]) ).
cnf(c_0_25,plain,
theorem(implies(X1,or(X2,X1))),
inference(spm,[status(thm)],[c_0_11,c_0_20]) ).
cnf(c_0_26,plain,
( theorem(or(X1,X2))
| ~ theorem(or(X1,X3))
| ~ theorem(implies(X3,X2)) ),
inference(spm,[status(thm)],[c_0_14,c_0_21]) ).
cnf(c_0_27,plain,
theorem(implies(or(X1,X2),or(X2,X1))),
inference(spm,[status(thm)],[c_0_11,c_0_22]) ).
cnf(c_0_28,plain,
( theorem(X1)
| ~ theorem(or(X1,X1)) ),
inference(spm,[status(thm)],[c_0_14,c_0_23]) ).
cnf(c_0_29,plain,
theorem(or(X1,implies(X2,X2))),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_30,plain,
( theorem(implies(X1,X2))
| ~ theorem(implies(X1,X3))
| ~ theorem(implies(X3,X2)) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_19]),c_0_19]) ).
cnf(c_0_31,plain,
( theorem(or(X1,X2))
| ~ theorem(or(X2,X1)) ),
inference(spm,[status(thm)],[c_0_14,c_0_27]) ).
cnf(c_0_32,plain,
( theorem(implies(X1,implies(X2,X3)))
| ~ theorem(implies(X2,implies(X1,X3))) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_19]),c_0_19]) ).
cnf(c_0_33,plain,
theorem(implies(X1,X1)),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_34,plain,
( theorem(implies(X1,X2))
| ~ theorem(implies(or(X3,X1),X2)) ),
inference(spm,[status(thm)],[c_0_30,c_0_25]) ).
cnf(c_0_35,plain,
( theorem(or(X1,X2))
| ~ theorem(X2) ),
inference(spm,[status(thm)],[c_0_14,c_0_25]) ).
cnf(c_0_36,plain,
( theorem(or(X1,not(X2)))
| ~ theorem(implies(X2,X1)) ),
inference(spm,[status(thm)],[c_0_31,c_0_19]) ).
cnf(c_0_37,plain,
theorem(implies(X1,implies(implies(X1,X2),X2))),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_38,axiom,
and(X1,X2) = not(or(not(X1),not(X2))),
and_defn ).
cnf(c_0_39,plain,
theorem(implies(X1,or(X1,X2))),
inference(spm,[status(thm)],[c_0_34,c_0_27]) ).
cnf(c_0_40,plain,
( theorem(or(X1,or(X2,X3)))
| ~ theorem(or(X1,X3)) ),
inference(spm,[status(thm)],[c_0_18,c_0_35]) ).
cnf(c_0_41,plain,
( theorem(implies(X1,not(X2)))
| ~ theorem(implies(X2,not(X1))) ),
inference(spm,[status(thm)],[c_0_36,c_0_19]) ).
cnf(c_0_42,plain,
( theorem(implies(implies(X1,X2),X2))
| ~ theorem(X1) ),
inference(spm,[status(thm)],[c_0_14,c_0_37]) ).
cnf(c_0_43,plain,
not(implies(X1,not(X2))) = and(X1,X2),
inference(rw,[status(thm)],[c_0_38,c_0_19]) ).
cnf(c_0_44,plain,
theorem(or(X1,implies(X1,X2))),
inference(spm,[status(thm)],[c_0_24,c_0_39]) ).
cnf(c_0_45,plain,
( theorem(or(X1,X2))
| ~ theorem(or(or(X1,X2),X2)) ),
inference(spm,[status(thm)],[c_0_28,c_0_40]) ).
cnf(c_0_46,plain,
( theorem(implies(X1,and(X2,X1)))
| ~ theorem(X2) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_42]),c_0_43]) ).
cnf(c_0_47,plain,
( theorem(or(X1,X2))
| ~ theorem(implies(implies(X1,X3),X2)) ),
inference(spm,[status(thm)],[c_0_26,c_0_44]) ).
cnf(c_0_48,plain,
implies(implies(X1,not(X2)),X3) = or(and(X1,X2),X3),
inference(spm,[status(thm)],[c_0_19,c_0_43]) ).
cnf(c_0_49,plain,
( theorem(or(X1,not(X2)))
| ~ theorem(implies(X2,or(X1,not(X2)))) ),
inference(spm,[status(thm)],[c_0_45,c_0_36]) ).
cnf(c_0_50,plain,
( theorem(and(X1,X2))
| ~ theorem(X2)
| ~ theorem(X1) ),
inference(spm,[status(thm)],[c_0_14,c_0_46]) ).
cnf(c_0_51,axiom,
equivalent(X1,X2) = and(implies(X1,X2),implies(X2,X1)),
equivalent_defn ).
cnf(c_0_52,plain,
( theorem(or(X1,X2))
| ~ theorem(or(and(X1,X3),X2)) ),
inference(spm,[status(thm)],[c_0_47,c_0_48]) ).
cnf(c_0_53,plain,
theorem(or(X1,not(X1))),
inference(spm,[status(thm)],[c_0_49,c_0_39]) ).
cnf(c_0_54,negated_conjecture,
~ theorem(equivalent(p,and(p,p))),
prove_this ).
cnf(c_0_55,plain,
( theorem(equivalent(X1,X2))
| ~ theorem(implies(X2,X1))
| ~ theorem(implies(X1,X2)) ),
inference(spm,[status(thm)],[c_0_50,c_0_51]) ).
cnf(c_0_56,plain,
theorem(implies(X1,and(X1,X1))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_23]),c_0_19]),c_0_43]) ).
cnf(c_0_57,plain,
theorem(or(X1,not(and(X1,X2)))),
inference(spm,[status(thm)],[c_0_52,c_0_53]) ).
cnf(c_0_58,negated_conjecture,
~ theorem(implies(and(p,p),p)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_55]),c_0_56])]) ).
cnf(c_0_59,plain,
theorem(implies(and(X1,X2),X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_57]),c_0_19]) ).
cnf(c_0_60,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_58,c_0_59])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : LCL271-3 : TPTP v8.1.2. Released v2.3.0.
% 0.07/0.13 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n020.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % 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 11:55:46 EDT 2023
% 0.13/0.35 % CPUTime :
% 0.20/0.48 Running first-order model finding
% 0.20/0.48 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.dbH4ruCEQb/E---3.1_1799.p
% 0.20/0.55 # Version: 3.1pre001
% 0.20/0.55 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.20/0.55 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.55 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.20/0.55 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.55 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.55 # Starting sh5l with 300s (1) cores
% 0.20/0.55 # new_bool_3 with pid 1896 completed with status 0
% 0.20/0.55 # Result found by new_bool_3
% 0.20/0.55 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.20/0.55 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.55 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.20/0.55 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.55 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.55 # Search class: FHUSM-FFSF21-MFFFFFNN
% 0.20/0.55 # Scheduled 11 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.55 # Starting G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 28s (1) cores
% 0.20/0.55 # G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with pid 1899 completed with status 0
% 0.20/0.55 # Result found by G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.20/0.55 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.20/0.55 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.55 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.20/0.55 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.55 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.55 # Search class: FHUSM-FFSF21-MFFFFFNN
% 0.20/0.55 # Scheduled 11 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.55 # Starting G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 28s (1) cores
% 0.20/0.55 # Preprocessing time : 0.001 s
% 0.20/0.55 # Presaturation interreduction done
% 0.20/0.55
% 0.20/0.55 # Proof found!
% 0.20/0.55 # SZS status Unsatisfiable
% 0.20/0.55 # SZS output start CNFRefutation
% See solution above
% 0.20/0.55 # Parsed axioms : 11
% 0.20/0.55 # Removed by relevancy pruning/SinE : 0
% 0.20/0.55 # Initial clauses : 11
% 0.20/0.55 # Removed in clause preprocessing : 0
% 0.20/0.55 # Initial clauses in saturation : 11
% 0.20/0.55 # Processed clauses : 827
% 0.20/0.55 # ...of these trivial : 31
% 0.20/0.55 # ...subsumed : 527
% 0.20/0.55 # ...remaining for further processing : 269
% 0.20/0.55 # Other redundant clauses eliminated : 0
% 0.20/0.55 # Clauses deleted for lack of memory : 0
% 0.20/0.55 # Backward-subsumed : 12
% 0.20/0.55 # Backward-rewritten : 15
% 0.20/0.55 # Generated clauses : 3521
% 0.20/0.55 # ...of the previous two non-redundant : 3122
% 0.20/0.55 # ...aggressively subsumed : 0
% 0.20/0.55 # Contextual simplify-reflections : 0
% 0.20/0.55 # Paramodulations : 3521
% 0.20/0.55 # Factorizations : 0
% 0.20/0.55 # NegExts : 0
% 0.20/0.55 # Equation resolutions : 0
% 0.20/0.55 # Total rewrite steps : 881
% 0.20/0.55 # Propositional unsat checks : 0
% 0.20/0.55 # Propositional check models : 0
% 0.20/0.55 # Propositional check unsatisfiable : 0
% 0.20/0.55 # Propositional clauses : 0
% 0.20/0.55 # Propositional clauses after purity: 0
% 0.20/0.55 # Propositional unsat core size : 0
% 0.20/0.55 # Propositional preprocessing time : 0.000
% 0.20/0.55 # Propositional encoding time : 0.000
% 0.20/0.55 # Propositional solver time : 0.000
% 0.20/0.55 # Success case prop preproc time : 0.000
% 0.20/0.55 # Success case prop encoding time : 0.000
% 0.20/0.55 # Success case prop solver time : 0.000
% 0.20/0.55 # Current number of processed clauses : 231
% 0.20/0.55 # Positive orientable unit clauses : 85
% 0.20/0.55 # Positive unorientable unit clauses: 0
% 0.20/0.55 # Negative unit clauses : 4
% 0.20/0.55 # Non-unit-clauses : 142
% 0.20/0.55 # Current number of unprocessed clauses: 2100
% 0.20/0.55 # ...number of literals in the above : 4312
% 0.20/0.55 # Current number of archived formulas : 0
% 0.20/0.55 # Current number of archived clauses : 38
% 0.20/0.55 # Clause-clause subsumption calls (NU) : 7657
% 0.20/0.55 # Rec. Clause-clause subsumption calls : 6598
% 0.20/0.55 # Non-unit clause-clause subsumptions : 539
% 0.20/0.55 # Unit Clause-clause subsumption calls : 84
% 0.20/0.55 # Rewrite failures with RHS unbound : 0
% 0.20/0.55 # BW rewrite match attempts : 256
% 0.20/0.55 # BW rewrite match successes : 15
% 0.20/0.55 # Condensation attempts : 0
% 0.20/0.55 # Condensation successes : 0
% 0.20/0.55 # Termbank termtop insertions : 39496
% 0.20/0.55
% 0.20/0.55 # -------------------------------------------------
% 0.20/0.55 # User time : 0.056 s
% 0.20/0.55 # System time : 0.008 s
% 0.20/0.55 # Total time : 0.064 s
% 0.20/0.55 # Maximum resident set size: 1648 pages
% 0.20/0.55
% 0.20/0.55 # -------------------------------------------------
% 0.20/0.55 # User time : 0.057 s
% 0.20/0.55 # System time : 0.010 s
% 0.20/0.55 # Total time : 0.067 s
% 0.20/0.55 # Maximum resident set size: 1680 pages
% 0.20/0.55 % E---3.1 exiting
%------------------------------------------------------------------------------