TSTP Solution File: SYN192-1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SYN192-1 : TPTP v8.1.2. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n007.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.88s 0.64s
% Output : CNFRefutation 0.88s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 21
% Syntax : Number of clauses : 66 ( 28 unt; 0 nHn; 49 RR)
% Number of literals : 131 ( 0 equ; 67 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 19 ( 18 usr; 1 prp; 0-3 aty)
% Number of functors : 5 ( 5 usr; 5 con; 0-0 aty)
% Number of variables : 105 ( 56 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(rule_126,axiom,
( s1(X1)
| ~ q0(X1,X2)
| ~ s1(X3) ),
file('/export/starexec/sandbox/tmp/tmp.RmvBjPOXbA/E---3.1_22697.p',rule_126) ).
cnf(axiom_17,axiom,
q0(X1,d),
file('/export/starexec/sandbox/tmp/tmp.RmvBjPOXbA/E---3.1_22697.p',axiom_17) ).
cnf(rule_125,axiom,
( s1(X1)
| ~ p0(X1,X1) ),
file('/export/starexec/sandbox/tmp/tmp.RmvBjPOXbA/E---3.1_22697.p',rule_125) ).
cnf(axiom_14,axiom,
p0(b,X1),
file('/export/starexec/sandbox/tmp/tmp.RmvBjPOXbA/E---3.1_22697.p',axiom_14) ).
cnf(rule_001,axiom,
( k1(X1)
| ~ n0(X2,X1) ),
file('/export/starexec/sandbox/tmp/tmp.RmvBjPOXbA/E---3.1_22697.p',rule_001) ).
cnf(axiom_3,axiom,
n0(d,e),
file('/export/starexec/sandbox/tmp/tmp.RmvBjPOXbA/E---3.1_22697.p',axiom_3) ).
cnf(rule_085,axiom,
( p1(X1,X1,X1)
| ~ p0(X2,X1) ),
file('/export/starexec/sandbox/tmp/tmp.RmvBjPOXbA/E---3.1_22697.p',rule_085) ).
cnf(rule_174,axiom,
( p2(X1,X1,X1)
| ~ n2(X1)
| ~ k1(e) ),
file('/export/starexec/sandbox/tmp/tmp.RmvBjPOXbA/E---3.1_22697.p',rule_174) ).
cnf(rule_137,axiom,
( n2(X1)
| ~ p1(X2,X3,X1) ),
file('/export/starexec/sandbox/tmp/tmp.RmvBjPOXbA/E---3.1_22697.p',rule_137) ).
cnf(rule_133,axiom,
( l2(X1,X1)
| ~ p0(X2,X2)
| ~ s1(X3)
| ~ m0(X4,X3,X1) ),
file('/export/starexec/sandbox/tmp/tmp.RmvBjPOXbA/E---3.1_22697.p',rule_133) ).
cnf(axiom_16,axiom,
m0(c,b,a),
file('/export/starexec/sandbox/tmp/tmp.RmvBjPOXbA/E---3.1_22697.p',axiom_16) ).
cnf(rule_240,axiom,
( n3(X1)
| ~ p2(X2,X3,X1) ),
file('/export/starexec/sandbox/tmp/tmp.RmvBjPOXbA/E---3.1_22697.p',rule_240) ).
cnf(rule_258,axiom,
( q3(X1,X1)
| ~ r2(X1)
| ~ s1(X2)
| ~ l2(X3,X3) ),
file('/export/starexec/sandbox/tmp/tmp.RmvBjPOXbA/E---3.1_22697.p',rule_258) ).
cnf(rule_298,axiom,
( r4(X1)
| ~ n3(X1)
| ~ q3(X2,X3)
| ~ p0(X4,X1) ),
file('/export/starexec/sandbox/tmp/tmp.RmvBjPOXbA/E---3.1_22697.p',rule_298) ).
cnf(rule_124,axiom,
( r1(X1)
| ~ q0(X1,X2)
| ~ s0(d)
| ~ q1(d,X2,d) ),
file('/export/starexec/sandbox/tmp/tmp.RmvBjPOXbA/E---3.1_22697.p',rule_124) ).
cnf(axiom_1,axiom,
s0(d),
file('/export/starexec/sandbox/tmp/tmp.RmvBjPOXbA/E---3.1_22697.p',axiom_1) ).
cnf(rule_110,axiom,
( q1(X1,X1,X1)
| ~ m0(X2,X3,X1) ),
file('/export/starexec/sandbox/tmp/tmp.RmvBjPOXbA/E---3.1_22697.p',rule_110) ).
cnf(axiom_19,axiom,
m0(X1,d,X2),
file('/export/starexec/sandbox/tmp/tmp.RmvBjPOXbA/E---3.1_22697.p',axiom_19) ).
cnf(rule_188,axiom,
( r2(X1)
| ~ r1(X1)
| ~ l0(X1) ),
file('/export/starexec/sandbox/tmp/tmp.RmvBjPOXbA/E---3.1_22697.p',rule_188) ).
cnf(axiom_24,axiom,
l0(c),
file('/export/starexec/sandbox/tmp/tmp.RmvBjPOXbA/E---3.1_22697.p',axiom_24) ).
cnf(prove_this,negated_conjecture,
~ r4(a),
file('/export/starexec/sandbox/tmp/tmp.RmvBjPOXbA/E---3.1_22697.p',prove_this) ).
cnf(c_0_21,axiom,
( s1(X1)
| ~ q0(X1,X2)
| ~ s1(X3) ),
rule_126 ).
cnf(c_0_22,axiom,
q0(X1,d),
axiom_17 ).
cnf(c_0_23,axiom,
( s1(X1)
| ~ p0(X1,X1) ),
rule_125 ).
cnf(c_0_24,axiom,
p0(b,X1),
axiom_14 ).
cnf(c_0_25,axiom,
( k1(X1)
| ~ n0(X2,X1) ),
rule_001 ).
cnf(c_0_26,axiom,
n0(d,e),
axiom_3 ).
cnf(c_0_27,axiom,
( p1(X1,X1,X1)
| ~ p0(X2,X1) ),
rule_085 ).
cnf(c_0_28,plain,
( s1(X1)
| ~ s1(X2) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_29,plain,
s1(b),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_30,axiom,
( p2(X1,X1,X1)
| ~ n2(X1)
| ~ k1(e) ),
rule_174 ).
cnf(c_0_31,plain,
k1(e),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_32,axiom,
( n2(X1)
| ~ p1(X2,X3,X1) ),
rule_137 ).
cnf(c_0_33,plain,
p1(X1,X1,X1),
inference(spm,[status(thm)],[c_0_27,c_0_24]) ).
cnf(c_0_34,axiom,
( l2(X1,X1)
| ~ p0(X2,X2)
| ~ s1(X3)
| ~ m0(X4,X3,X1) ),
rule_133 ).
cnf(c_0_35,plain,
s1(X1),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_36,plain,
( p2(X1,X1,X1)
| ~ n2(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_30,c_0_31])]) ).
cnf(c_0_37,plain,
n2(X1),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_38,plain,
( l2(X1,X1)
| ~ p0(X2,X2)
| ~ m0(X3,X4,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_34,c_0_35])]) ).
cnf(c_0_39,axiom,
m0(c,b,a),
axiom_16 ).
cnf(c_0_40,axiom,
( n3(X1)
| ~ p2(X2,X3,X1) ),
rule_240 ).
cnf(c_0_41,plain,
p2(X1,X1,X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_36,c_0_37])]) ).
cnf(c_0_42,axiom,
( q3(X1,X1)
| ~ r2(X1)
| ~ s1(X2)
| ~ l2(X3,X3) ),
rule_258 ).
cnf(c_0_43,plain,
( l2(a,a)
| ~ p0(X1,X1) ),
inference(spm,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_44,axiom,
( r4(X1)
| ~ n3(X1)
| ~ q3(X2,X3)
| ~ p0(X4,X1) ),
rule_298 ).
cnf(c_0_45,plain,
n3(X1),
inference(spm,[status(thm)],[c_0_40,c_0_41]) ).
cnf(c_0_46,plain,
( q3(X1,X1)
| ~ r2(X1)
| ~ l2(X2,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_42,c_0_35])]) ).
cnf(c_0_47,plain,
l2(a,a),
inference(spm,[status(thm)],[c_0_43,c_0_24]) ).
cnf(c_0_48,axiom,
( r1(X1)
| ~ q0(X1,X2)
| ~ s0(d)
| ~ q1(d,X2,d) ),
rule_124 ).
cnf(c_0_49,axiom,
s0(d),
axiom_1 ).
cnf(c_0_50,axiom,
( q1(X1,X1,X1)
| ~ m0(X2,X3,X1) ),
rule_110 ).
cnf(c_0_51,axiom,
m0(X1,d,X2),
axiom_19 ).
cnf(c_0_52,plain,
( r4(X1)
| ~ q3(X2,X3)
| ~ p0(X4,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_44,c_0_45])]) ).
cnf(c_0_53,plain,
( q3(X1,X1)
| ~ r2(X1) ),
inference(spm,[status(thm)],[c_0_46,c_0_47]) ).
cnf(c_0_54,plain,
( r1(X1)
| ~ q1(d,X2,d)
| ~ q0(X1,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_48,c_0_49])]) ).
cnf(c_0_55,plain,
q1(X1,X1,X1),
inference(spm,[status(thm)],[c_0_50,c_0_51]) ).
cnf(c_0_56,plain,
( r4(X1)
| ~ r2(X2)
| ~ p0(X3,X1) ),
inference(spm,[status(thm)],[c_0_52,c_0_53]) ).
cnf(c_0_57,axiom,
( r2(X1)
| ~ r1(X1)
| ~ l0(X1) ),
rule_188 ).
cnf(c_0_58,plain,
r1(X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_22]),c_0_55])]) ).
cnf(c_0_59,plain,
( r4(X1)
| ~ r2(X2) ),
inference(spm,[status(thm)],[c_0_56,c_0_24]) ).
cnf(c_0_60,plain,
( r2(X1)
| ~ l0(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_57,c_0_58])]) ).
cnf(c_0_61,plain,
( r4(X1)
| ~ l0(X2) ),
inference(spm,[status(thm)],[c_0_59,c_0_60]) ).
cnf(c_0_62,axiom,
l0(c),
axiom_24 ).
cnf(c_0_63,negated_conjecture,
~ r4(a),
prove_this ).
cnf(c_0_64,plain,
r4(X1),
inference(spm,[status(thm)],[c_0_61,c_0_62]) ).
cnf(c_0_65,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_63,c_0_64])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.15 % Problem : SYN192-1 : TPTP v8.1.2. Released v1.1.0.
% 0.11/0.16 % Command : run_E %s %d THM
% 0.17/0.37 % Computer : n007.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:09:09 EDT 2023
% 0.17/0.37 % CPUTime :
% 0.23/0.53 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.RmvBjPOXbA/E---3.1_22697.p
% 0.88/0.64 # Version: 3.1pre001
% 0.88/0.64 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.88/0.64 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.88/0.64 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.88/0.64 # Starting new_bool_3 with 300s (1) cores
% 0.88/0.64 # Starting new_bool_1 with 300s (1) cores
% 0.88/0.64 # Starting sh5l with 300s (1) cores
% 0.88/0.64 # sh5l with pid 22847 completed with status 0
% 0.88/0.64 # Result found by sh5l
% 0.88/0.64 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.88/0.64 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.88/0.64 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.88/0.64 # Starting new_bool_3 with 300s (1) cores
% 0.88/0.64 # Starting new_bool_1 with 300s (1) cores
% 0.88/0.64 # Starting sh5l with 300s (1) cores
% 0.88/0.64 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.88/0.64 # Search class: FHUNM-FSLM00-SFFFFFNN
% 0.88/0.64 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.88/0.64 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.88/0.64 # SAT001_MinMin_p005000_rr_RG with pid 22857 completed with status 0
% 0.88/0.64 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.88/0.64 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.88/0.64 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.88/0.64 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.88/0.64 # Starting new_bool_3 with 300s (1) cores
% 0.88/0.64 # Starting new_bool_1 with 300s (1) cores
% 0.88/0.64 # Starting sh5l with 300s (1) cores
% 0.88/0.64 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.88/0.64 # Search class: FHUNM-FSLM00-SFFFFFNN
% 0.88/0.64 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.88/0.64 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.88/0.64 # Preprocessing time : 0.005 s
% 0.88/0.64 # Presaturation interreduction done
% 0.88/0.64
% 0.88/0.64 # Proof found!
% 0.88/0.64 # SZS status Unsatisfiable
% 0.88/0.64 # SZS output start CNFRefutation
% See solution above
% 0.88/0.64 # Parsed axioms : 369
% 0.88/0.64 # Removed by relevancy pruning/SinE : 0
% 0.88/0.64 # Initial clauses : 369
% 0.88/0.64 # Removed in clause preprocessing : 7
% 0.88/0.64 # Initial clauses in saturation : 362
% 0.88/0.64 # Processed clauses : 948
% 0.88/0.64 # ...of these trivial : 36
% 0.88/0.64 # ...subsumed : 32
% 0.88/0.64 # ...remaining for further processing : 880
% 0.88/0.64 # Other redundant clauses eliminated : 0
% 0.88/0.64 # Clauses deleted for lack of memory : 0
% 0.88/0.64 # Backward-subsumed : 38
% 0.88/0.64 # Backward-rewritten : 194
% 0.88/0.64 # Generated clauses : 975
% 0.88/0.64 # ...of the previous two non-redundant : 613
% 0.88/0.64 # ...aggressively subsumed : 0
% 0.88/0.64 # Contextual simplify-reflections : 2
% 0.88/0.64 # Paramodulations : 975
% 0.88/0.64 # Factorizations : 0
% 0.88/0.64 # NegExts : 0
% 0.88/0.64 # Equation resolutions : 0
% 0.88/0.64 # Total rewrite steps : 842
% 0.88/0.64 # Propositional unsat checks : 0
% 0.88/0.64 # Propositional check models : 0
% 0.88/0.64 # Propositional check unsatisfiable : 0
% 0.88/0.64 # Propositional clauses : 0
% 0.88/0.64 # Propositional clauses after purity: 0
% 0.88/0.64 # Propositional unsat core size : 0
% 0.88/0.64 # Propositional preprocessing time : 0.000
% 0.88/0.64 # Propositional encoding time : 0.000
% 0.88/0.64 # Propositional solver time : 0.000
% 0.88/0.64 # Success case prop preproc time : 0.000
% 0.88/0.64 # Success case prop encoding time : 0.000
% 0.88/0.64 # Success case prop solver time : 0.000
% 0.88/0.64 # Current number of processed clauses : 321
% 0.88/0.64 # Positive orientable unit clauses : 114
% 0.88/0.64 # Positive unorientable unit clauses: 0
% 0.88/0.64 # Negative unit clauses : 0
% 0.88/0.64 # Non-unit-clauses : 207
% 0.88/0.64 # Current number of unprocessed clauses: 285
% 0.88/0.64 # ...number of literals in the above : 759
% 0.88/0.64 # Current number of archived formulas : 0
% 0.88/0.64 # Current number of archived clauses : 559
% 0.88/0.64 # Clause-clause subsumption calls (NU) : 42137
% 0.88/0.64 # Rec. Clause-clause subsumption calls : 29466
% 0.88/0.64 # Non-unit clause-clause subsumptions : 65
% 0.88/0.64 # Unit Clause-clause subsumption calls : 2340
% 0.88/0.64 # Rewrite failures with RHS unbound : 0
% 0.88/0.64 # BW rewrite match attempts : 284
% 0.88/0.64 # BW rewrite match successes : 136
% 0.88/0.64 # Condensation attempts : 0
% 0.88/0.64 # Condensation successes : 0
% 0.88/0.64 # Termbank termtop insertions : 20379
% 0.88/0.64
% 0.88/0.64 # -------------------------------------------------
% 0.88/0.64 # User time : 0.081 s
% 0.88/0.64 # System time : 0.009 s
% 0.88/0.64 # Total time : 0.090 s
% 0.88/0.64 # Maximum resident set size: 2524 pages
% 0.88/0.64
% 0.88/0.64 # -------------------------------------------------
% 0.88/0.64 # User time : 0.090 s
% 0.88/0.64 # System time : 0.011 s
% 0.88/0.64 # Total time : 0.100 s
% 0.88/0.64 # Maximum resident set size: 1996 pages
% 0.88/0.64 % E---3.1 exiting
% 1.05/0.64 % E---3.1 exiting
%------------------------------------------------------------------------------