TSTP Solution File: SYN155-1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SYN155-1 : TPTP v8.1.2. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n019.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:13:57 EDT 2023
% Result : Unsatisfiable 0.79s 0.63s
% Output : CNFRefutation 0.79s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 28
% Syntax : Number of clauses : 84 ( 38 unt; 0 nHn; 74 RR)
% Number of literals : 162 ( 0 equ; 84 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 24 ( 23 usr; 1 prp; 0-3 aty)
% Number of functors : 5 ( 5 usr; 5 con; 0-0 aty)
% Number of variables : 105 ( 42 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(rule_088,axiom,
( p1(a,a,a)
| ~ l0(a) ),
file('/export/starexec/sandbox2/tmp/tmp.kPNRnh7SOo/E---3.1_3766.p',rule_088) ).
cnf(axiom_20,axiom,
l0(a),
file('/export/starexec/sandbox2/tmp/tmp.kPNRnh7SOo/E---3.1_3766.p',axiom_20) ).
cnf(rule_021,axiom,
( m1(X1,X2,X1)
| ~ l0(X1)
| ~ k0(X2) ),
file('/export/starexec/sandbox2/tmp/tmp.kPNRnh7SOo/E---3.1_3766.p',rule_021) ).
cnf(axiom_28,axiom,
k0(e),
file('/export/starexec/sandbox2/tmp/tmp.kPNRnh7SOo/E---3.1_3766.p',axiom_28) ).
cnf(rule_087,axiom,
( p1(a,b,a)
| ~ r0(b)
| ~ p1(a,a,a) ),
file('/export/starexec/sandbox2/tmp/tmp.kPNRnh7SOo/E---3.1_3766.p',rule_087) ).
cnf(axiom_9,axiom,
r0(b),
file('/export/starexec/sandbox2/tmp/tmp.kPNRnh7SOo/E---3.1_3766.p',axiom_9) ).
cnf(rule_126,axiom,
( s1(X1)
| ~ q0(X1,X2)
| ~ s1(X3) ),
file('/export/starexec/sandbox2/tmp/tmp.kPNRnh7SOo/E---3.1_3766.p',rule_126) ).
cnf(axiom_17,axiom,
q0(X1,d),
file('/export/starexec/sandbox2/tmp/tmp.kPNRnh7SOo/E---3.1_3766.p',axiom_17) ).
cnf(rule_125,axiom,
( s1(X1)
| ~ p0(X1,X1) ),
file('/export/starexec/sandbox2/tmp/tmp.kPNRnh7SOo/E---3.1_3766.p',rule_125) ).
cnf(axiom_14,axiom,
p0(b,X1),
file('/export/starexec/sandbox2/tmp/tmp.kPNRnh7SOo/E---3.1_3766.p',axiom_14) ).
cnf(rule_137,axiom,
( n2(X1)
| ~ p1(X2,X3,X1) ),
file('/export/starexec/sandbox2/tmp/tmp.kPNRnh7SOo/E---3.1_3766.p',rule_137) ).
cnf(rule_176,axiom,
( p2(X1,X2,X1)
| ~ m1(X2,X1,X2) ),
file('/export/starexec/sandbox2/tmp/tmp.kPNRnh7SOo/E---3.1_3766.p',rule_176) ).
cnf(rule_236,axiom,
( m3(X1,X1,X1)
| ~ n2(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.kPNRnh7SOo/E---3.1_3766.p',rule_236) ).
cnf(rule_155,axiom,
( p2(X1,X2,X2)
| ~ k1(X3)
| ~ p2(e,X1,X2) ),
file('/export/starexec/sandbox2/tmp/tmp.kPNRnh7SOo/E---3.1_3766.p',rule_155) ).
cnf(rule_001,axiom,
( k1(X1)
| ~ n0(X2,X1) ),
file('/export/starexec/sandbox2/tmp/tmp.kPNRnh7SOo/E---3.1_3766.p',rule_001) ).
cnf(axiom_26,axiom,
n0(d,c),
file('/export/starexec/sandbox2/tmp/tmp.kPNRnh7SOo/E---3.1_3766.p',axiom_26) ).
cnf(rule_133,axiom,
( l2(X1,X1)
| ~ p0(X2,X2)
| ~ s1(X3)
| ~ m0(X4,X3,X1) ),
file('/export/starexec/sandbox2/tmp/tmp.kPNRnh7SOo/E---3.1_3766.p',rule_133) ).
cnf(rule_284,axiom,
( n4(X1,X1)
| ~ k4(X2)
| ~ m3(X1,X1,X1) ),
file('/export/starexec/sandbox2/tmp/tmp.kPNRnh7SOo/E---3.1_3766.p',rule_284) ).
cnf(prove_this,negated_conjecture,
~ n4(X1,a),
file('/export/starexec/sandbox2/tmp/tmp.kPNRnh7SOo/E---3.1_3766.p',prove_this) ).
cnf(axiom_16,axiom,
m0(c,b,a),
file('/export/starexec/sandbox2/tmp/tmp.kPNRnh7SOo/E---3.1_3766.p',axiom_16) ).
cnf(rule_276,axiom,
( k4(e)
| ~ q3(X1,X1)
| ~ q1(a,a,X2)
| ~ r3(X1,e,X2) ),
file('/export/starexec/sandbox2/tmp/tmp.kPNRnh7SOo/E---3.1_3766.p',rule_276) ).
cnf(rule_267,axiom,
( r3(X1,X2,X1)
| ~ p2(X1,X3,X2) ),
file('/export/starexec/sandbox2/tmp/tmp.kPNRnh7SOo/E---3.1_3766.p',rule_267) ).
cnf(rule_110,axiom,
( q1(X1,X1,X1)
| ~ m0(X2,X3,X1) ),
file('/export/starexec/sandbox2/tmp/tmp.kPNRnh7SOo/E---3.1_3766.p',rule_110) ).
cnf(axiom_19,axiom,
m0(X1,d,X2),
file('/export/starexec/sandbox2/tmp/tmp.kPNRnh7SOo/E---3.1_3766.p',axiom_19) ).
cnf(rule_258,axiom,
( q3(X1,X1)
| ~ r2(X1)
| ~ s1(X2)
| ~ l2(X3,X3) ),
file('/export/starexec/sandbox2/tmp/tmp.kPNRnh7SOo/E---3.1_3766.p',rule_258) ).
cnf(rule_124,axiom,
( r1(X1)
| ~ q0(X1,X2)
| ~ s0(d)
| ~ q1(d,X2,d) ),
file('/export/starexec/sandbox2/tmp/tmp.kPNRnh7SOo/E---3.1_3766.p',rule_124) ).
cnf(axiom_1,axiom,
s0(d),
file('/export/starexec/sandbox2/tmp/tmp.kPNRnh7SOo/E---3.1_3766.p',axiom_1) ).
cnf(rule_188,axiom,
( r2(X1)
| ~ r1(X1)
| ~ l0(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.kPNRnh7SOo/E---3.1_3766.p',rule_188) ).
cnf(c_0_28,axiom,
( p1(a,a,a)
| ~ l0(a) ),
rule_088 ).
cnf(c_0_29,axiom,
l0(a),
axiom_20 ).
cnf(c_0_30,axiom,
( m1(X1,X2,X1)
| ~ l0(X1)
| ~ k0(X2) ),
rule_021 ).
cnf(c_0_31,axiom,
k0(e),
axiom_28 ).
cnf(c_0_32,axiom,
( p1(a,b,a)
| ~ r0(b)
| ~ p1(a,a,a) ),
rule_087 ).
cnf(c_0_33,axiom,
r0(b),
axiom_9 ).
cnf(c_0_34,plain,
p1(a,a,a),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_28,c_0_29])]) ).
cnf(c_0_35,plain,
( m1(X1,e,X1)
| ~ l0(X1) ),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_36,axiom,
( s1(X1)
| ~ q0(X1,X2)
| ~ s1(X3) ),
rule_126 ).
cnf(c_0_37,axiom,
q0(X1,d),
axiom_17 ).
cnf(c_0_38,axiom,
( s1(X1)
| ~ p0(X1,X1) ),
rule_125 ).
cnf(c_0_39,axiom,
p0(b,X1),
axiom_14 ).
cnf(c_0_40,axiom,
( n2(X1)
| ~ p1(X2,X3,X1) ),
rule_137 ).
cnf(c_0_41,plain,
p1(a,b,a),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_32,c_0_33]),c_0_34])]) ).
cnf(c_0_42,axiom,
( p2(X1,X2,X1)
| ~ m1(X2,X1,X2) ),
rule_176 ).
cnf(c_0_43,plain,
m1(a,e,a),
inference(spm,[status(thm)],[c_0_35,c_0_29]) ).
cnf(c_0_44,plain,
( s1(X1)
| ~ s1(X2) ),
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_45,plain,
s1(b),
inference(spm,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_46,axiom,
( m3(X1,X1,X1)
| ~ n2(X1) ),
rule_236 ).
cnf(c_0_47,plain,
n2(a),
inference(spm,[status(thm)],[c_0_40,c_0_41]) ).
cnf(c_0_48,axiom,
( p2(X1,X2,X2)
| ~ k1(X3)
| ~ p2(e,X1,X2) ),
rule_155 ).
cnf(c_0_49,plain,
p2(e,a,e),
inference(spm,[status(thm)],[c_0_42,c_0_43]) ).
cnf(c_0_50,axiom,
( k1(X1)
| ~ n0(X2,X1) ),
rule_001 ).
cnf(c_0_51,axiom,
n0(d,c),
axiom_26 ).
cnf(c_0_52,axiom,
( l2(X1,X1)
| ~ p0(X2,X2)
| ~ s1(X3)
| ~ m0(X4,X3,X1) ),
rule_133 ).
cnf(c_0_53,plain,
s1(X1),
inference(spm,[status(thm)],[c_0_44,c_0_45]) ).
cnf(c_0_54,axiom,
( n4(X1,X1)
| ~ k4(X2)
| ~ m3(X1,X1,X1) ),
rule_284 ).
cnf(c_0_55,plain,
m3(a,a,a),
inference(spm,[status(thm)],[c_0_46,c_0_47]) ).
cnf(c_0_56,negated_conjecture,
~ n4(X1,a),
prove_this ).
cnf(c_0_57,plain,
( p2(a,e,e)
| ~ k1(X1) ),
inference(spm,[status(thm)],[c_0_48,c_0_49]) ).
cnf(c_0_58,plain,
k1(c),
inference(spm,[status(thm)],[c_0_50,c_0_51]) ).
cnf(c_0_59,plain,
( l2(X1,X1)
| ~ p0(X2,X2)
| ~ m0(X3,X4,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_52,c_0_53])]) ).
cnf(c_0_60,axiom,
m0(c,b,a),
axiom_16 ).
cnf(c_0_61,axiom,
( k4(e)
| ~ q3(X1,X1)
| ~ q1(a,a,X2)
| ~ r3(X1,e,X2) ),
rule_276 ).
cnf(c_0_62,plain,
~ k4(X1),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_55]),c_0_56]) ).
cnf(c_0_63,axiom,
( r3(X1,X2,X1)
| ~ p2(X1,X3,X2) ),
rule_267 ).
cnf(c_0_64,plain,
p2(a,e,e),
inference(spm,[status(thm)],[c_0_57,c_0_58]) ).
cnf(c_0_65,axiom,
( q1(X1,X1,X1)
| ~ m0(X2,X3,X1) ),
rule_110 ).
cnf(c_0_66,axiom,
m0(X1,d,X2),
axiom_19 ).
cnf(c_0_67,axiom,
( q3(X1,X1)
| ~ r2(X1)
| ~ s1(X2)
| ~ l2(X3,X3) ),
rule_258 ).
cnf(c_0_68,plain,
( l2(a,a)
| ~ p0(X1,X1) ),
inference(spm,[status(thm)],[c_0_59,c_0_60]) ).
cnf(c_0_69,axiom,
( r1(X1)
| ~ q0(X1,X2)
| ~ s0(d)
| ~ q1(d,X2,d) ),
rule_124 ).
cnf(c_0_70,axiom,
s0(d),
axiom_1 ).
cnf(c_0_71,plain,
( ~ r3(X1,e,X2)
| ~ q3(X1,X1)
| ~ q1(a,a,X2) ),
inference(sr,[status(thm)],[c_0_61,c_0_62]) ).
cnf(c_0_72,plain,
r3(a,e,a),
inference(spm,[status(thm)],[c_0_63,c_0_64]) ).
cnf(c_0_73,plain,
q1(X1,X1,X1),
inference(spm,[status(thm)],[c_0_65,c_0_66]) ).
cnf(c_0_74,plain,
( q3(X1,X1)
| ~ r2(X1)
| ~ l2(X2,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_67,c_0_53])]) ).
cnf(c_0_75,plain,
l2(a,a),
inference(spm,[status(thm)],[c_0_68,c_0_39]) ).
cnf(c_0_76,plain,
( r1(X1)
| ~ q1(d,X2,d)
| ~ q0(X1,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_69,c_0_70])]) ).
cnf(c_0_77,plain,
~ q3(a,a),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_71,c_0_72]),c_0_73])]) ).
cnf(c_0_78,plain,
( q3(X1,X1)
| ~ r2(X1) ),
inference(spm,[status(thm)],[c_0_74,c_0_75]) ).
cnf(c_0_79,axiom,
( r2(X1)
| ~ r1(X1)
| ~ l0(X1) ),
rule_188 ).
cnf(c_0_80,plain,
r1(X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_76,c_0_37]),c_0_73])]) ).
cnf(c_0_81,plain,
~ r2(a),
inference(spm,[status(thm)],[c_0_77,c_0_78]) ).
cnf(c_0_82,plain,
( r2(X1)
| ~ l0(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_79,c_0_80])]) ).
cnf(c_0_83,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_81,c_0_82]),c_0_29])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.15 % Problem : SYN155-1 : TPTP v8.1.2. Released v1.1.0.
% 0.09/0.16 % Command : run_E %s %d THM
% 0.15/0.38 % Computer : n019.cluster.edu
% 0.15/0.38 % Model : x86_64 x86_64
% 0.15/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.38 % Memory : 8042.1875MB
% 0.15/0.38 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.38 % CPULimit : 2400
% 0.15/0.38 % WCLimit : 300
% 0.15/0.38 % DateTime : Mon Oct 2 18:33:36 EDT 2023
% 0.15/0.38 % CPUTime :
% 0.22/0.54 Running first-order theorem proving
% 0.22/0.54 Running: /export/starexec/sandbox2/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/sandbox2/tmp/tmp.kPNRnh7SOo/E---3.1_3766.p
% 0.79/0.63 # Version: 3.1pre001
% 0.79/0.63 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.79/0.63 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.79/0.63 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.79/0.63 # Starting new_bool_3 with 300s (1) cores
% 0.79/0.63 # Starting new_bool_1 with 300s (1) cores
% 0.79/0.63 # Starting sh5l with 300s (1) cores
% 0.79/0.63 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 3844 completed with status 0
% 0.79/0.63 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.79/0.63 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.79/0.63 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.79/0.63 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.79/0.63 # No SInE strategy applied
% 0.79/0.63 # Search class: FHUNM-FSLM00-SFFFFFNN
% 0.79/0.63 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.79/0.63 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.79/0.63 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.79/0.63 # Starting new_bool_3 with 136s (1) cores
% 0.79/0.63 # Starting new_bool_1 with 136s (1) cores
% 0.79/0.63 # Starting sh5l with 136s (1) cores
% 0.79/0.63 # SAT001_MinMin_p005000_rr_RG with pid 3848 completed with status 0
% 0.79/0.63 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.79/0.63 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.79/0.63 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.79/0.63 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.79/0.63 # No SInE strategy applied
% 0.79/0.63 # Search class: FHUNM-FSLM00-SFFFFFNN
% 0.79/0.63 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.79/0.63 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.79/0.63 # Preprocessing time : 0.005 s
% 0.79/0.63 # Presaturation interreduction done
% 0.79/0.63
% 0.79/0.63 # Proof found!
% 0.79/0.63 # SZS status Unsatisfiable
% 0.79/0.63 # SZS output start CNFRefutation
% See solution above
% 0.79/0.63 # Parsed axioms : 369
% 0.79/0.63 # Removed by relevancy pruning/SinE : 0
% 0.79/0.63 # Initial clauses : 369
% 0.79/0.63 # Removed in clause preprocessing : 7
% 0.79/0.63 # Initial clauses in saturation : 362
% 0.79/0.63 # Processed clauses : 928
% 0.79/0.63 # ...of these trivial : 40
% 0.79/0.63 # ...subsumed : 28
% 0.79/0.63 # ...remaining for further processing : 860
% 0.79/0.63 # Other redundant clauses eliminated : 0
% 0.79/0.63 # Clauses deleted for lack of memory : 0
% 0.79/0.63 # Backward-subsumed : 32
% 0.79/0.63 # Backward-rewritten : 174
% 0.79/0.63 # Generated clauses : 929
% 0.79/0.63 # ...of the previous two non-redundant : 557
% 0.79/0.63 # ...aggressively subsumed : 0
% 0.79/0.63 # Contextual simplify-reflections : 2
% 0.79/0.63 # Paramodulations : 929
% 0.79/0.63 # Factorizations : 0
% 0.79/0.63 # NegExts : 0
% 0.79/0.63 # Equation resolutions : 0
% 0.79/0.63 # Total rewrite steps : 827
% 0.79/0.63 # Propositional unsat checks : 0
% 0.79/0.63 # Propositional check models : 0
% 0.79/0.63 # Propositional check unsatisfiable : 0
% 0.79/0.63 # Propositional clauses : 0
% 0.79/0.63 # Propositional clauses after purity: 0
% 0.79/0.63 # Propositional unsat core size : 0
% 0.79/0.63 # Propositional preprocessing time : 0.000
% 0.79/0.63 # Propositional encoding time : 0.000
% 0.79/0.63 # Propositional solver time : 0.000
% 0.79/0.63 # Success case prop preproc time : 0.000
% 0.79/0.63 # Success case prop encoding time : 0.000
% 0.79/0.63 # Success case prop solver time : 0.000
% 0.79/0.63 # Current number of processed clauses : 326
% 0.79/0.63 # Positive orientable unit clauses : 118
% 0.79/0.63 # Positive unorientable unit clauses: 0
% 0.79/0.63 # Negative unit clauses : 5
% 0.79/0.63 # Non-unit-clauses : 203
% 0.79/0.63 # Current number of unprocessed clauses: 260
% 0.79/0.63 # ...number of literals in the above : 679
% 0.79/0.63 # Current number of archived formulas : 0
% 0.79/0.63 # Current number of archived clauses : 534
% 0.79/0.63 # Clause-clause subsumption calls (NU) : 38603
% 0.79/0.63 # Rec. Clause-clause subsumption calls : 26633
% 0.79/0.63 # Non-unit clause-clause subsumptions : 49
% 0.79/0.63 # Unit Clause-clause subsumption calls : 1947
% 0.79/0.63 # Rewrite failures with RHS unbound : 0
% 0.79/0.63 # BW rewrite match attempts : 242
% 0.79/0.63 # BW rewrite match successes : 124
% 0.79/0.63 # Condensation attempts : 0
% 0.79/0.63 # Condensation successes : 0
% 0.79/0.63 # Termbank termtop insertions : 19819
% 0.79/0.63
% 0.79/0.63 # -------------------------------------------------
% 0.79/0.63 # User time : 0.067 s
% 0.79/0.63 # System time : 0.008 s
% 0.79/0.63 # Total time : 0.074 s
% 0.79/0.63 # Maximum resident set size: 2484 pages
% 0.79/0.63
% 0.79/0.63 # -------------------------------------------------
% 0.79/0.63 # User time : 0.332 s
% 0.79/0.63 # System time : 0.019 s
% 0.79/0.63 # Total time : 0.351 s
% 0.79/0.63 # Maximum resident set size: 1996 pages
% 0.79/0.63 % E---3.1 exiting
% 0.79/0.63 % E---3.1 exiting
%------------------------------------------------------------------------------