TSTP Solution File: SYN190-1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SYN190-1 : TPTP v8.1.2. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n018.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:03 EDT 2023
% Result : Unsatisfiable 0.23s 0.64s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 23
% Syntax : Number of clauses : 70 ( 30 unt; 0 nHn; 58 RR)
% Number of literals : 142 ( 0 equ; 74 neg)
% Maximal clause size : 4 ( 2 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 20 ( 19 usr; 1 prp; 0-3 aty)
% Number of functors : 5 ( 5 usr; 5 con; 0-0 aty)
% Number of variables : 95 ( 35 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(rule_126,axiom,
( s1(X1)
| ~ q0(X1,X2)
| ~ s1(X3) ),
file('/export/starexec/sandbox/tmp/tmp.V6VN7kG0qa/E---3.1_8628.p',rule_126) ).
cnf(axiom_17,axiom,
q0(X1,d),
file('/export/starexec/sandbox/tmp/tmp.V6VN7kG0qa/E---3.1_8628.p',axiom_17) ).
cnf(rule_125,axiom,
( s1(X1)
| ~ p0(X1,X1) ),
file('/export/starexec/sandbox/tmp/tmp.V6VN7kG0qa/E---3.1_8628.p',rule_125) ).
cnf(axiom_14,axiom,
p0(b,X1),
file('/export/starexec/sandbox/tmp/tmp.V6VN7kG0qa/E---3.1_8628.p',axiom_14) ).
cnf(rule_023,axiom,
( m1(a,a,a)
| ~ l0(a)
| ~ s0(d) ),
file('/export/starexec/sandbox/tmp/tmp.V6VN7kG0qa/E---3.1_8628.p',rule_023) ).
cnf(axiom_1,axiom,
s0(d),
file('/export/starexec/sandbox/tmp/tmp.V6VN7kG0qa/E---3.1_8628.p',axiom_1) ).
cnf(axiom_20,axiom,
l0(a),
file('/export/starexec/sandbox/tmp/tmp.V6VN7kG0qa/E---3.1_8628.p',axiom_20) ).
cnf(rule_192,axiom,
( k3(X1,X2,X1)
| ~ s1(X2)
| ~ p2(X3,X2,X4)
| ~ n0(X1,X4) ),
file('/export/starexec/sandbox/tmp/tmp.V6VN7kG0qa/E---3.1_8628.p',rule_192) ).
cnf(rule_176,axiom,
( p2(X1,X2,X1)
| ~ m1(X2,X1,X2) ),
file('/export/starexec/sandbox/tmp/tmp.V6VN7kG0qa/E---3.1_8628.p',rule_176) ).
cnf(rule_124,axiom,
( r1(X1)
| ~ q0(X1,X2)
| ~ s0(d)
| ~ q1(d,X2,d) ),
file('/export/starexec/sandbox/tmp/tmp.V6VN7kG0qa/E---3.1_8628.p',rule_124) ).
cnf(rule_117,axiom,
( q1(d,d,d)
| ~ k0(e)
| ~ s0(d) ),
file('/export/starexec/sandbox/tmp/tmp.V6VN7kG0qa/E---3.1_8628.p',rule_117) ).
cnf(axiom_28,axiom,
k0(e),
file('/export/starexec/sandbox/tmp/tmp.V6VN7kG0qa/E---3.1_8628.p',axiom_28) ).
cnf(axiom_37,axiom,
n0(b,a),
file('/export/starexec/sandbox/tmp/tmp.V6VN7kG0qa/E---3.1_8628.p',axiom_37) ).
cnf(rule_133,axiom,
( l2(X1,X1)
| ~ p0(X2,X2)
| ~ s1(X3)
| ~ m0(X4,X3,X1) ),
file('/export/starexec/sandbox/tmp/tmp.V6VN7kG0qa/E---3.1_8628.p',rule_133) ).
cnf(rule_235,axiom,
( m3(X1,X1,X2)
| ~ r2(X2)
| ~ k3(X1,X2,X1) ),
file('/export/starexec/sandbox/tmp/tmp.V6VN7kG0qa/E---3.1_8628.p',rule_235) ).
cnf(rule_188,axiom,
( r2(X1)
| ~ r1(X1)
| ~ l0(X1) ),
file('/export/starexec/sandbox/tmp/tmp.V6VN7kG0qa/E---3.1_8628.p',rule_188) ).
cnf(axiom_19,axiom,
m0(X1,d,X2),
file('/export/starexec/sandbox/tmp/tmp.V6VN7kG0qa/E---3.1_8628.p',axiom_19) ).
cnf(rule_268,axiom,
( r3(X1,X1,X2)
| ~ m2(X2)
| ~ m3(X3,b,X1)
| ~ r3(X2,X4,X4) ),
file('/export/starexec/sandbox/tmp/tmp.V6VN7kG0qa/E---3.1_8628.p',rule_268) ).
cnf(rule_265,axiom,
( r3(X1,X1,X1)
| ~ l2(X2,X1) ),
file('/export/starexec/sandbox/tmp/tmp.V6VN7kG0qa/E---3.1_8628.p',rule_265) ).
cnf(rule_002,axiom,
( l1(X1,X1)
| ~ n0(X2,X1) ),
file('/export/starexec/sandbox/tmp/tmp.V6VN7kG0qa/E---3.1_8628.p',rule_002) ).
cnf(axiom_34,axiom,
n0(c,d),
file('/export/starexec/sandbox/tmp/tmp.V6VN7kG0qa/E---3.1_8628.p',axiom_34) ).
cnf(rule_135,axiom,
( m2(X1)
| ~ s0(X1)
| ~ l1(X2,X3) ),
file('/export/starexec/sandbox/tmp/tmp.V6VN7kG0qa/E---3.1_8628.p',rule_135) ).
cnf(prove_this,negated_conjecture,
~ r3(a,X1,d),
file('/export/starexec/sandbox/tmp/tmp.V6VN7kG0qa/E---3.1_8628.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,plain,
( s1(X1)
| ~ s1(X2) ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_28,plain,
s1(b),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_29,axiom,
( m1(a,a,a)
| ~ l0(a)
| ~ s0(d) ),
rule_023 ).
cnf(c_0_30,axiom,
s0(d),
axiom_1 ).
cnf(c_0_31,axiom,
l0(a),
axiom_20 ).
cnf(c_0_32,axiom,
( k3(X1,X2,X1)
| ~ s1(X2)
| ~ p2(X3,X2,X4)
| ~ n0(X1,X4) ),
rule_192 ).
cnf(c_0_33,plain,
s1(X1),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_34,axiom,
( p2(X1,X2,X1)
| ~ m1(X2,X1,X2) ),
rule_176 ).
cnf(c_0_35,plain,
m1(a,a,a),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_29,c_0_30]),c_0_31])]) ).
cnf(c_0_36,plain,
( k3(X1,X2,X1)
| ~ p2(X3,X2,X4)
| ~ n0(X1,X4) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_32,c_0_33])]) ).
cnf(c_0_37,plain,
p2(a,a,a),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_38,axiom,
( r1(X1)
| ~ q0(X1,X2)
| ~ s0(d)
| ~ q1(d,X2,d) ),
rule_124 ).
cnf(c_0_39,axiom,
( q1(d,d,d)
| ~ k0(e)
| ~ s0(d) ),
rule_117 ).
cnf(c_0_40,axiom,
k0(e),
axiom_28 ).
cnf(c_0_41,plain,
( k3(X1,a,X1)
| ~ n0(X1,a) ),
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_42,axiom,
n0(b,a),
axiom_37 ).
cnf(c_0_43,plain,
( r1(X1)
| ~ q1(d,X2,d)
| ~ q0(X1,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_38,c_0_30])]) ).
cnf(c_0_44,plain,
q1(d,d,d),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_39,c_0_30]),c_0_40])]) ).
cnf(c_0_45,axiom,
( l2(X1,X1)
| ~ p0(X2,X2)
| ~ s1(X3)
| ~ m0(X4,X3,X1) ),
rule_133 ).
cnf(c_0_46,axiom,
( m3(X1,X1,X2)
| ~ r2(X2)
| ~ k3(X1,X2,X1) ),
rule_235 ).
cnf(c_0_47,plain,
k3(b,a,b),
inference(spm,[status(thm)],[c_0_41,c_0_42]) ).
cnf(c_0_48,axiom,
( r2(X1)
| ~ r1(X1)
| ~ l0(X1) ),
rule_188 ).
cnf(c_0_49,plain,
r1(X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_44]),c_0_24])]) ).
cnf(c_0_50,plain,
( l2(X1,X1)
| ~ p0(X2,X2)
| ~ m0(X3,X4,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_45,c_0_33])]) ).
cnf(c_0_51,axiom,
m0(X1,d,X2),
axiom_19 ).
cnf(c_0_52,plain,
( m3(b,b,a)
| ~ r2(a) ),
inference(spm,[status(thm)],[c_0_46,c_0_47]) ).
cnf(c_0_53,plain,
( r2(X1)
| ~ l0(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_48,c_0_49])]) ).
cnf(c_0_54,plain,
( l2(X1,X1)
| ~ p0(X2,X2) ),
inference(spm,[status(thm)],[c_0_50,c_0_51]) ).
cnf(c_0_55,axiom,
( r3(X1,X1,X2)
| ~ m2(X2)
| ~ m3(X3,b,X1)
| ~ r3(X2,X4,X4) ),
rule_268 ).
cnf(c_0_56,plain,
m3(b,b,a),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_53]),c_0_31])]) ).
cnf(c_0_57,axiom,
( r3(X1,X1,X1)
| ~ l2(X2,X1) ),
rule_265 ).
cnf(c_0_58,plain,
l2(X1,X1),
inference(spm,[status(thm)],[c_0_54,c_0_26]) ).
cnf(c_0_59,axiom,
( l1(X1,X1)
| ~ n0(X2,X1) ),
rule_002 ).
cnf(c_0_60,axiom,
n0(c,d),
axiom_34 ).
cnf(c_0_61,plain,
( r3(a,a,X1)
| ~ r3(X1,X2,X2)
| ~ m2(X1) ),
inference(spm,[status(thm)],[c_0_55,c_0_56]) ).
cnf(c_0_62,plain,
r3(X1,X1,X1),
inference(spm,[status(thm)],[c_0_57,c_0_58]) ).
cnf(c_0_63,axiom,
( m2(X1)
| ~ s0(X1)
| ~ l1(X2,X3) ),
rule_135 ).
cnf(c_0_64,plain,
l1(d,d),
inference(spm,[status(thm)],[c_0_59,c_0_60]) ).
cnf(c_0_65,plain,
( r3(a,a,X1)
| ~ m2(X1) ),
inference(spm,[status(thm)],[c_0_61,c_0_62]) ).
cnf(c_0_66,plain,
( m2(X1)
| ~ s0(X1) ),
inference(spm,[status(thm)],[c_0_63,c_0_64]) ).
cnf(c_0_67,negated_conjecture,
~ r3(a,X1,d),
prove_this ).
cnf(c_0_68,plain,
( r3(a,a,X1)
| ~ s0(X1) ),
inference(spm,[status(thm)],[c_0_65,c_0_66]) ).
cnf(c_0_69,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_67,c_0_68]),c_0_30])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.14 % Problem : SYN190-1 : TPTP v8.1.2. Released v1.1.0.
% 0.07/0.16 % Command : run_E %s %d THM
% 0.17/0.37 % Computer : n018.cluster.edu
% 0.17/0.37 % Model : x86_64 x86_64
% 0.17/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.37 % Memory : 8042.1875MB
% 0.17/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.17/0.37 % CPULimit : 2400
% 0.17/0.37 % WCLimit : 300
% 0.17/0.37 % DateTime : Mon Oct 2 18:30:54 EDT 2023
% 0.17/0.37 % CPUTime :
% 0.23/0.52 Running first-order theorem proving
% 0.23/0.53 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.V6VN7kG0qa/E---3.1_8628.p
% 0.23/0.64 # Version: 3.1pre001
% 0.23/0.64 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.23/0.64 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.64 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.23/0.64 # Starting new_bool_3 with 300s (1) cores
% 0.23/0.64 # Starting new_bool_1 with 300s (1) cores
% 0.23/0.64 # Starting sh5l with 300s (1) cores
% 0.23/0.64 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 8706 completed with status 0
% 0.23/0.64 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.23/0.64 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.23/0.64 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.64 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.23/0.64 # No SInE strategy applied
% 0.23/0.64 # Search class: FHUNM-FSLM00-SFFFFFNN
% 0.23/0.64 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.23/0.64 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.23/0.64 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.23/0.64 # Starting new_bool_3 with 136s (1) cores
% 0.23/0.64 # Starting new_bool_1 with 136s (1) cores
% 0.23/0.64 # Starting sh5l with 136s (1) cores
% 0.23/0.64 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 8711 completed with status 0
% 0.23/0.64 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.23/0.64 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.23/0.64 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.64 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.23/0.64 # No SInE strategy applied
% 0.23/0.64 # Search class: FHUNM-FSLM00-SFFFFFNN
% 0.23/0.64 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.23/0.64 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.23/0.64 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.23/0.64 # Preprocessing time : 0.005 s
% 0.23/0.64 # Presaturation interreduction done
% 0.23/0.64
% 0.23/0.64 # Proof found!
% 0.23/0.64 # SZS status Unsatisfiable
% 0.23/0.64 # SZS output start CNFRefutation
% See solution above
% 0.23/0.64 # Parsed axioms : 369
% 0.23/0.64 # Removed by relevancy pruning/SinE : 0
% 0.23/0.64 # Initial clauses : 369
% 0.23/0.64 # Removed in clause preprocessing : 7
% 0.23/0.64 # Initial clauses in saturation : 362
% 0.23/0.64 # Processed clauses : 1091
% 0.23/0.64 # ...of these trivial : 95
% 0.23/0.64 # ...subsumed : 33
% 0.23/0.64 # ...remaining for further processing : 963
% 0.23/0.64 # Other redundant clauses eliminated : 0
% 0.23/0.64 # Clauses deleted for lack of memory : 0
% 0.23/0.64 # Backward-subsumed : 55
% 0.23/0.64 # Backward-rewritten : 245
% 0.23/0.64 # Generated clauses : 1316
% 0.23/0.64 # ...of the previous two non-redundant : 1114
% 0.23/0.64 # ...aggressively subsumed : 0
% 0.23/0.64 # Contextual simplify-reflections : 3
% 0.23/0.64 # Paramodulations : 1316
% 0.23/0.64 # Factorizations : 0
% 0.23/0.64 # NegExts : 0
% 0.23/0.64 # Equation resolutions : 0
% 0.23/0.64 # Total rewrite steps : 774
% 0.23/0.64 # Propositional unsat checks : 0
% 0.23/0.64 # Propositional check models : 0
% 0.23/0.64 # Propositional check unsatisfiable : 0
% 0.23/0.64 # Propositional clauses : 0
% 0.23/0.64 # Propositional clauses after purity: 0
% 0.23/0.64 # Propositional unsat core size : 0
% 0.23/0.64 # Propositional preprocessing time : 0.000
% 0.23/0.64 # Propositional encoding time : 0.000
% 0.23/0.64 # Propositional solver time : 0.000
% 0.23/0.64 # Success case prop preproc time : 0.000
% 0.23/0.64 # Success case prop encoding time : 0.000
% 0.23/0.64 # Success case prop solver time : 0.000
% 0.23/0.64 # Current number of processed clauses : 335
% 0.23/0.64 # Positive orientable unit clauses : 121
% 0.23/0.64 # Positive unorientable unit clauses: 0
% 0.23/0.64 # Negative unit clauses : 1
% 0.23/0.64 # Non-unit-clauses : 213
% 0.23/0.64 # Current number of unprocessed clauses: 662
% 0.23/0.64 # ...number of literals in the above : 1685
% 0.23/0.64 # Current number of archived formulas : 0
% 0.23/0.64 # Current number of archived clauses : 628
% 0.23/0.64 # Clause-clause subsumption calls (NU) : 56096
% 0.23/0.64 # Rec. Clause-clause subsumption calls : 38311
% 0.23/0.64 # Non-unit clause-clause subsumptions : 68
% 0.23/0.64 # Unit Clause-clause subsumption calls : 4433
% 0.23/0.64 # Rewrite failures with RHS unbound : 0
% 0.23/0.64 # BW rewrite match attempts : 449
% 0.23/0.64 # BW rewrite match successes : 157
% 0.23/0.64 # Condensation attempts : 0
% 0.23/0.64 # Condensation successes : 0
% 0.23/0.64 # Termbank termtop insertions : 24050
% 0.23/0.64
% 0.23/0.64 # -------------------------------------------------
% 0.23/0.64 # User time : 0.091 s
% 0.23/0.64 # System time : 0.008 s
% 0.23/0.64 # Total time : 0.100 s
% 0.23/0.64 # Maximum resident set size: 2488 pages
% 0.23/0.64
% 0.23/0.64 # -------------------------------------------------
% 0.23/0.64 # User time : 0.461 s
% 0.23/0.64 # System time : 0.017 s
% 0.23/0.64 # Total time : 0.478 s
% 0.23/0.64 # Maximum resident set size: 1996 pages
% 0.23/0.64 % E---3.1 exiting
% 0.23/0.64 % E---3.1 exiting
%------------------------------------------------------------------------------