TSTP Solution File: SYN116-10 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : SYN116-10 : TPTP v8.1.2. Released v7.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n016.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 10:19:22 EDT 2024
% Result : Unsatisfiable 0.88s 0.60s
% Output : CNFRefutation 0.88s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 16
% Syntax : Number of clauses : 46 ( 46 unt; 0 nHn; 13 RR)
% Number of literals : 46 ( 45 equ; 3 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 20 ( 20 usr; 5 con; 0-4 aty)
% Number of variables : 67 ( 29 sgn)
% Comments :
%------------------------------------------------------------------------------
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/sandbox/tmp/tmp.UPz7kiT6xF/E---3.1_9183.p',rule_107) ).
cnf(axiom_19,axiom,
m0(X1,d,X2) = true,
file('/export/starexec/sandbox/tmp/tmp.UPz7kiT6xF/E---3.1_9183.p',axiom_19) ).
cnf(ifeq_axiom,axiom,
ifeq(X1,X1,X2,X3) = X2,
file('/export/starexec/sandbox/tmp/tmp.UPz7kiT6xF/E---3.1_9183.p',ifeq_axiom) ).
cnf(rule_129,axiom,
ifeq(q1(X1,X2,X2),true,k2(X2,X2),true) = true,
file('/export/starexec/sandbox/tmp/tmp.UPz7kiT6xF/E---3.1_9183.p',rule_129) ).
cnf(rule_029,axiom,
ifeq(p0(X1,X2),true,ifeq(s0(X1),true,m1(X1,X2,X1),true),true) = true,
file('/export/starexec/sandbox/tmp/tmp.UPz7kiT6xF/E---3.1_9183.p',rule_029) ).
cnf(axiom_5,axiom,
s0(b) = true,
file('/export/starexec/sandbox/tmp/tmp.UPz7kiT6xF/E---3.1_9183.p',axiom_5) ).
cnf(axiom_14,axiom,
p0(b,X1) = true,
file('/export/starexec/sandbox/tmp/tmp.UPz7kiT6xF/E---3.1_9183.p',axiom_14) ).
cnf(rule_252,axiom,
ifeq(k2(X1,X1),true,ifeq(q0(X2,X3),true,p3(X3,X3,X3),true),true) = true,
file('/export/starexec/sandbox/tmp/tmp.UPz7kiT6xF/E---3.1_9183.p',rule_252) ).
cnf(rule_176,axiom,
ifeq(m1(X1,X2,X1),true,p2(X2,X1,X2),true) = true,
file('/export/starexec/sandbox/tmp/tmp.UPz7kiT6xF/E---3.1_9183.p',rule_176) ).
cnf(axiom_6,axiom,
q0(b,b) = true,
file('/export/starexec/sandbox/tmp/tmp.UPz7kiT6xF/E---3.1_9183.p',axiom_6) ).
cnf(rule_267,axiom,
ifeq(p2(X1,X2,X3),true,r3(X1,X3,X1),true) = true,
file('/export/starexec/sandbox/tmp/tmp.UPz7kiT6xF/E---3.1_9183.p',rule_267) ).
cnf(rule_299,axiom,
ifeq(p3(X1,X2,X3),true,ifeq(l1(X4,X2),true,s4(X4),true),true) = true,
file('/export/starexec/sandbox/tmp/tmp.UPz7kiT6xF/E---3.1_9183.p',rule_299) ).
cnf(rule_002,axiom,
ifeq(n0(X1,X2),true,l1(X2,X2),true) = true,
file('/export/starexec/sandbox/tmp/tmp.UPz7kiT6xF/E---3.1_9183.p',rule_002) ).
cnf(axiom_15,axiom,
n0(a,b) = true,
file('/export/starexec/sandbox/tmp/tmp.UPz7kiT6xF/E---3.1_9183.p',axiom_15) ).
cnf(rule_300,axiom,
ifeq(s4(X1),true,ifeq(r3(X2,X3,X3),true,k5(X3),true),true) = true,
file('/export/starexec/sandbox/tmp/tmp.UPz7kiT6xF/E---3.1_9183.p',rule_300) ).
cnf(prove_this,negated_conjecture,
k5(b) != true,
file('/export/starexec/sandbox/tmp/tmp.UPz7kiT6xF/E---3.1_9183.p',prove_this) ).
cnf(c_0_16,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_17,axiom,
m0(X1,d,X2) = true,
axiom_19 ).
cnf(c_0_18,axiom,
ifeq(X1,X1,X2,X3) = X2,
ifeq_axiom ).
cnf(c_0_19,axiom,
ifeq(q1(X1,X2,X2),true,k2(X2,X2),true) = true,
rule_129 ).
cnf(c_0_20,plain,
q1(e,X1,X1) = true,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_16,c_0_17]),c_0_17]),c_0_18]),c_0_18]) ).
cnf(c_0_21,axiom,
ifeq(p0(X1,X2),true,ifeq(s0(X1),true,m1(X1,X2,X1),true),true) = true,
rule_029 ).
cnf(c_0_22,axiom,
s0(b) = true,
axiom_5 ).
cnf(c_0_23,axiom,
p0(b,X1) = true,
axiom_14 ).
cnf(c_0_24,axiom,
ifeq(k2(X1,X1),true,ifeq(q0(X2,X3),true,p3(X3,X3,X3),true),true) = true,
rule_252 ).
cnf(c_0_25,plain,
k2(X1,X1) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_18]) ).
cnf(c_0_26,axiom,
ifeq(m1(X1,X2,X1),true,p2(X2,X1,X2),true) = true,
rule_176 ).
cnf(c_0_27,plain,
m1(b,X1,b) = true,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_23]),c_0_18]),c_0_18]) ).
cnf(c_0_28,plain,
ifeq(q0(X1,X2),true,p3(X2,X2,X2),true) = true,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_24,c_0_25]),c_0_18]) ).
cnf(c_0_29,axiom,
q0(b,b) = true,
axiom_6 ).
cnf(c_0_30,axiom,
ifeq(p2(X1,X2,X3),true,r3(X1,X3,X1),true) = true,
rule_267 ).
cnf(c_0_31,plain,
p2(X1,b,X1) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_18]) ).
cnf(c_0_32,axiom,
ifeq(p3(X1,X2,X3),true,ifeq(l1(X4,X2),true,s4(X4),true),true) = true,
rule_299 ).
cnf(c_0_33,plain,
p3(b,b,b) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_18]) ).
cnf(c_0_34,axiom,
ifeq(n0(X1,X2),true,l1(X2,X2),true) = true,
rule_002 ).
cnf(c_0_35,axiom,
n0(a,b) = true,
axiom_15 ).
cnf(c_0_36,axiom,
ifeq(s4(X1),true,ifeq(r3(X2,X3,X3),true,k5(X3),true),true) = true,
rule_300 ).
cnf(c_0_37,plain,
r3(X1,X1,X1) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_18]) ).
cnf(c_0_38,plain,
ifeq(l1(X1,b),true,s4(X1),true) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_18]) ).
cnf(c_0_39,plain,
l1(b,b) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_18]) ).
cnf(c_0_40,negated_conjecture,
k5(b) != true,
inference(fof_simplification,[status(thm)],[prove_this]) ).
cnf(c_0_41,plain,
ifeq(s4(X1),true,k5(X2),true) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_18]) ).
cnf(c_0_42,plain,
s4(b) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_18]) ).
cnf(c_0_43,negated_conjecture,
k5(b) != true,
c_0_40 ).
cnf(c_0_44,plain,
k5(X1) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_42]),c_0_18]) ).
cnf(c_0_45,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_43,c_0_44])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SYN116-10 : TPTP v8.1.2. Released v7.5.0.
% 0.12/0.13 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n016.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.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Fri May 3 11:15:30 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.20/0.50 Running first-order model finding
% 0.20/0.50 Running: /export/starexec/sandbox/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/sandbox/tmp/tmp.UPz7kiT6xF/E---3.1_9183.p
% 0.88/0.60 # Version: 3.1.0
% 0.88/0.60 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.88/0.60 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.88/0.60 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.88/0.60 # Starting new_bool_3 with 300s (1) cores
% 0.88/0.60 # Starting new_bool_1 with 300s (1) cores
% 0.88/0.60 # Starting sh5l with 300s (1) cores
% 0.88/0.60 # new_bool_3 with pid 9261 completed with status 0
% 0.88/0.60 # Result found by new_bool_3
% 0.88/0.60 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.88/0.60 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.88/0.60 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.88/0.60 # Starting new_bool_3 with 300s (1) cores
% 0.88/0.60 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.88/0.60 # Search class: FUUPM-FFLM31-MFFFFFNN
% 0.88/0.60 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.88/0.60 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 0.88/0.60 # G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with pid 9269 completed with status 0
% 0.88/0.60 # Result found by G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.88/0.60 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.88/0.60 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.88/0.60 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.88/0.60 # Starting new_bool_3 with 300s (1) cores
% 0.88/0.60 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.88/0.60 # Search class: FUUPM-FFLM31-MFFFFFNN
% 0.88/0.60 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.88/0.60 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 0.88/0.60 # Preprocessing time : 0.005 s
% 0.88/0.60 # Presaturation interreduction done
% 0.88/0.60
% 0.88/0.60 # Proof found!
% 0.88/0.60 # SZS status Unsatisfiable
% 0.88/0.60 # SZS output start CNFRefutation
% See solution above
% 0.88/0.60 # Parsed axioms : 363
% 0.88/0.60 # Removed by relevancy pruning/SinE : 37
% 0.88/0.60 # Initial clauses : 326
% 0.88/0.60 # Removed in clause preprocessing : 0
% 0.88/0.60 # Initial clauses in saturation : 326
% 0.88/0.60 # Processed clauses : 1059
% 0.88/0.60 # ...of these trivial : 235
% 0.88/0.60 # ...subsumed : 0
% 0.88/0.60 # ...remaining for further processing : 824
% 0.88/0.60 # Other redundant clauses eliminated : 0
% 0.88/0.60 # Clauses deleted for lack of memory : 0
% 0.88/0.60 # Backward-subsumed : 0
% 0.88/0.60 # Backward-rewritten : 163
% 0.88/0.60 # Generated clauses : 2436
% 0.88/0.60 # ...of the previous two non-redundant : 1744
% 0.88/0.60 # ...aggressively subsumed : 0
% 0.88/0.60 # Contextual simplify-reflections : 0
% 0.88/0.60 # Paramodulations : 2436
% 0.88/0.60 # Factorizations : 0
% 0.88/0.60 # NegExts : 0
% 0.88/0.60 # Equation resolutions : 0
% 0.88/0.60 # Disequality decompositions : 0
% 0.88/0.60 # Total rewrite steps : 4303
% 0.88/0.60 # ...of those cached : 3009
% 0.88/0.60 # Propositional unsat checks : 0
% 0.88/0.60 # Propositional check models : 0
% 0.88/0.60 # Propositional check unsatisfiable : 0
% 0.88/0.60 # Propositional clauses : 0
% 0.88/0.60 # Propositional clauses after purity: 0
% 0.88/0.60 # Propositional unsat core size : 0
% 0.88/0.60 # Propositional preprocessing time : 0.000
% 0.88/0.60 # Propositional encoding time : 0.000
% 0.88/0.60 # Propositional solver time : 0.000
% 0.88/0.60 # Success case prop preproc time : 0.000
% 0.88/0.60 # Success case prop encoding time : 0.000
% 0.88/0.60 # Success case prop solver time : 0.000
% 0.88/0.60 # Current number of processed clauses : 353
% 0.88/0.60 # Positive orientable unit clauses : 353
% 0.88/0.60 # Positive unorientable unit clauses: 0
% 0.88/0.60 # Negative unit clauses : 0
% 0.88/0.60 # Non-unit-clauses : 0
% 0.88/0.60 # Current number of unprocessed clauses: 1124
% 0.88/0.60 # ...number of literals in the above : 1124
% 0.88/0.60 # Current number of archived formulas : 0
% 0.88/0.60 # Current number of archived clauses : 471
% 0.88/0.60 # Clause-clause subsumption calls (NU) : 0
% 0.88/0.60 # Rec. Clause-clause subsumption calls : 0
% 0.88/0.60 # Non-unit clause-clause subsumptions : 0
% 0.88/0.60 # Unit Clause-clause subsumption calls : 0
% 0.88/0.60 # Rewrite failures with RHS unbound : 0
% 0.88/0.60 # BW rewrite match attempts : 2880
% 0.88/0.60 # BW rewrite match successes : 140
% 0.88/0.60 # Condensation attempts : 0
% 0.88/0.60 # Condensation successes : 0
% 0.88/0.60 # Termbank termtop insertions : 50663
% 0.88/0.60 # Search garbage collected termcells : 172
% 0.88/0.60
% 0.88/0.60 # -------------------------------------------------
% 0.88/0.60 # User time : 0.072 s
% 0.88/0.60 # System time : 0.009 s
% 0.88/0.60 # Total time : 0.080 s
% 0.88/0.60 # Maximum resident set size: 2280 pages
% 0.88/0.60
% 0.88/0.60 # -------------------------------------------------
% 0.88/0.60 # User time : 0.077 s
% 0.88/0.60 # System time : 0.013 s
% 0.88/0.60 # Total time : 0.090 s
% 0.88/0.60 # Maximum resident set size: 1988 pages
% 0.88/0.60 % E---3.1 exiting
%------------------------------------------------------------------------------