TSTP Solution File: SYN214-10 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SYN214-10 : TPTP v8.1.2. Released v7.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n005.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.66s 0.64s
% Output : CNFRefutation 0.66s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 18
% Syntax : Number of clauses : 54 ( 54 unt; 0 nHn; 18 RR)
% Number of literals : 54 ( 53 equ; 2 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 21 ( 21 usr; 6 con; 0-4 aty)
% Number of variables : 76 ( 34 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(rule_001,axiom,
ifeq(n0(X1,X2),true,k1(X2),true) = true,
file('/export/starexec/sandbox2/tmp/tmp.4QusVKnWyf/E---3.1_23664.p',rule_001) ).
cnf(axiom_30,axiom,
n0(e,e) = true,
file('/export/starexec/sandbox2/tmp/tmp.4QusVKnWyf/E---3.1_23664.p',axiom_30) ).
cnf(ifeq_axiom,axiom,
ifeq(X1,X1,X2,X3) = X2,
file('/export/starexec/sandbox2/tmp/tmp.4QusVKnWyf/E---3.1_23664.p',ifeq_axiom) ).
cnf(rule_107,axiom,
ifeq(m0(e,d,X1),true,ifeq(m0(X1,d,X1),true,q1(e,X1,X1),true),true) = true,
file('/export/starexec/sandbox2/tmp/tmp.4QusVKnWyf/E---3.1_23664.p',rule_107) ).
cnf(axiom_19,axiom,
m0(X1,d,X2) = true,
file('/export/starexec/sandbox2/tmp/tmp.4QusVKnWyf/E---3.1_23664.p',axiom_19) ).
cnf(rule_159,axiom,
ifeq(k1(X1),true,p2(X1,X1,X1),true) = true,
file('/export/starexec/sandbox2/tmp/tmp.4QusVKnWyf/E---3.1_23664.p',rule_159) ).
cnf(axiom_15,axiom,
n0(a,b) = true,
file('/export/starexec/sandbox2/tmp/tmp.4QusVKnWyf/E---3.1_23664.p',axiom_15) ).
cnf(rule_165,axiom,
ifeq(p2(X1,X1,X2),true,ifeq(q1(X1,X2,X1),true,p2(X3,X3,X3),true),true) = true,
file('/export/starexec/sandbox2/tmp/tmp.4QusVKnWyf/E---3.1_23664.p',rule_165) ).
cnf(rule_002,axiom,
ifeq(n0(X1,X2),true,l1(X2,X2),true) = true,
file('/export/starexec/sandbox2/tmp/tmp.4QusVKnWyf/E---3.1_23664.p',rule_002) ).
cnf(rule_240,axiom,
ifeq(p2(X1,X2,X3),true,n3(X3),true) = true,
file('/export/starexec/sandbox2/tmp/tmp.4QusVKnWyf/E---3.1_23664.p',rule_240) ).
cnf(rule_186,axiom,
ifeq(l1(X1,X2),true,q2(X2,X2,X1),true) = true,
file('/export/starexec/sandbox2/tmp/tmp.4QusVKnWyf/E---3.1_23664.p',rule_186) ).
cnf(rule_248,axiom,
ifeq(n3(X1),true,ifeq(p2(X2,X1,X1),true,p3(X1,X1,X1),true),true) = true,
file('/export/starexec/sandbox2/tmp/tmp.4QusVKnWyf/E---3.1_23664.p',rule_248) ).
cnf(rule_298,axiom,
ifeq(q3(X1,X2),true,ifeq(n3(X3),true,ifeq(p0(X4,X3),true,r4(X3),true),true),true) = true,
file('/export/starexec/sandbox2/tmp/tmp.4QusVKnWyf/E---3.1_23664.p',rule_298) ).
cnf(axiom_18,axiom,
p0(c,b) = true,
file('/export/starexec/sandbox2/tmp/tmp.4QusVKnWyf/E---3.1_23664.p',axiom_18) ).
cnf(rule_255,axiom,
ifeq(q2(X1,X2,X3),true,ifeq(n0(X1,X2),true,q3(X2,X3),true),true) = true,
file('/export/starexec/sandbox2/tmp/tmp.4QusVKnWyf/E---3.1_23664.p',rule_255) ).
cnf(rule_277,axiom,
ifeq(p3(X1,X2,X3),true,l4(X3),true) = true,
file('/export/starexec/sandbox2/tmp/tmp.4QusVKnWyf/E---3.1_23664.p',rule_277) ).
cnf(rule_329,axiom,
ifeq(r4(X1),true,ifeq(l4(X2),true,s5(X2),true),true) = true,
file('/export/starexec/sandbox2/tmp/tmp.4QusVKnWyf/E---3.1_23664.p',rule_329) ).
cnf(prove_this,negated_conjecture,
s5(c) != true,
file('/export/starexec/sandbox2/tmp/tmp.4QusVKnWyf/E---3.1_23664.p',prove_this) ).
cnf(c_0_18,axiom,
ifeq(n0(X1,X2),true,k1(X2),true) = true,
rule_001 ).
cnf(c_0_19,axiom,
n0(e,e) = true,
axiom_30 ).
cnf(c_0_20,axiom,
ifeq(X1,X1,X2,X3) = X2,
ifeq_axiom ).
cnf(c_0_21,axiom,
ifeq(m0(e,d,X1),true,ifeq(m0(X1,d,X1),true,q1(e,X1,X1),true),true) = true,
rule_107 ).
cnf(c_0_22,axiom,
m0(X1,d,X2) = true,
axiom_19 ).
cnf(c_0_23,axiom,
ifeq(k1(X1),true,p2(X1,X1,X1),true) = true,
rule_159 ).
cnf(c_0_24,plain,
k1(e) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20]) ).
cnf(c_0_25,axiom,
n0(a,b) = true,
axiom_15 ).
cnf(c_0_26,axiom,
ifeq(p2(X1,X1,X2),true,ifeq(q1(X1,X2,X1),true,p2(X3,X3,X3),true),true) = true,
rule_165 ).
cnf(c_0_27,plain,
q1(e,X1,X1) = true,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_21,c_0_22]),c_0_22]),c_0_20]),c_0_20]) ).
cnf(c_0_28,plain,
p2(e,e,e) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_20]) ).
cnf(c_0_29,plain,
k1(b) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_25]),c_0_20]) ).
cnf(c_0_30,axiom,
ifeq(n0(X1,X2),true,l1(X2,X2),true) = true,
rule_002 ).
cnf(c_0_31,axiom,
ifeq(p2(X1,X2,X3),true,n3(X3),true) = true,
rule_240 ).
cnf(c_0_32,plain,
p2(X1,X1,X1) = true,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_28]),c_0_20]),c_0_20]) ).
cnf(c_0_33,plain,
p2(b,b,b) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_29]),c_0_20]) ).
cnf(c_0_34,axiom,
ifeq(l1(X1,X2),true,q2(X2,X2,X1),true) = true,
rule_186 ).
cnf(c_0_35,plain,
l1(e,e) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_19]),c_0_20]) ).
cnf(c_0_36,axiom,
ifeq(n3(X1),true,ifeq(p2(X2,X1,X1),true,p3(X1,X1,X1),true),true) = true,
rule_248 ).
cnf(c_0_37,plain,
n3(X1) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_20]) ).
cnf(c_0_38,axiom,
ifeq(q3(X1,X2),true,ifeq(n3(X3),true,ifeq(p0(X4,X3),true,r4(X3),true),true),true) = true,
rule_298 ).
cnf(c_0_39,axiom,
p0(c,b) = true,
axiom_18 ).
cnf(c_0_40,plain,
n3(b) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_33]),c_0_20]) ).
cnf(c_0_41,axiom,
ifeq(q2(X1,X2,X3),true,ifeq(n0(X1,X2),true,q3(X2,X3),true),true) = true,
rule_255 ).
cnf(c_0_42,plain,
q2(e,e,e) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_20]) ).
cnf(c_0_43,plain,
ifeq(p2(X1,X2,X2),true,p3(X2,X2,X2),true) = true,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_36,c_0_37]),c_0_20]) ).
cnf(c_0_44,plain,
ifeq(q3(X1,X2),true,r4(b),true) = true,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_40]),c_0_20]),c_0_20]) ).
cnf(c_0_45,plain,
q3(e,e) = true,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_42]),c_0_19]),c_0_20]),c_0_20]) ).
cnf(c_0_46,axiom,
ifeq(p3(X1,X2,X3),true,l4(X3),true) = true,
rule_277 ).
cnf(c_0_47,plain,
p3(X1,X1,X1) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_32]),c_0_20]) ).
cnf(c_0_48,axiom,
ifeq(r4(X1),true,ifeq(l4(X2),true,s5(X2),true),true) = true,
rule_329 ).
cnf(c_0_49,plain,
r4(b) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_45]),c_0_20]) ).
cnf(c_0_50,plain,
l4(X1) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_47]),c_0_20]) ).
cnf(c_0_51,negated_conjecture,
s5(c) != true,
prove_this ).
cnf(c_0_52,plain,
s5(X1) = true,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_49]),c_0_50]),c_0_20]),c_0_20]) ).
cnf(c_0_53,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_51,c_0_52])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.15 % Problem : SYN214-10 : TPTP v8.1.2. Released v7.5.0.
% 0.07/0.16 % Command : run_E %s %d THM
% 0.16/0.38 % Computer : n005.cluster.edu
% 0.16/0.38 % Model : x86_64 x86_64
% 0.16/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.38 % Memory : 8042.1875MB
% 0.16/0.38 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.38 % CPULimit : 2400
% 0.16/0.38 % WCLimit : 300
% 0.16/0.38 % DateTime : Mon Oct 2 18:28:01 EDT 2023
% 0.16/0.38 % CPUTime :
% 0.23/0.56 Running first-order theorem proving
% 0.23/0.56 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.4QusVKnWyf/E---3.1_23664.p
% 0.66/0.64 # Version: 3.1pre001
% 0.66/0.64 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.66/0.64 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.66/0.64 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.66/0.64 # Starting new_bool_3 with 300s (1) cores
% 0.66/0.64 # Starting new_bool_1 with 300s (1) cores
% 0.66/0.64 # Starting sh5l with 300s (1) cores
% 0.66/0.64 # new_bool_3 with pid 23782 completed with status 0
% 0.66/0.64 # Result found by new_bool_3
% 0.66/0.64 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.66/0.64 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.66/0.64 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.66/0.64 # Starting new_bool_3 with 300s (1) cores
% 0.66/0.64 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.66/0.64 # Search class: FUUPM-FFLM31-MFFFFFNN
% 0.66/0.64 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.66/0.64 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 0.66/0.64 # G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with pid 23787 completed with status 0
% 0.66/0.64 # Result found by G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.66/0.64 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.66/0.64 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.66/0.64 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.66/0.64 # Starting new_bool_3 with 300s (1) cores
% 0.66/0.64 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.66/0.64 # Search class: FUUPM-FFLM31-MFFFFFNN
% 0.66/0.64 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.66/0.64 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 0.66/0.64 # Preprocessing time : 0.003 s
% 0.66/0.64 # Presaturation interreduction done
% 0.66/0.64
% 0.66/0.64 # Proof found!
% 0.66/0.64 # SZS status Unsatisfiable
% 0.66/0.64 # SZS output start CNFRefutation
% See solution above
% 0.66/0.64 # Parsed axioms : 363
% 0.66/0.64 # Removed by relevancy pruning/SinE : 53
% 0.66/0.64 # Initial clauses : 310
% 0.66/0.64 # Removed in clause preprocessing : 0
% 0.66/0.64 # Initial clauses in saturation : 310
% 0.66/0.64 # Processed clauses : 1101
% 0.66/0.64 # ...of these trivial : 254
% 0.66/0.64 # ...subsumed : 0
% 0.66/0.64 # ...remaining for further processing : 847
% 0.66/0.64 # Other redundant clauses eliminated : 0
% 0.66/0.64 # Clauses deleted for lack of memory : 0
% 0.66/0.64 # Backward-subsumed : 0
% 0.66/0.64 # Backward-rewritten : 225
% 0.66/0.64 # Generated clauses : 2600
% 0.66/0.64 # ...of the previous two non-redundant : 1939
% 0.66/0.64 # ...aggressively subsumed : 0
% 0.66/0.64 # Contextual simplify-reflections : 0
% 0.66/0.64 # Paramodulations : 2600
% 0.66/0.64 # Factorizations : 0
% 0.66/0.64 # NegExts : 0
% 0.66/0.64 # Equation resolutions : 0
% 0.66/0.64 # Total rewrite steps : 4499
% 0.66/0.64 # Propositional unsat checks : 0
% 0.66/0.64 # Propositional check models : 0
% 0.66/0.64 # Propositional check unsatisfiable : 0
% 0.66/0.64 # Propositional clauses : 0
% 0.66/0.64 # Propositional clauses after purity: 0
% 0.66/0.64 # Propositional unsat core size : 0
% 0.66/0.64 # Propositional preprocessing time : 0.000
% 0.66/0.64 # Propositional encoding time : 0.000
% 0.66/0.64 # Propositional solver time : 0.000
% 0.66/0.64 # Success case prop preproc time : 0.000
% 0.66/0.64 # Success case prop encoding time : 0.000
% 0.66/0.64 # Success case prop solver time : 0.000
% 0.66/0.64 # Current number of processed clauses : 330
% 0.66/0.64 # Positive orientable unit clauses : 330
% 0.66/0.64 # Positive unorientable unit clauses: 0
% 0.66/0.64 # Negative unit clauses : 0
% 0.66/0.64 # Non-unit-clauses : 0
% 0.66/0.64 # Current number of unprocessed clauses: 1175
% 0.66/0.64 # ...number of literals in the above : 1175
% 0.66/0.64 # Current number of archived formulas : 0
% 0.66/0.64 # Current number of archived clauses : 517
% 0.66/0.64 # Clause-clause subsumption calls (NU) : 0
% 0.66/0.64 # Rec. Clause-clause subsumption calls : 0
% 0.66/0.64 # Non-unit clause-clause subsumptions : 0
% 0.66/0.64 # Unit Clause-clause subsumption calls : 0
% 0.66/0.64 # Rewrite failures with RHS unbound : 0
% 0.66/0.64 # BW rewrite match attempts : 2828
% 0.66/0.64 # BW rewrite match successes : 199
% 0.66/0.64 # Condensation attempts : 0
% 0.66/0.64 # Condensation successes : 0
% 0.66/0.64 # Termbank termtop insertions : 53432
% 0.66/0.64
% 0.66/0.64 # -------------------------------------------------
% 0.66/0.64 # User time : 0.043 s
% 0.66/0.64 # System time : 0.010 s
% 0.66/0.64 # Total time : 0.053 s
% 0.66/0.64 # Maximum resident set size: 2220 pages
% 0.66/0.64
% 0.66/0.64 # -------------------------------------------------
% 0.66/0.64 # User time : 0.051 s
% 0.66/0.64 # System time : 0.013 s
% 0.66/0.64 # Total time : 0.064 s
% 0.66/0.64 # Maximum resident set size: 1976 pages
% 0.66/0.64 % E---3.1 exiting
% 0.66/0.64 % E---3.1 exiting
%------------------------------------------------------------------------------