TSTP Solution File: SYN160-1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SYN160-1 : TPTP v8.1.2. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n031.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:06:37 EDT 2024
% Result : Unsatisfiable 0.61s 0.59s
% Output : CNFRefutation 0.61s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 20
% Syntax : Number of clauses : 75 ( 28 unt; 0 nHn; 57 RR)
% Number of literals : 163 ( 0 equ; 91 neg)
% Maximal clause size : 4 ( 2 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 18 ( 17 usr; 1 prp; 0-3 aty)
% Number of functors : 4 ( 4 usr; 4 con; 0-0 aty)
% Number of variables : 119 ( 53 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(rule_126,axiom,
( s1(X1)
| ~ q0(X1,X2)
| ~ s1(X3) ),
file('/export/starexec/sandbox/tmp/tmp.U4L12hsAMc/E---3.1_30806.p',rule_126) ).
cnf(rule_125,axiom,
( s1(X1)
| ~ p0(X1,X1) ),
file('/export/starexec/sandbox/tmp/tmp.U4L12hsAMc/E---3.1_30806.p',rule_125) ).
cnf(axiom_17,axiom,
q0(X1,d),
file('/export/starexec/sandbox/tmp/tmp.U4L12hsAMc/E---3.1_30806.p',axiom_17) ).
cnf(axiom_14,axiom,
p0(b,X1),
file('/export/starexec/sandbox/tmp/tmp.U4L12hsAMc/E---3.1_30806.p',axiom_14) ).
cnf(rule_029,axiom,
( m1(X1,X2,X1)
| ~ p0(X1,X2)
| ~ s0(X1) ),
file('/export/starexec/sandbox/tmp/tmp.U4L12hsAMc/E---3.1_30806.p',rule_029) ).
cnf(rule_133,axiom,
( l2(X1,X1)
| ~ p0(X2,X2)
| ~ s1(X3)
| ~ m0(X4,X3,X1) ),
file('/export/starexec/sandbox/tmp/tmp.U4L12hsAMc/E---3.1_30806.p',rule_133) ).
cnf(rule_176,axiom,
( p2(X1,X2,X1)
| ~ m1(X2,X1,X2) ),
file('/export/starexec/sandbox/tmp/tmp.U4L12hsAMc/E---3.1_30806.p',rule_176) ).
cnf(axiom_5,axiom,
s0(b),
file('/export/starexec/sandbox/tmp/tmp.U4L12hsAMc/E---3.1_30806.p',axiom_5) ).
cnf(rule_240,axiom,
( n3(X1)
| ~ p2(X2,X3,X1) ),
file('/export/starexec/sandbox/tmp/tmp.U4L12hsAMc/E---3.1_30806.p',rule_240) ).
cnf(rule_258,axiom,
( q3(X1,X1)
| ~ r2(X1)
| ~ s1(X2)
| ~ l2(X3,X3) ),
file('/export/starexec/sandbox/tmp/tmp.U4L12hsAMc/E---3.1_30806.p',rule_258) ).
cnf(axiom_19,axiom,
m0(X1,d,X2),
file('/export/starexec/sandbox/tmp/tmp.U4L12hsAMc/E---3.1_30806.p',axiom_19) ).
cnf(rule_298,axiom,
( r4(X1)
| ~ n3(X1)
| ~ q3(X2,X3)
| ~ p0(X4,X1) ),
file('/export/starexec/sandbox/tmp/tmp.U4L12hsAMc/E---3.1_30806.p',rule_298) ).
cnf(rule_124,axiom,
( r1(X1)
| ~ q0(X1,X2)
| ~ s0(d)
| ~ q1(d,X2,d) ),
file('/export/starexec/sandbox/tmp/tmp.U4L12hsAMc/E---3.1_30806.p',rule_124) ).
cnf(rule_117,axiom,
( q1(d,d,d)
| ~ k0(e)
| ~ s0(d) ),
file('/export/starexec/sandbox/tmp/tmp.U4L12hsAMc/E---3.1_30806.p',rule_117) ).
cnf(axiom_1,axiom,
s0(d),
file('/export/starexec/sandbox/tmp/tmp.U4L12hsAMc/E---3.1_30806.p',axiom_1) ).
cnf(axiom_28,axiom,
k0(e),
file('/export/starexec/sandbox/tmp/tmp.U4L12hsAMc/E---3.1_30806.p',axiom_28) ).
cnf(rule_188,axiom,
( r2(X1)
| ~ r1(X1)
| ~ l0(X1) ),
file('/export/starexec/sandbox/tmp/tmp.U4L12hsAMc/E---3.1_30806.p',rule_188) ).
cnf(rule_314,axiom,
( n5(X1,X1)
| ~ r4(X1) ),
file('/export/starexec/sandbox/tmp/tmp.U4L12hsAMc/E---3.1_30806.p',rule_314) ).
cnf(axiom_24,axiom,
l0(c),
file('/export/starexec/sandbox/tmp/tmp.U4L12hsAMc/E---3.1_30806.p',axiom_24) ).
cnf(prove_this,negated_conjecture,
~ n5(b,b),
file('/export/starexec/sandbox/tmp/tmp.U4L12hsAMc/E---3.1_30806.p',prove_this) ).
cnf(c_0_20,plain,
( s1(X1)
| ~ q0(X1,X2)
| ~ s1(X3) ),
inference(fof_simplification,[status(thm)],[rule_126]) ).
cnf(c_0_21,plain,
( s1(X1)
| ~ p0(X1,X1) ),
inference(fof_simplification,[status(thm)],[rule_125]) ).
cnf(c_0_22,plain,
( s1(X1)
| ~ q0(X1,X2)
| ~ s1(X3) ),
c_0_20 ).
cnf(c_0_23,axiom,
q0(X1,d),
axiom_17 ).
cnf(c_0_24,plain,
( s1(X1)
| ~ p0(X1,X1) ),
c_0_21 ).
cnf(c_0_25,axiom,
p0(b,X1),
axiom_14 ).
cnf(c_0_26,plain,
( m1(X1,X2,X1)
| ~ p0(X1,X2)
| ~ s0(X1) ),
inference(fof_simplification,[status(thm)],[rule_029]) ).
cnf(c_0_27,plain,
( l2(X1,X1)
| ~ p0(X2,X2)
| ~ s1(X3)
| ~ m0(X4,X3,X1) ),
inference(fof_simplification,[status(thm)],[rule_133]) ).
cnf(c_0_28,plain,
( s1(X1)
| ~ s1(X2) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_29,plain,
s1(b),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_30,plain,
( p2(X1,X2,X1)
| ~ m1(X2,X1,X2) ),
inference(fof_simplification,[status(thm)],[rule_176]) ).
cnf(c_0_31,plain,
( m1(X1,X2,X1)
| ~ p0(X1,X2)
| ~ s0(X1) ),
c_0_26 ).
cnf(c_0_32,axiom,
s0(b),
axiom_5 ).
cnf(c_0_33,plain,
( l2(X1,X1)
| ~ p0(X2,X2)
| ~ s1(X3)
| ~ m0(X4,X3,X1) ),
c_0_27 ).
cnf(c_0_34,plain,
s1(X1),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_35,plain,
( n3(X1)
| ~ p2(X2,X3,X1) ),
inference(fof_simplification,[status(thm)],[rule_240]) ).
cnf(c_0_36,plain,
( p2(X1,X2,X1)
| ~ m1(X2,X1,X2) ),
c_0_30 ).
cnf(c_0_37,plain,
m1(b,X1,b),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_25]),c_0_32])]) ).
cnf(c_0_38,plain,
( q3(X1,X1)
| ~ r2(X1)
| ~ s1(X2)
| ~ l2(X3,X3) ),
inference(fof_simplification,[status(thm)],[rule_258]) ).
cnf(c_0_39,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_40,axiom,
m0(X1,d,X2),
axiom_19 ).
cnf(c_0_41,plain,
( r4(X1)
| ~ n3(X1)
| ~ q3(X2,X3)
| ~ p0(X4,X1) ),
inference(fof_simplification,[status(thm)],[rule_298]) ).
cnf(c_0_42,plain,
( n3(X1)
| ~ p2(X2,X3,X1) ),
c_0_35 ).
cnf(c_0_43,plain,
p2(X1,b,X1),
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_44,plain,
( q3(X1,X1)
| ~ r2(X1)
| ~ s1(X2)
| ~ l2(X3,X3) ),
c_0_38 ).
cnf(c_0_45,plain,
( l2(X1,X1)
| ~ p0(X2,X2) ),
inference(spm,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_46,plain,
( r1(X1)
| ~ q0(X1,X2)
| ~ s0(d)
| ~ q1(d,X2,d) ),
inference(fof_simplification,[status(thm)],[rule_124]) ).
cnf(c_0_47,plain,
( q1(d,d,d)
| ~ k0(e)
| ~ s0(d) ),
inference(fof_simplification,[status(thm)],[rule_117]) ).
cnf(c_0_48,plain,
( r4(X1)
| ~ n3(X1)
| ~ q3(X2,X3)
| ~ p0(X4,X1) ),
c_0_41 ).
cnf(c_0_49,plain,
n3(X1),
inference(spm,[status(thm)],[c_0_42,c_0_43]) ).
cnf(c_0_50,plain,
( q3(X1,X1)
| ~ r2(X1)
| ~ l2(X2,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_44,c_0_34])]) ).
cnf(c_0_51,plain,
l2(X1,X1),
inference(spm,[status(thm)],[c_0_45,c_0_25]) ).
cnf(c_0_52,plain,
( r1(X1)
| ~ q0(X1,X2)
| ~ s0(d)
| ~ q1(d,X2,d) ),
c_0_46 ).
cnf(c_0_53,axiom,
s0(d),
axiom_1 ).
cnf(c_0_54,plain,
( q1(d,d,d)
| ~ k0(e)
| ~ s0(d) ),
c_0_47 ).
cnf(c_0_55,axiom,
k0(e),
axiom_28 ).
cnf(c_0_56,plain,
( r4(X1)
| ~ q3(X2,X3)
| ~ p0(X4,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_48,c_0_49])]) ).
cnf(c_0_57,plain,
( q3(X1,X1)
| ~ r2(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_50,c_0_51])]) ).
cnf(c_0_58,plain,
( r2(X1)
| ~ r1(X1)
| ~ l0(X1) ),
inference(fof_simplification,[status(thm)],[rule_188]) ).
cnf(c_0_59,plain,
( r1(X1)
| ~ q1(d,X2,d)
| ~ q0(X1,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_52,c_0_53])]) ).
cnf(c_0_60,plain,
q1(d,d,d),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_54,c_0_53]),c_0_55])]) ).
cnf(c_0_61,plain,
( r4(X1)
| ~ r2(X2)
| ~ p0(X3,X1) ),
inference(spm,[status(thm)],[c_0_56,c_0_57]) ).
cnf(c_0_62,plain,
( r2(X1)
| ~ r1(X1)
| ~ l0(X1) ),
c_0_58 ).
cnf(c_0_63,plain,
r1(X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_59,c_0_23]),c_0_60])]) ).
cnf(c_0_64,plain,
( r4(X1)
| ~ r2(X2) ),
inference(spm,[status(thm)],[c_0_61,c_0_25]) ).
cnf(c_0_65,plain,
( r2(X1)
| ~ l0(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_62,c_0_63])]) ).
cnf(c_0_66,plain,
( n5(X1,X1)
| ~ r4(X1) ),
inference(fof_simplification,[status(thm)],[rule_314]) ).
cnf(c_0_67,plain,
( r4(X1)
| ~ l0(X2) ),
inference(spm,[status(thm)],[c_0_64,c_0_65]) ).
cnf(c_0_68,axiom,
l0(c),
axiom_24 ).
cnf(c_0_69,negated_conjecture,
~ n5(b,b),
inference(fof_simplification,[status(thm)],[prove_this]) ).
cnf(c_0_70,plain,
( n5(X1,X1)
| ~ r4(X1) ),
c_0_66 ).
cnf(c_0_71,plain,
r4(X1),
inference(spm,[status(thm)],[c_0_67,c_0_68]) ).
cnf(c_0_72,negated_conjecture,
~ n5(b,b),
c_0_69 ).
cnf(c_0_73,plain,
n5(X1,X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_70,c_0_71])]) ).
cnf(c_0_74,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_72,c_0_73])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.14/0.14 % Problem : SYN160-1 : TPTP v8.1.2. Released v1.1.0.
% 0.14/0.15 % Command : run_E %s %d THM
% 0.15/0.36 % Computer : n031.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Fri May 3 11:06:02 EDT 2024
% 0.15/0.37 % CPUTime :
% 0.22/0.52 Running first-order theorem proving
% 0.22/0.52 Running: /export/starexec/sandbox/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/sandbox/tmp/tmp.U4L12hsAMc/E---3.1_30806.p
% 0.61/0.59 # Version: 3.1.0
% 0.61/0.59 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.61/0.59 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.61/0.59 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.61/0.59 # Starting new_bool_3 with 300s (1) cores
% 0.61/0.59 # Starting new_bool_1 with 300s (1) cores
% 0.61/0.59 # Starting sh5l with 300s (1) cores
% 0.61/0.59 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 30888 completed with status 0
% 0.61/0.59 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.61/0.59 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.61/0.59 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.61/0.59 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.61/0.59 # No SInE strategy applied
% 0.61/0.59 # Search class: FHUNM-FSLM00-SFFFFFNN
% 0.61/0.59 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.61/0.59 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.61/0.59 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.61/0.59 # Starting new_bool_3 with 136s (1) cores
% 0.61/0.59 # Starting new_bool_1 with 136s (1) cores
% 0.61/0.59 # Starting sh5l with 136s (1) cores
% 0.61/0.59 # SAT001_MinMin_p005000_rr_RG with pid 30893 completed with status 0
% 0.61/0.59 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.61/0.59 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.61/0.59 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.61/0.59 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.61/0.59 # No SInE strategy applied
% 0.61/0.59 # Search class: FHUNM-FSLM00-SFFFFFNN
% 0.61/0.59 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.61/0.59 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.61/0.59 # Preprocessing time : 0.003 s
% 0.61/0.59 # Presaturation interreduction done
% 0.61/0.59
% 0.61/0.59 # Proof found!
% 0.61/0.59 # SZS status Unsatisfiable
% 0.61/0.59 # SZS output start CNFRefutation
% See solution above
% 0.61/0.59 # Parsed axioms : 369
% 0.61/0.59 # Removed by relevancy pruning/SinE : 0
% 0.61/0.59 # Initial clauses : 369
% 0.61/0.59 # Removed in clause preprocessing : 7
% 0.61/0.59 # Initial clauses in saturation : 362
% 0.61/0.59 # Processed clauses : 971
% 0.61/0.59 # ...of these trivial : 25
% 0.61/0.59 # ...subsumed : 33
% 0.61/0.59 # ...remaining for further processing : 913
% 0.61/0.59 # Other redundant clauses eliminated : 0
% 0.61/0.59 # Clauses deleted for lack of memory : 0
% 0.61/0.59 # Backward-subsumed : 31
% 0.61/0.59 # Backward-rewritten : 178
% 0.61/0.59 # Generated clauses : 1194
% 0.61/0.59 # ...of the previous two non-redundant : 838
% 0.61/0.59 # ...aggressively subsumed : 0
% 0.61/0.59 # Contextual simplify-reflections : 2
% 0.61/0.59 # Paramodulations : 1194
% 0.61/0.59 # Factorizations : 0
% 0.61/0.59 # NegExts : 0
% 0.61/0.59 # Equation resolutions : 0
% 0.61/0.59 # Disequality decompositions : 0
% 0.61/0.59 # Total rewrite steps : 865
% 0.61/0.59 # ...of those cached : 625
% 0.61/0.59 # Propositional unsat checks : 0
% 0.61/0.59 # Propositional check models : 0
% 0.61/0.59 # Propositional check unsatisfiable : 0
% 0.61/0.59 # Propositional clauses : 0
% 0.61/0.59 # Propositional clauses after purity: 0
% 0.61/0.59 # Propositional unsat core size : 0
% 0.61/0.59 # Propositional preprocessing time : 0.000
% 0.61/0.59 # Propositional encoding time : 0.000
% 0.61/0.59 # Propositional solver time : 0.000
% 0.61/0.59 # Success case prop preproc time : 0.000
% 0.61/0.59 # Success case prop encoding time : 0.000
% 0.61/0.59 # Success case prop solver time : 0.000
% 0.61/0.59 # Current number of processed clauses : 376
% 0.61/0.59 # Positive orientable unit clauses : 158
% 0.61/0.59 # Positive unorientable unit clauses: 0
% 0.61/0.59 # Negative unit clauses : 1
% 0.61/0.59 # Non-unit-clauses : 217
% 0.61/0.59 # Current number of unprocessed clauses: 513
% 0.61/0.59 # ...number of literals in the above : 1270
% 0.61/0.59 # Current number of archived formulas : 0
% 0.61/0.59 # Current number of archived clauses : 537
% 0.61/0.59 # Clause-clause subsumption calls (NU) : 49595
% 0.61/0.59 # Rec. Clause-clause subsumption calls : 34743
% 0.61/0.59 # Non-unit clause-clause subsumptions : 54
% 0.61/0.59 # Unit Clause-clause subsumption calls : 2269
% 0.61/0.59 # Rewrite failures with RHS unbound : 0
% 0.61/0.59 # BW rewrite match attempts : 294
% 0.61/0.59 # BW rewrite match successes : 117
% 0.61/0.59 # Condensation attempts : 0
% 0.61/0.59 # Condensation successes : 0
% 0.61/0.59 # Termbank termtop insertions : 26394
% 0.61/0.59 # Search garbage collected termcells : 1461
% 0.61/0.59
% 0.61/0.59 # -------------------------------------------------
% 0.61/0.59 # User time : 0.047 s
% 0.61/0.59 # System time : 0.012 s
% 0.61/0.59 # Total time : 0.059 s
% 0.61/0.59 # Maximum resident set size: 2640 pages
% 0.61/0.59
% 0.61/0.59 # -------------------------------------------------
% 0.61/0.59 # User time : 0.225 s
% 0.61/0.59 # System time : 0.025 s
% 0.61/0.59 # Total time : 0.250 s
% 0.61/0.59 # Maximum resident set size: 2012 pages
% 0.61/0.59 % E---3.1 exiting
% 0.61/0.59 % E exiting
%------------------------------------------------------------------------------