TSTP Solution File: SYN252-1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SYN252-1 : TPTP v8.1.2. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n003.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:12 EDT 2023
% Result : Unsatisfiable 0.37s 0.74s
% Output : CNFRefutation 0.37s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 22
% Syntax : Number of clauses : 69 ( 28 unt; 0 nHn; 48 RR)
% Number of literals : 143 ( 0 equ; 78 neg)
% Maximal clause size : 4 ( 2 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 17 ( 16 usr; 1 prp; 0-3 aty)
% Number of functors : 3 ( 3 usr; 3 con; 0-0 aty)
% Number of variables : 111 ( 38 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(rule_085,axiom,
( p1(X1,X1,X1)
| ~ p0(X2,X1) ),
file('/export/starexec/sandbox/tmp/tmp.B8adTUZYSZ/E---3.1_9905.p',rule_085) ).
cnf(axiom_14,axiom,
p0(b,X1),
file('/export/starexec/sandbox/tmp/tmp.B8adTUZYSZ/E---3.1_9905.p',axiom_14) ).
cnf(rule_126,axiom,
( s1(X1)
| ~ q0(X1,X2)
| ~ s1(X3) ),
file('/export/starexec/sandbox/tmp/tmp.B8adTUZYSZ/E---3.1_9905.p',rule_126) ).
cnf(axiom_17,axiom,
q0(X1,d),
file('/export/starexec/sandbox/tmp/tmp.B8adTUZYSZ/E---3.1_9905.p',axiom_17) ).
cnf(rule_125,axiom,
( s1(X1)
| ~ p0(X1,X1) ),
file('/export/starexec/sandbox/tmp/tmp.B8adTUZYSZ/E---3.1_9905.p',rule_125) ).
cnf(rule_181,axiom,
( q2(X1,X1,X1)
| ~ p1(X1,X1,X1) ),
file('/export/starexec/sandbox/tmp/tmp.B8adTUZYSZ/E---3.1_9905.p',rule_181) ).
cnf(rule_273,axiom,
( s3(X1,X2)
| ~ q2(X3,X1,X3)
| ~ s2(X1)
| ~ m0(X3,X4,X2) ),
file('/export/starexec/sandbox/tmp/tmp.B8adTUZYSZ/E---3.1_9905.p',rule_273) ).
cnf(rule_133,axiom,
( l2(X1,X1)
| ~ p0(X2,X2)
| ~ s1(X3)
| ~ m0(X4,X3,X1) ),
file('/export/starexec/sandbox/tmp/tmp.B8adTUZYSZ/E---3.1_9905.p',rule_133) ).
cnf(axiom_19,axiom,
m0(X1,d,X2),
file('/export/starexec/sandbox/tmp/tmp.B8adTUZYSZ/E---3.1_9905.p',axiom_19) ).
cnf(rule_279,axiom,
( m4(X1,X2)
| ~ l2(X3,X2)
| ~ s3(a,X1) ),
file('/export/starexec/sandbox/tmp/tmp.B8adTUZYSZ/E---3.1_9905.p',rule_279) ).
cnf(rule_050,axiom,
( n1(X1,X2,X1)
| ~ s0(b)
| ~ l0(X1)
| ~ p0(b,X2) ),
file('/export/starexec/sandbox/tmp/tmp.B8adTUZYSZ/E---3.1_9905.p',rule_050) ).
cnf(axiom_5,axiom,
s0(b),
file('/export/starexec/sandbox/tmp/tmp.B8adTUZYSZ/E---3.1_9905.p',axiom_5) ).
cnf(rule_069,axiom,
( p1(X1,X1,X2)
| ~ p0(X2,X1) ),
file('/export/starexec/sandbox/tmp/tmp.B8adTUZYSZ/E---3.1_9905.p',rule_069) ).
cnf(axiom_20,axiom,
l0(a),
file('/export/starexec/sandbox/tmp/tmp.B8adTUZYSZ/E---3.1_9905.p',axiom_20) ).
cnf(prove_this,negated_conjecture,
~ m4(X1,d),
file('/export/starexec/sandbox/tmp/tmp.B8adTUZYSZ/E---3.1_9905.p',prove_this) ).
cnf(rule_189,axiom,
( s2(X1)
| ~ q2(b,X1,b)
| ~ s1(b) ),
file('/export/starexec/sandbox/tmp/tmp.B8adTUZYSZ/E---3.1_9905.p',rule_189) ).
cnf(rule_182,axiom,
( q2(X1,X2,X1)
| ~ p1(X1,X1,X3)
| ~ n1(X2,X1,X3)
| ~ q2(X2,X3,X1) ),
file('/export/starexec/sandbox/tmp/tmp.B8adTUZYSZ/E---3.1_9905.p',rule_182) ).
cnf(rule_177,axiom,
( q2(X1,X2,X2)
| ~ k0(X2)
| ~ p1(X1,X1,X1) ),
file('/export/starexec/sandbox/tmp/tmp.B8adTUZYSZ/E---3.1_9905.p',rule_177) ).
cnf(rule_054,axiom,
( n1(X1,X2,X2)
| ~ l0(X3)
| ~ l1(X3,X1)
| ~ n1(X1,X2,X1) ),
file('/export/starexec/sandbox/tmp/tmp.B8adTUZYSZ/E---3.1_9905.p',rule_054) ).
cnf(rule_002,axiom,
( l1(X1,X1)
| ~ n0(X2,X1) ),
file('/export/starexec/sandbox/tmp/tmp.B8adTUZYSZ/E---3.1_9905.p',rule_002) ).
cnf(axiom_37,axiom,
n0(b,a),
file('/export/starexec/sandbox/tmp/tmp.B8adTUZYSZ/E---3.1_9905.p',axiom_37) ).
cnf(axiom_32,axiom,
k0(b),
file('/export/starexec/sandbox/tmp/tmp.B8adTUZYSZ/E---3.1_9905.p',axiom_32) ).
cnf(c_0_22,axiom,
( p1(X1,X1,X1)
| ~ p0(X2,X1) ),
rule_085 ).
cnf(c_0_23,axiom,
p0(b,X1),
axiom_14 ).
cnf(c_0_24,axiom,
( s1(X1)
| ~ q0(X1,X2)
| ~ s1(X3) ),
rule_126 ).
cnf(c_0_25,axiom,
q0(X1,d),
axiom_17 ).
cnf(c_0_26,axiom,
( s1(X1)
| ~ p0(X1,X1) ),
rule_125 ).
cnf(c_0_27,axiom,
( q2(X1,X1,X1)
| ~ p1(X1,X1,X1) ),
rule_181 ).
cnf(c_0_28,plain,
p1(X1,X1,X1),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_29,plain,
( s1(X1)
| ~ s1(X2) ),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_30,plain,
s1(b),
inference(spm,[status(thm)],[c_0_26,c_0_23]) ).
cnf(c_0_31,axiom,
( s3(X1,X2)
| ~ q2(X3,X1,X3)
| ~ s2(X1)
| ~ m0(X3,X4,X2) ),
rule_273 ).
cnf(c_0_32,plain,
q2(X1,X1,X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_27,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,plain,
( s3(X1,X2)
| ~ s2(X1)
| ~ m0(X1,X3,X2) ),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_36,axiom,
m0(X1,d,X2),
axiom_19 ).
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,
( m4(X1,X2)
| ~ l2(X3,X2)
| ~ s3(a,X1) ),
rule_279 ).
cnf(c_0_39,plain,
( s3(X1,X2)
| ~ s2(X1) ),
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_40,plain,
( l2(X1,X1)
| ~ p0(X2,X2) ),
inference(spm,[status(thm)],[c_0_37,c_0_36]) ).
cnf(c_0_41,axiom,
( n1(X1,X2,X1)
| ~ s0(b)
| ~ l0(X1)
| ~ p0(b,X2) ),
rule_050 ).
cnf(c_0_42,axiom,
s0(b),
axiom_5 ).
cnf(c_0_43,plain,
( m4(X1,X2)
| ~ s2(a)
| ~ l2(X3,X2) ),
inference(spm,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_44,plain,
l2(X1,X1),
inference(spm,[status(thm)],[c_0_40,c_0_23]) ).
cnf(c_0_45,axiom,
( p1(X1,X1,X2)
| ~ p0(X2,X1) ),
rule_069 ).
cnf(c_0_46,plain,
( n1(X1,X2,X1)
| ~ l0(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_41,c_0_42]),c_0_23])]) ).
cnf(c_0_47,axiom,
l0(a),
axiom_20 ).
cnf(c_0_48,negated_conjecture,
~ m4(X1,d),
prove_this ).
cnf(c_0_49,plain,
( m4(X1,X2)
| ~ s2(a) ),
inference(spm,[status(thm)],[c_0_43,c_0_44]) ).
cnf(c_0_50,axiom,
( s2(X1)
| ~ q2(b,X1,b)
| ~ s1(b) ),
rule_189 ).
cnf(c_0_51,axiom,
( q2(X1,X2,X1)
| ~ p1(X1,X1,X3)
| ~ n1(X2,X1,X3)
| ~ q2(X2,X3,X1) ),
rule_182 ).
cnf(c_0_52,plain,
p1(X1,X1,b),
inference(spm,[status(thm)],[c_0_45,c_0_23]) ).
cnf(c_0_53,axiom,
( q2(X1,X2,X2)
| ~ k0(X2)
| ~ p1(X1,X1,X1) ),
rule_177 ).
cnf(c_0_54,axiom,
( n1(X1,X2,X2)
| ~ l0(X3)
| ~ l1(X3,X1)
| ~ n1(X1,X2,X1) ),
rule_054 ).
cnf(c_0_55,plain,
n1(a,X1,a),
inference(spm,[status(thm)],[c_0_46,c_0_47]) ).
cnf(c_0_56,axiom,
( l1(X1,X1)
| ~ n0(X2,X1) ),
rule_002 ).
cnf(c_0_57,axiom,
n0(b,a),
axiom_37 ).
cnf(c_0_58,negated_conjecture,
~ s2(a),
inference(spm,[status(thm)],[c_0_48,c_0_49]) ).
cnf(c_0_59,plain,
( s2(X1)
| ~ q2(b,X1,b) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_50,c_0_30])]) ).
cnf(c_0_60,plain,
( q2(X1,X2,X1)
| ~ q2(X2,b,X1)
| ~ n1(X2,X1,b) ),
inference(spm,[status(thm)],[c_0_51,c_0_52]) ).
cnf(c_0_61,plain,
( q2(X1,X2,X2)
| ~ k0(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_53,c_0_28])]) ).
cnf(c_0_62,axiom,
k0(b),
axiom_32 ).
cnf(c_0_63,plain,
( n1(a,X1,X1)
| ~ l1(X2,a)
| ~ l0(X2) ),
inference(spm,[status(thm)],[c_0_54,c_0_55]) ).
cnf(c_0_64,plain,
l1(a,a),
inference(spm,[status(thm)],[c_0_56,c_0_57]) ).
cnf(c_0_65,negated_conjecture,
~ q2(b,a,b),
inference(spm,[status(thm)],[c_0_58,c_0_59]) ).
cnf(c_0_66,plain,
( q2(b,X1,b)
| ~ n1(X1,b,b) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_60,c_0_61]),c_0_62])]) ).
cnf(c_0_67,plain,
n1(a,X1,X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_63,c_0_64]),c_0_47])]) ).
cnf(c_0_68,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_65,c_0_66]),c_0_67])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.15 % Problem : SYN252-1 : TPTP v8.1.2. Released v1.1.0.
% 0.07/0.16 % Command : run_E %s %d THM
% 0.16/0.37 % Computer : n003.cluster.edu
% 0.16/0.37 % Model : x86_64 x86_64
% 0.16/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.37 % Memory : 8042.1875MB
% 0.16/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.37 % CPULimit : 2400
% 0.16/0.37 % WCLimit : 300
% 0.16/0.37 % DateTime : Mon Oct 2 18:51:18 EDT 2023
% 0.16/0.37 % CPUTime :
% 0.37/0.54 Running first-order theorem proving
% 0.37/0.54 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.B8adTUZYSZ/E---3.1_9905.p
% 0.37/0.74 # Version: 3.1pre001
% 0.37/0.74 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.37/0.74 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.37/0.74 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.37/0.74 # Starting new_bool_3 with 300s (1) cores
% 0.37/0.74 # Starting new_bool_1 with 300s (1) cores
% 0.37/0.74 # Starting sh5l with 300s (1) cores
% 0.37/0.74 # sh5l with pid 10058 completed with status 0
% 0.37/0.74 # Result found by sh5l
% 0.37/0.74 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.37/0.74 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.37/0.74 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.37/0.74 # Starting new_bool_3 with 300s (1) cores
% 0.37/0.74 # Starting new_bool_1 with 300s (1) cores
% 0.37/0.74 # Starting sh5l with 300s (1) cores
% 0.37/0.74 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.37/0.74 # Search class: FHUNM-FSLM00-SFFFFFNN
% 0.37/0.74 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.37/0.74 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.37/0.74 # SAT001_MinMin_p005000_rr_RG with pid 10067 completed with status 0
% 0.37/0.74 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.37/0.74 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.37/0.74 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.37/0.74 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.37/0.74 # Starting new_bool_3 with 300s (1) cores
% 0.37/0.74 # Starting new_bool_1 with 300s (1) cores
% 0.37/0.74 # Starting sh5l with 300s (1) cores
% 0.37/0.74 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.37/0.74 # Search class: FHUNM-FSLM00-SFFFFFNN
% 0.37/0.74 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.37/0.74 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.37/0.74 # Preprocessing time : 0.005 s
% 0.37/0.74 # Presaturation interreduction done
% 0.37/0.74
% 0.37/0.74 # Proof found!
% 0.37/0.74 # SZS status Unsatisfiable
% 0.37/0.74 # SZS output start CNFRefutation
% See solution above
% 0.37/0.74 # Parsed axioms : 369
% 0.37/0.74 # Removed by relevancy pruning/SinE : 0
% 0.37/0.74 # Initial clauses : 369
% 0.37/0.74 # Removed in clause preprocessing : 7
% 0.37/0.74 # Initial clauses in saturation : 362
% 0.37/0.74 # Processed clauses : 1893
% 0.37/0.74 # ...of these trivial : 79
% 0.37/0.74 # ...subsumed : 229
% 0.37/0.74 # ...remaining for further processing : 1585
% 0.37/0.74 # Other redundant clauses eliminated : 0
% 0.37/0.74 # Clauses deleted for lack of memory : 0
% 0.37/0.74 # Backward-subsumed : 203
% 0.37/0.74 # Backward-rewritten : 425
% 0.37/0.74 # Generated clauses : 2859
% 0.37/0.74 # ...of the previous two non-redundant : 1943
% 0.37/0.74 # ...aggressively subsumed : 0
% 0.37/0.74 # Contextual simplify-reflections : 3
% 0.37/0.74 # Paramodulations : 2859
% 0.37/0.74 # Factorizations : 0
% 0.37/0.74 # NegExts : 0
% 0.37/0.74 # Equation resolutions : 0
% 0.37/0.74 # Total rewrite steps : 2168
% 0.37/0.74 # Propositional unsat checks : 0
% 0.37/0.74 # Propositional check models : 0
% 0.37/0.74 # Propositional check unsatisfiable : 0
% 0.37/0.74 # Propositional clauses : 0
% 0.37/0.74 # Propositional clauses after purity: 0
% 0.37/0.74 # Propositional unsat core size : 0
% 0.37/0.74 # Propositional preprocessing time : 0.000
% 0.37/0.74 # Propositional encoding time : 0.000
% 0.37/0.74 # Propositional solver time : 0.000
% 0.37/0.74 # Success case prop preproc time : 0.000
% 0.37/0.74 # Success case prop encoding time : 0.000
% 0.37/0.74 # Success case prop solver time : 0.000
% 0.37/0.74 # Current number of processed clauses : 629
% 0.37/0.74 # Positive orientable unit clauses : 249
% 0.37/0.74 # Positive unorientable unit clauses: 0
% 0.37/0.74 # Negative unit clauses : 4
% 0.37/0.74 # Non-unit-clauses : 376
% 0.37/0.74 # Current number of unprocessed clauses: 208
% 0.37/0.74 # ...number of literals in the above : 769
% 0.37/0.74 # Current number of archived formulas : 0
% 0.37/0.74 # Current number of archived clauses : 956
% 0.37/0.74 # Clause-clause subsumption calls (NU) : 80105
% 0.37/0.74 # Rec. Clause-clause subsumption calls : 62504
% 0.37/0.74 # Non-unit clause-clause subsumptions : 366
% 0.37/0.74 # Unit Clause-clause subsumption calls : 7255
% 0.37/0.74 # Rewrite failures with RHS unbound : 0
% 0.37/0.74 # BW rewrite match attempts : 809
% 0.37/0.74 # BW rewrite match successes : 308
% 0.37/0.74 # Condensation attempts : 0
% 0.37/0.74 # Condensation successes : 0
% 0.37/0.74 # Termbank termtop insertions : 40411
% 0.37/0.74
% 0.37/0.74 # -------------------------------------------------
% 0.37/0.74 # User time : 0.180 s
% 0.37/0.74 # System time : 0.007 s
% 0.37/0.74 # Total time : 0.187 s
% 0.37/0.74 # Maximum resident set size: 2528 pages
% 0.37/0.74
% 0.37/0.74 # -------------------------------------------------
% 0.37/0.74 # User time : 0.187 s
% 0.37/0.74 # System time : 0.009 s
% 0.37/0.74 # Total time : 0.196 s
% 0.37/0.74 # Maximum resident set size: 2000 pages
% 0.37/0.74 % E---3.1 exiting
% 1.81/0.74 % E---3.1 exiting
%------------------------------------------------------------------------------