TSTP Solution File: SYN214-1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SYN214-1 : TPTP v8.1.2. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n006.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 20:14:07 EDT 2023
% Result : Unsatisfiable 0.70s 0.59s
% Output : CNFRefutation 0.70s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 23
% Syntax : Number of clauses : 74 ( 30 unt; 0 nHn; 52 RR)
% Number of literals : 151 ( 0 equ; 79 neg)
% Maximal clause size : 4 ( 2 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 19 ( 18 usr; 1 prp; 0-3 aty)
% Number of functors : 4 ( 4 usr; 4 con; 0-0 aty)
% Number of variables : 110 ( 53 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(rule_126,axiom,
( s1(X1)
| ~ q0(X1,X2)
| ~ s1(X3) ),
file('/export/starexec/sandbox2/tmp/tmp.7ubTACoJf8/E---3.1_30161.p',rule_126) ).
cnf(axiom_17,axiom,
q0(X1,d),
file('/export/starexec/sandbox2/tmp/tmp.7ubTACoJf8/E---3.1_30161.p',axiom_17) ).
cnf(rule_125,axiom,
( s1(X1)
| ~ p0(X1,X1) ),
file('/export/starexec/sandbox2/tmp/tmp.7ubTACoJf8/E---3.1_30161.p',rule_125) ).
cnf(axiom_14,axiom,
p0(b,X1),
file('/export/starexec/sandbox2/tmp/tmp.7ubTACoJf8/E---3.1_30161.p',axiom_14) ).
cnf(rule_107,axiom,
( q1(e,X1,X1)
| ~ m0(X1,d,X1)
| ~ m0(e,d,X1) ),
file('/export/starexec/sandbox2/tmp/tmp.7ubTACoJf8/E---3.1_30161.p',rule_107) ).
cnf(axiom_19,axiom,
m0(X1,d,X2),
file('/export/starexec/sandbox2/tmp/tmp.7ubTACoJf8/E---3.1_30161.p',axiom_19) ).
cnf(rule_154,axiom,
( p2(X1,X1,X1)
| ~ q1(X1,X1,X1) ),
file('/export/starexec/sandbox2/tmp/tmp.7ubTACoJf8/E---3.1_30161.p',rule_154) ).
cnf(rule_133,axiom,
( l2(X1,X1)
| ~ p0(X2,X2)
| ~ s1(X3)
| ~ m0(X4,X3,X1) ),
file('/export/starexec/sandbox2/tmp/tmp.7ubTACoJf8/E---3.1_30161.p',rule_133) ).
cnf(rule_165,axiom,
( p2(X1,X1,X1)
| ~ q1(X2,X3,X2)
| ~ p2(X2,X2,X3) ),
file('/export/starexec/sandbox2/tmp/tmp.7ubTACoJf8/E---3.1_30161.p',rule_165) ).
cnf(axiom_27,axiom,
m0(e,b,c),
file('/export/starexec/sandbox2/tmp/tmp.7ubTACoJf8/E---3.1_30161.p',axiom_27) ).
cnf(rule_240,axiom,
( n3(X1)
| ~ p2(X2,X3,X1) ),
file('/export/starexec/sandbox2/tmp/tmp.7ubTACoJf8/E---3.1_30161.p',rule_240) ).
cnf(rule_258,axiom,
( q3(X1,X1)
| ~ r2(X1)
| ~ s1(X2)
| ~ l2(X3,X3) ),
file('/export/starexec/sandbox2/tmp/tmp.7ubTACoJf8/E---3.1_30161.p',rule_258) ).
cnf(rule_298,axiom,
( r4(X1)
| ~ n3(X1)
| ~ q3(X2,X3)
| ~ p0(X4,X1) ),
file('/export/starexec/sandbox2/tmp/tmp.7ubTACoJf8/E---3.1_30161.p',rule_298) ).
cnf(rule_124,axiom,
( r1(X1)
| ~ q0(X1,X2)
| ~ s0(d)
| ~ q1(d,X2,d) ),
file('/export/starexec/sandbox2/tmp/tmp.7ubTACoJf8/E---3.1_30161.p',rule_124) ).
cnf(axiom_1,axiom,
s0(d),
file('/export/starexec/sandbox2/tmp/tmp.7ubTACoJf8/E---3.1_30161.p',axiom_1) ).
cnf(rule_117,axiom,
( q1(d,d,d)
| ~ k0(e)
| ~ s0(d) ),
file('/export/starexec/sandbox2/tmp/tmp.7ubTACoJf8/E---3.1_30161.p',rule_117) ).
cnf(axiom_28,axiom,
k0(e),
file('/export/starexec/sandbox2/tmp/tmp.7ubTACoJf8/E---3.1_30161.p',axiom_28) ).
cnf(rule_277,axiom,
( l4(X1)
| ~ p3(X2,X3,X1) ),
file('/export/starexec/sandbox2/tmp/tmp.7ubTACoJf8/E---3.1_30161.p',rule_277) ).
cnf(rule_246,axiom,
( p3(X1,X1,X1)
| ~ l2(X1,X1) ),
file('/export/starexec/sandbox2/tmp/tmp.7ubTACoJf8/E---3.1_30161.p',rule_246) ).
cnf(rule_188,axiom,
( r2(X1)
| ~ r1(X1)
| ~ l0(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.7ubTACoJf8/E---3.1_30161.p',rule_188) ).
cnf(rule_329,axiom,
( s5(X1)
| ~ l4(X1)
| ~ r4(X2) ),
file('/export/starexec/sandbox2/tmp/tmp.7ubTACoJf8/E---3.1_30161.p',rule_329) ).
cnf(axiom_24,axiom,
l0(c),
file('/export/starexec/sandbox2/tmp/tmp.7ubTACoJf8/E---3.1_30161.p',axiom_24) ).
cnf(prove_this,negated_conjecture,
~ s5(c),
file('/export/starexec/sandbox2/tmp/tmp.7ubTACoJf8/E---3.1_30161.p',prove_this) ).
cnf(c_0_23,axiom,
( s1(X1)
| ~ q0(X1,X2)
| ~ s1(X3) ),
rule_126 ).
cnf(c_0_24,axiom,
q0(X1,d),
axiom_17 ).
cnf(c_0_25,axiom,
( s1(X1)
| ~ p0(X1,X1) ),
rule_125 ).
cnf(c_0_26,axiom,
p0(b,X1),
axiom_14 ).
cnf(c_0_27,axiom,
( q1(e,X1,X1)
| ~ m0(X1,d,X1)
| ~ m0(e,d,X1) ),
rule_107 ).
cnf(c_0_28,axiom,
m0(X1,d,X2),
axiom_19 ).
cnf(c_0_29,plain,
( s1(X1)
| ~ s1(X2) ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_30,plain,
s1(b),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_31,axiom,
( p2(X1,X1,X1)
| ~ q1(X1,X1,X1) ),
rule_154 ).
cnf(c_0_32,plain,
q1(e,X1,X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_27,c_0_28]),c_0_28])]) ).
cnf(c_0_33,axiom,
( l2(X1,X1)
| ~ p0(X2,X2)
| ~ s1(X3)
| ~ m0(X4,X3,X1) ),
rule_133 ).
cnf(c_0_34,plain,
s1(X1),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_35,axiom,
( p2(X1,X1,X1)
| ~ q1(X2,X3,X2)
| ~ p2(X2,X2,X3) ),
rule_165 ).
cnf(c_0_36,plain,
p2(e,e,e),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_37,plain,
( l2(X1,X1)
| ~ p0(X2,X2)
| ~ m0(X3,X4,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_33,c_0_34])]) ).
cnf(c_0_38,axiom,
m0(e,b,c),
axiom_27 ).
cnf(c_0_39,axiom,
( n3(X1)
| ~ p2(X2,X3,X1) ),
rule_240 ).
cnf(c_0_40,plain,
p2(X1,X1,X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_32]),c_0_36])]) ).
cnf(c_0_41,axiom,
( q3(X1,X1)
| ~ r2(X1)
| ~ s1(X2)
| ~ l2(X3,X3) ),
rule_258 ).
cnf(c_0_42,plain,
( l2(c,c)
| ~ p0(X1,X1) ),
inference(spm,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_43,axiom,
( r4(X1)
| ~ n3(X1)
| ~ q3(X2,X3)
| ~ p0(X4,X1) ),
rule_298 ).
cnf(c_0_44,plain,
n3(X1),
inference(spm,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_45,plain,
( q3(X1,X1)
| ~ r2(X1)
| ~ l2(X2,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_41,c_0_34])]) ).
cnf(c_0_46,plain,
l2(c,c),
inference(spm,[status(thm)],[c_0_42,c_0_26]) ).
cnf(c_0_47,axiom,
( r1(X1)
| ~ q0(X1,X2)
| ~ s0(d)
| ~ q1(d,X2,d) ),
rule_124 ).
cnf(c_0_48,axiom,
s0(d),
axiom_1 ).
cnf(c_0_49,axiom,
( q1(d,d,d)
| ~ k0(e)
| ~ s0(d) ),
rule_117 ).
cnf(c_0_50,axiom,
k0(e),
axiom_28 ).
cnf(c_0_51,plain,
( r4(X1)
| ~ q3(X2,X3)
| ~ p0(X4,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_43,c_0_44])]) ).
cnf(c_0_52,plain,
( q3(X1,X1)
| ~ r2(X1) ),
inference(spm,[status(thm)],[c_0_45,c_0_46]) ).
cnf(c_0_53,plain,
( r1(X1)
| ~ q1(d,X2,d)
| ~ q0(X1,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_47,c_0_48])]) ).
cnf(c_0_54,plain,
q1(d,d,d),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_49,c_0_48]),c_0_50])]) ).
cnf(c_0_55,axiom,
( l4(X1)
| ~ p3(X2,X3,X1) ),
rule_277 ).
cnf(c_0_56,axiom,
( p3(X1,X1,X1)
| ~ l2(X1,X1) ),
rule_246 ).
cnf(c_0_57,plain,
( l2(X1,X1)
| ~ p0(X2,X2) ),
inference(spm,[status(thm)],[c_0_37,c_0_28]) ).
cnf(c_0_58,plain,
( r4(X1)
| ~ r2(X2)
| ~ p0(X3,X1) ),
inference(spm,[status(thm)],[c_0_51,c_0_52]) ).
cnf(c_0_59,axiom,
( r2(X1)
| ~ r1(X1)
| ~ l0(X1) ),
rule_188 ).
cnf(c_0_60,plain,
r1(X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_24]),c_0_54])]) ).
cnf(c_0_61,plain,
( l4(X1)
| ~ l2(X1,X1) ),
inference(spm,[status(thm)],[c_0_55,c_0_56]) ).
cnf(c_0_62,plain,
l2(X1,X1),
inference(spm,[status(thm)],[c_0_57,c_0_26]) ).
cnf(c_0_63,plain,
( r4(X1)
| ~ r2(X2) ),
inference(spm,[status(thm)],[c_0_58,c_0_26]) ).
cnf(c_0_64,plain,
( r2(X1)
| ~ l0(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_59,c_0_60])]) ).
cnf(c_0_65,axiom,
( s5(X1)
| ~ l4(X1)
| ~ r4(X2) ),
rule_329 ).
cnf(c_0_66,plain,
l4(X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_61,c_0_62])]) ).
cnf(c_0_67,plain,
( r4(X1)
| ~ l0(X2) ),
inference(spm,[status(thm)],[c_0_63,c_0_64]) ).
cnf(c_0_68,axiom,
l0(c),
axiom_24 ).
cnf(c_0_69,plain,
( s5(X1)
| ~ r4(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_65,c_0_66])]) ).
cnf(c_0_70,plain,
r4(X1),
inference(spm,[status(thm)],[c_0_67,c_0_68]) ).
cnf(c_0_71,negated_conjecture,
~ s5(c),
prove_this ).
cnf(c_0_72,plain,
s5(X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_69,c_0_70])]) ).
cnf(c_0_73,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_71,c_0_72])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.14 % Problem : SYN214-1 : TPTP v8.1.2. Released v1.1.0.
% 0.10/0.15 % Command : run_E %s %d THM
% 0.16/0.36 % Computer : n006.cluster.edu
% 0.16/0.36 % Model : x86_64 x86_64
% 0.16/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.36 % Memory : 8042.1875MB
% 0.16/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.36 % CPULimit : 2400
% 0.16/0.36 % WCLimit : 300
% 0.16/0.36 % DateTime : Mon Oct 2 18:00:40 EDT 2023
% 0.16/0.36 % CPUTime :
% 0.22/0.51 Running first-order theorem proving
% 0.22/0.51 Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/tmp/tmp.7ubTACoJf8/E---3.1_30161.p
% 0.70/0.59 # Version: 3.1pre001
% 0.70/0.59 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.70/0.59 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.70/0.59 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.70/0.59 # Starting new_bool_3 with 300s (1) cores
% 0.70/0.59 # Starting new_bool_1 with 300s (1) cores
% 0.70/0.59 # Starting sh5l with 300s (1) cores
% 0.70/0.59 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 30243 completed with status 0
% 0.70/0.59 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.70/0.59 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.70/0.59 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.70/0.59 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.70/0.59 # No SInE strategy applied
% 0.70/0.59 # Search class: FHUNM-FSLM00-SFFFFFNN
% 0.70/0.59 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.70/0.59 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.70/0.59 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.70/0.59 # Starting new_bool_3 with 136s (1) cores
% 0.70/0.59 # Starting new_bool_1 with 136s (1) cores
% 0.70/0.59 # Starting sh5l with 136s (1) cores
% 0.70/0.59 # SAT001_MinMin_p005000_rr_RG with pid 30248 completed with status 0
% 0.70/0.59 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.70/0.59 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.70/0.59 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.70/0.59 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.70/0.59 # No SInE strategy applied
% 0.70/0.59 # Search class: FHUNM-FSLM00-SFFFFFNN
% 0.70/0.59 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.70/0.59 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.70/0.59 # Preprocessing time : 0.004 s
% 0.70/0.59 # Presaturation interreduction done
% 0.70/0.59
% 0.70/0.59 # Proof found!
% 0.70/0.59 # SZS status Unsatisfiable
% 0.70/0.59 # SZS output start CNFRefutation
% See solution above
% 0.70/0.59 # Parsed axioms : 369
% 0.70/0.59 # Removed by relevancy pruning/SinE : 0
% 0.70/0.59 # Initial clauses : 369
% 0.70/0.59 # Removed in clause preprocessing : 7
% 0.70/0.59 # Initial clauses in saturation : 362
% 0.70/0.59 # Processed clauses : 1025
% 0.70/0.59 # ...of these trivial : 47
% 0.70/0.59 # ...subsumed : 45
% 0.70/0.59 # ...remaining for further processing : 933
% 0.70/0.59 # Other redundant clauses eliminated : 0
% 0.70/0.59 # Clauses deleted for lack of memory : 0
% 0.70/0.59 # Backward-subsumed : 46
% 0.70/0.59 # Backward-rewritten : 252
% 0.70/0.59 # Generated clauses : 1240
% 0.70/0.59 # ...of the previous two non-redundant : 921
% 0.70/0.59 # ...aggressively subsumed : 0
% 0.70/0.59 # Contextual simplify-reflections : 2
% 0.70/0.59 # Paramodulations : 1240
% 0.70/0.59 # Factorizations : 0
% 0.70/0.59 # NegExts : 0
% 0.70/0.59 # Equation resolutions : 0
% 0.70/0.59 # Total rewrite steps : 888
% 0.70/0.59 # Propositional unsat checks : 0
% 0.70/0.59 # Propositional check models : 0
% 0.70/0.59 # Propositional check unsatisfiable : 0
% 0.70/0.59 # Propositional clauses : 0
% 0.70/0.59 # Propositional clauses after purity: 0
% 0.70/0.59 # Propositional unsat core size : 0
% 0.70/0.59 # Propositional preprocessing time : 0.000
% 0.70/0.59 # Propositional encoding time : 0.000
% 0.70/0.59 # Propositional solver time : 0.000
% 0.70/0.59 # Success case prop preproc time : 0.000
% 0.70/0.59 # Success case prop encoding time : 0.000
% 0.70/0.59 # Success case prop solver time : 0.000
% 0.70/0.59 # Current number of processed clauses : 307
% 0.70/0.59 # Positive orientable unit clauses : 129
% 0.70/0.59 # Positive unorientable unit clauses: 0
% 0.70/0.59 # Negative unit clauses : 0
% 0.70/0.59 # Non-unit-clauses : 178
% 0.70/0.59 # Current number of unprocessed clauses: 487
% 0.70/0.59 # ...number of literals in the above : 1353
% 0.70/0.59 # Current number of archived formulas : 0
% 0.70/0.59 # Current number of archived clauses : 626
% 0.70/0.59 # Clause-clause subsumption calls (NU) : 52020
% 0.70/0.59 # Rec. Clause-clause subsumption calls : 36775
% 0.70/0.59 # Non-unit clause-clause subsumptions : 78
% 0.70/0.59 # Unit Clause-clause subsumption calls : 3911
% 0.70/0.59 # Rewrite failures with RHS unbound : 0
% 0.70/0.59 # BW rewrite match attempts : 420
% 0.70/0.59 # BW rewrite match successes : 155
% 0.70/0.59 # Condensation attempts : 0
% 0.70/0.59 # Condensation successes : 0
% 0.70/0.59 # Termbank termtop insertions : 23151
% 0.70/0.59
% 0.70/0.59 # -------------------------------------------------
% 0.70/0.59 # User time : 0.061 s
% 0.70/0.59 # System time : 0.005 s
% 0.70/0.59 # Total time : 0.066 s
% 0.70/0.59 # Maximum resident set size: 2484 pages
% 0.70/0.59
% 0.70/0.59 # -------------------------------------------------
% 0.70/0.59 # User time : 0.259 s
% 0.70/0.59 # System time : 0.013 s
% 0.70/0.59 # Total time : 0.273 s
% 0.70/0.59 # Maximum resident set size: 1996 pages
% 0.70/0.59 % E---3.1 exiting
% 0.70/0.60 % E---3.1 exiting
%------------------------------------------------------------------------------