TSTP Solution File: SYN180-1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SYN180-1 : TPTP v8.1.2. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n011.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:01 EDT 2023
% Result : Unsatisfiable 0.82s 0.64s
% Output : CNFRefutation 0.82s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 27
% Syntax : Number of clauses : 84 ( 39 unt; 0 nHn; 62 RR)
% Number of literals : 163 ( 0 equ; 81 neg)
% Maximal clause size : 5 ( 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 : 123 ( 43 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(rule_007,axiom,
( m1(X1,X2,X1)
| ~ p0(X3,X2)
| ~ r0(X1) ),
file('/export/starexec/sandbox/tmp/tmp.zlSXag00aB/E---3.1_17959.p',rule_007) ).
cnf(axiom_14,axiom,
p0(b,X1),
file('/export/starexec/sandbox/tmp/tmp.zlSXag00aB/E---3.1_17959.p',axiom_14) ).
cnf(axiom_13,axiom,
r0(e),
file('/export/starexec/sandbox/tmp/tmp.zlSXag00aB/E---3.1_17959.p',axiom_13) ).
cnf(rule_107,axiom,
( q1(e,X1,X1)
| ~ m0(X1,d,X1)
| ~ m0(e,d,X1) ),
file('/export/starexec/sandbox/tmp/tmp.zlSXag00aB/E---3.1_17959.p',rule_107) ).
cnf(axiom_19,axiom,
m0(X1,d,X2),
file('/export/starexec/sandbox/tmp/tmp.zlSXag00aB/E---3.1_17959.p',axiom_19) ).
cnf(rule_029,axiom,
( m1(X1,X2,X1)
| ~ p0(X1,X2)
| ~ s0(X1) ),
file('/export/starexec/sandbox/tmp/tmp.zlSXag00aB/E---3.1_17959.p',rule_029) ).
cnf(axiom_5,axiom,
s0(b),
file('/export/starexec/sandbox/tmp/tmp.zlSXag00aB/E---3.1_17959.p',axiom_5) ).
cnf(rule_127,axiom,
( k2(X1,X2)
| ~ m1(X3,X2,X1)
| ~ k1(X4)
| ~ k2(X4,X2) ),
file('/export/starexec/sandbox/tmp/tmp.zlSXag00aB/E---3.1_17959.p',rule_127) ).
cnf(rule_129,axiom,
( k2(X1,X1)
| ~ q1(X2,X1,X1) ),
file('/export/starexec/sandbox/tmp/tmp.zlSXag00aB/E---3.1_17959.p',rule_129) ).
cnf(rule_085,axiom,
( p1(X1,X1,X1)
| ~ p0(X2,X1) ),
file('/export/starexec/sandbox/tmp/tmp.zlSXag00aB/E---3.1_17959.p',rule_085) ).
cnf(rule_005,axiom,
( m1(X1,X2,X1)
| ~ m0(X2,X2,X1) ),
file('/export/starexec/sandbox/tmp/tmp.zlSXag00aB/E---3.1_17959.p',rule_005) ).
cnf(rule_001,axiom,
( k1(X1)
| ~ n0(X2,X1) ),
file('/export/starexec/sandbox/tmp/tmp.zlSXag00aB/E---3.1_17959.p',rule_001) ).
cnf(axiom_30,axiom,
n0(e,e),
file('/export/starexec/sandbox/tmp/tmp.zlSXag00aB/E---3.1_17959.p',axiom_30) ).
cnf(rule_124,axiom,
( r1(X1)
| ~ q0(X1,X2)
| ~ s0(d)
| ~ q1(d,X2,d) ),
file('/export/starexec/sandbox/tmp/tmp.zlSXag00aB/E---3.1_17959.p',rule_124) ).
cnf(axiom_1,axiom,
s0(d),
file('/export/starexec/sandbox/tmp/tmp.zlSXag00aB/E---3.1_17959.p',axiom_1) ).
cnf(rule_117,axiom,
( q1(d,d,d)
| ~ k0(e)
| ~ s0(d) ),
file('/export/starexec/sandbox/tmp/tmp.zlSXag00aB/E---3.1_17959.p',rule_117) ).
cnf(axiom_28,axiom,
k0(e),
file('/export/starexec/sandbox/tmp/tmp.zlSXag00aB/E---3.1_17959.p',axiom_28) ).
cnf(rule_137,axiom,
( n2(X1)
| ~ p1(X2,X3,X1) ),
file('/export/starexec/sandbox/tmp/tmp.zlSXag00aB/E---3.1_17959.p',rule_137) ).
cnf(axiom_11,axiom,
n0(e,b),
file('/export/starexec/sandbox/tmp/tmp.zlSXag00aB/E---3.1_17959.p',axiom_11) ).
cnf(axiom_34,axiom,
n0(c,d),
file('/export/starexec/sandbox/tmp/tmp.zlSXag00aB/E---3.1_17959.p',axiom_34) ).
cnf(axiom_17,axiom,
q0(X1,d),
file('/export/starexec/sandbox/tmp/tmp.zlSXag00aB/E---3.1_17959.p',axiom_17) ).
cnf(rule_236,axiom,
( m3(X1,X1,X1)
| ~ n2(X1) ),
file('/export/starexec/sandbox/tmp/tmp.zlSXag00aB/E---3.1_17959.p',rule_236) ).
cnf(rule_187,axiom,
( q2(X1,X2,X1)
| ~ r1(X2)
| ~ m0(X3,X4,X1)
| ~ k0(X2)
| ~ q2(X2,X2,X2) ),
file('/export/starexec/sandbox/tmp/tmp.zlSXag00aB/E---3.1_17959.p',rule_187) ).
cnf(rule_181,axiom,
( q2(X1,X1,X1)
| ~ p1(X1,X1,X1) ),
file('/export/starexec/sandbox/tmp/tmp.zlSXag00aB/E---3.1_17959.p',rule_181) ).
cnf(rule_295,axiom,
( q4(X1,X2)
| ~ k3(X3,X3,X1)
| ~ q2(X4,X2,X1)
| ~ m3(X4,X5,X4) ),
file('/export/starexec/sandbox/tmp/tmp.zlSXag00aB/E---3.1_17959.p',rule_295) ).
cnf(rule_194,axiom,
( k3(X1,X1,X2)
| ~ k2(X2,X1) ),
file('/export/starexec/sandbox/tmp/tmp.zlSXag00aB/E---3.1_17959.p',rule_194) ).
cnf(prove_this,negated_conjecture,
~ q4(a,e),
file('/export/starexec/sandbox/tmp/tmp.zlSXag00aB/E---3.1_17959.p',prove_this) ).
cnf(c_0_27,axiom,
( m1(X1,X2,X1)
| ~ p0(X3,X2)
| ~ r0(X1) ),
rule_007 ).
cnf(c_0_28,axiom,
p0(b,X1),
axiom_14 ).
cnf(c_0_29,plain,
( m1(X1,X2,X1)
| ~ r0(X1) ),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_30,axiom,
r0(e),
axiom_13 ).
cnf(c_0_31,axiom,
( q1(e,X1,X1)
| ~ m0(X1,d,X1)
| ~ m0(e,d,X1) ),
rule_107 ).
cnf(c_0_32,axiom,
m0(X1,d,X2),
axiom_19 ).
cnf(c_0_33,axiom,
( m1(X1,X2,X1)
| ~ p0(X1,X2)
| ~ s0(X1) ),
rule_029 ).
cnf(c_0_34,axiom,
s0(b),
axiom_5 ).
cnf(c_0_35,axiom,
( k2(X1,X2)
| ~ m1(X3,X2,X1)
| ~ k1(X4)
| ~ k2(X4,X2) ),
rule_127 ).
cnf(c_0_36,plain,
m1(e,X1,e),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_37,axiom,
( k2(X1,X1)
| ~ q1(X2,X1,X1) ),
rule_129 ).
cnf(c_0_38,plain,
q1(e,X1,X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_31,c_0_32]),c_0_32])]) ).
cnf(c_0_39,axiom,
( p1(X1,X1,X1)
| ~ p0(X2,X1) ),
rule_085 ).
cnf(c_0_40,axiom,
( m1(X1,X2,X1)
| ~ m0(X2,X2,X1) ),
rule_005 ).
cnf(c_0_41,plain,
m1(b,X1,b),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_28]),c_0_34])]) ).
cnf(c_0_42,plain,
( k2(e,X1)
| ~ k2(X2,X1)
| ~ k1(X2) ),
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_43,plain,
k2(X1,X1),
inference(spm,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_44,axiom,
( k1(X1)
| ~ n0(X2,X1) ),
rule_001 ).
cnf(c_0_45,axiom,
n0(e,e),
axiom_30 ).
cnf(c_0_46,axiom,
( r1(X1)
| ~ q0(X1,X2)
| ~ s0(d)
| ~ q1(d,X2,d) ),
rule_124 ).
cnf(c_0_47,axiom,
s0(d),
axiom_1 ).
cnf(c_0_48,axiom,
( q1(d,d,d)
| ~ k0(e)
| ~ s0(d) ),
rule_117 ).
cnf(c_0_49,axiom,
k0(e),
axiom_28 ).
cnf(c_0_50,axiom,
( n2(X1)
| ~ p1(X2,X3,X1) ),
rule_137 ).
cnf(c_0_51,plain,
p1(X1,X1,X1),
inference(spm,[status(thm)],[c_0_39,c_0_28]) ).
cnf(c_0_52,plain,
m1(X1,d,X1),
inference(spm,[status(thm)],[c_0_40,c_0_32]) ).
cnf(c_0_53,plain,
( k2(b,X1)
| ~ k2(X2,X1)
| ~ k1(X2) ),
inference(spm,[status(thm)],[c_0_35,c_0_41]) ).
cnf(c_0_54,plain,
( k2(e,X1)
| ~ k1(X1) ),
inference(spm,[status(thm)],[c_0_42,c_0_43]) ).
cnf(c_0_55,plain,
k1(e),
inference(spm,[status(thm)],[c_0_44,c_0_45]) ).
cnf(c_0_56,axiom,
n0(e,b),
axiom_11 ).
cnf(c_0_57,axiom,
n0(c,d),
axiom_34 ).
cnf(c_0_58,plain,
( r1(X1)
| ~ q1(d,X2,d)
| ~ q0(X1,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_46,c_0_47])]) ).
cnf(c_0_59,axiom,
q0(X1,d),
axiom_17 ).
cnf(c_0_60,plain,
q1(d,d,d),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_48,c_0_47]),c_0_49])]) ).
cnf(c_0_61,axiom,
( m3(X1,X1,X1)
| ~ n2(X1) ),
rule_236 ).
cnf(c_0_62,plain,
n2(X1),
inference(spm,[status(thm)],[c_0_50,c_0_51]) ).
cnf(c_0_63,plain,
( k2(X1,d)
| ~ k2(X2,d)
| ~ k1(X2) ),
inference(spm,[status(thm)],[c_0_35,c_0_52]) ).
cnf(c_0_64,plain,
( k2(b,X1)
| ~ k1(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_54]),c_0_55])]) ).
cnf(c_0_65,plain,
k1(b),
inference(spm,[status(thm)],[c_0_44,c_0_56]) ).
cnf(c_0_66,plain,
k1(d),
inference(spm,[status(thm)],[c_0_44,c_0_57]) ).
cnf(c_0_67,axiom,
( q2(X1,X2,X1)
| ~ r1(X2)
| ~ m0(X3,X4,X1)
| ~ k0(X2)
| ~ q2(X2,X2,X2) ),
rule_187 ).
cnf(c_0_68,plain,
r1(X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_59]),c_0_60])]) ).
cnf(c_0_69,axiom,
( q2(X1,X1,X1)
| ~ p1(X1,X1,X1) ),
rule_181 ).
cnf(c_0_70,axiom,
( q4(X1,X2)
| ~ k3(X3,X3,X1)
| ~ q2(X4,X2,X1)
| ~ m3(X4,X5,X4) ),
rule_295 ).
cnf(c_0_71,plain,
m3(X1,X1,X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_61,c_0_62])]) ).
cnf(c_0_72,axiom,
( k3(X1,X1,X2)
| ~ k2(X2,X1) ),
rule_194 ).
cnf(c_0_73,plain,
k2(X1,d),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_63,c_0_64]),c_0_65]),c_0_66])]) ).
cnf(c_0_74,plain,
( q2(X1,X2,X1)
| ~ q2(X2,X2,X2)
| ~ k0(X2)
| ~ m0(X3,X4,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_67,c_0_68])]) ).
cnf(c_0_75,plain,
q2(X1,X1,X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_69,c_0_51])]) ).
cnf(c_0_76,plain,
( q4(X1,X2)
| ~ k3(X3,X3,X1)
| ~ q2(X4,X2,X1) ),
inference(spm,[status(thm)],[c_0_70,c_0_71]) ).
cnf(c_0_77,plain,
k3(d,d,X1),
inference(spm,[status(thm)],[c_0_72,c_0_73]) ).
cnf(c_0_78,plain,
( q2(X1,X2,X1)
| ~ k0(X2)
| ~ m0(X3,X4,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_74,c_0_75])]) ).
cnf(c_0_79,plain,
( q4(X1,X2)
| ~ q2(X3,X2,X1) ),
inference(spm,[status(thm)],[c_0_76,c_0_77]) ).
cnf(c_0_80,plain,
( q2(X1,X2,X1)
| ~ k0(X2) ),
inference(spm,[status(thm)],[c_0_78,c_0_32]) ).
cnf(c_0_81,negated_conjecture,
~ q4(a,e),
prove_this ).
cnf(c_0_82,plain,
( q4(X1,X2)
| ~ k0(X2) ),
inference(spm,[status(thm)],[c_0_79,c_0_80]) ).
cnf(c_0_83,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_81,c_0_82]),c_0_49])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.14 % Problem : SYN180-1 : TPTP v8.1.2. Released v1.1.0.
% 0.11/0.15 % Command : run_E %s %d THM
% 0.16/0.36 % Computer : n011.cluster.edu
% 0.16/0.36 % Model : x86_64 x86_64
% 0.16/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.36 % Memory : 8042.1875MB
% 0.16/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.36 % CPULimit : 2400
% 0.16/0.36 % WCLimit : 300
% 0.16/0.36 % DateTime : Mon Oct 2 18:30:53 EDT 2023
% 0.16/0.36 % CPUTime :
% 0.22/0.51 Running first-order theorem proving
% 0.22/0.51 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.zlSXag00aB/E---3.1_17959.p
% 0.82/0.64 # Version: 3.1pre001
% 0.82/0.64 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.82/0.64 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.82/0.64 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.82/0.64 # Starting new_bool_3 with 300s (1) cores
% 0.82/0.64 # Starting new_bool_1 with 300s (1) cores
% 0.82/0.64 # Starting sh5l with 300s (1) cores
% 0.82/0.64 # new_bool_3 with pid 18038 completed with status 0
% 0.82/0.64 # Result found by new_bool_3
% 0.82/0.64 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.82/0.64 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.82/0.64 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.82/0.64 # Starting new_bool_3 with 300s (1) cores
% 0.82/0.64 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.82/0.64 # Search class: FHUNM-FSLM00-SFFFFFNN
% 0.82/0.64 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.82/0.64 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.82/0.64 # SAT001_MinMin_p005000_rr_RG with pid 18045 completed with status 0
% 0.82/0.64 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.82/0.64 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.82/0.64 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.82/0.64 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.82/0.64 # Starting new_bool_3 with 300s (1) cores
% 0.82/0.64 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.82/0.64 # Search class: FHUNM-FSLM00-SFFFFFNN
% 0.82/0.64 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.82/0.64 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.82/0.64 # Preprocessing time : 0.005 s
% 0.82/0.64 # Presaturation interreduction done
% 0.82/0.64
% 0.82/0.64 # Proof found!
% 0.82/0.64 # SZS status Unsatisfiable
% 0.82/0.64 # SZS output start CNFRefutation
% See solution above
% 0.82/0.64 # Parsed axioms : 369
% 0.82/0.64 # Removed by relevancy pruning/SinE : 31
% 0.82/0.64 # Initial clauses : 338
% 0.82/0.64 # Removed in clause preprocessing : 6
% 0.82/0.64 # Initial clauses in saturation : 332
% 0.82/0.64 # Processed clauses : 1418
% 0.82/0.64 # ...of these trivial : 71
% 0.82/0.64 # ...subsumed : 127
% 0.82/0.64 # ...remaining for further processing : 1220
% 0.82/0.64 # Other redundant clauses eliminated : 0
% 0.82/0.64 # Clauses deleted for lack of memory : 0
% 0.82/0.64 # Backward-subsumed : 107
% 0.82/0.64 # Backward-rewritten : 314
% 0.82/0.64 # Generated clauses : 2053
% 0.82/0.64 # ...of the previous two non-redundant : 1490
% 0.82/0.64 # ...aggressively subsumed : 0
% 0.82/0.64 # Contextual simplify-reflections : 1
% 0.82/0.64 # Paramodulations : 2053
% 0.82/0.64 # Factorizations : 0
% 0.82/0.64 # NegExts : 0
% 0.82/0.64 # Equation resolutions : 0
% 0.82/0.64 # Total rewrite steps : 1418
% 0.82/0.64 # Propositional unsat checks : 0
% 0.82/0.64 # Propositional check models : 0
% 0.82/0.64 # Propositional check unsatisfiable : 0
% 0.82/0.64 # Propositional clauses : 0
% 0.82/0.64 # Propositional clauses after purity: 0
% 0.82/0.64 # Propositional unsat core size : 0
% 0.82/0.64 # Propositional preprocessing time : 0.000
% 0.82/0.64 # Propositional encoding time : 0.000
% 0.82/0.64 # Propositional solver time : 0.000
% 0.82/0.64 # Success case prop preproc time : 0.000
% 0.82/0.64 # Success case prop encoding time : 0.000
% 0.82/0.64 # Success case prop solver time : 0.000
% 0.82/0.64 # Current number of processed clauses : 501
% 0.82/0.64 # Positive orientable unit clauses : 210
% 0.82/0.64 # Positive unorientable unit clauses: 0
% 0.82/0.64 # Negative unit clauses : 3
% 0.82/0.64 # Non-unit-clauses : 288
% 0.82/0.64 # Current number of unprocessed clauses: 283
% 0.82/0.64 # ...number of literals in the above : 904
% 0.82/0.64 # Current number of archived formulas : 0
% 0.82/0.64 # Current number of archived clauses : 719
% 0.82/0.64 # Clause-clause subsumption calls (NU) : 55794
% 0.82/0.64 # Rec. Clause-clause subsumption calls : 42514
% 0.82/0.64 # Non-unit clause-clause subsumptions : 221
% 0.82/0.64 # Unit Clause-clause subsumption calls : 3985
% 0.82/0.64 # Rewrite failures with RHS unbound : 0
% 0.82/0.64 # BW rewrite match attempts : 785
% 0.82/0.64 # BW rewrite match successes : 212
% 0.82/0.64 # Condensation attempts : 0
% 0.82/0.64 # Condensation successes : 0
% 0.82/0.64 # Termbank termtop insertions : 31000
% 0.82/0.64
% 0.82/0.64 # -------------------------------------------------
% 0.82/0.64 # User time : 0.107 s
% 0.82/0.64 # System time : 0.006 s
% 0.82/0.64 # Total time : 0.113 s
% 0.82/0.64 # Maximum resident set size: 2596 pages
% 0.82/0.64
% 0.82/0.64 # -------------------------------------------------
% 0.82/0.64 # User time : 0.114 s
% 0.82/0.64 # System time : 0.008 s
% 0.82/0.64 # Total time : 0.121 s
% 0.82/0.64 # Maximum resident set size: 2000 pages
% 0.82/0.64 % E---3.1 exiting
% 0.82/0.64 % E---3.1 exiting
%------------------------------------------------------------------------------