TSTP Solution File: SYN162-1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SYN162-1 : TPTP v8.1.2. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n031.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:58 EDT 2023
% Result : Unsatisfiable 0.20s 0.54s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 15
% Syntax : Number of clauses : 44 ( 19 unt; 0 nHn; 33 RR)
% Number of literals : 76 ( 0 equ; 34 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 13 ( 12 usr; 1 prp; 0-3 aty)
% Number of functors : 3 ( 3 usr; 3 con; 0-0 aty)
% Number of variables : 57 ( 27 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(rule_126,axiom,
( s1(X1)
| ~ q0(X1,X2)
| ~ s1(X3) ),
file('/export/starexec/sandbox/tmp/tmp.LRQUwaErOc/E---3.1_19150.p',rule_126) ).
cnf(axiom_17,axiom,
q0(X1,d),
file('/export/starexec/sandbox/tmp/tmp.LRQUwaErOc/E---3.1_19150.p',axiom_17) ).
cnf(rule_125,axiom,
( s1(X1)
| ~ p0(X1,X1) ),
file('/export/starexec/sandbox/tmp/tmp.LRQUwaErOc/E---3.1_19150.p',rule_125) ).
cnf(axiom_14,axiom,
p0(b,X1),
file('/export/starexec/sandbox/tmp/tmp.LRQUwaErOc/E---3.1_19150.p',axiom_14) ).
cnf(rule_001,axiom,
( k1(X1)
| ~ n0(X2,X1) ),
file('/export/starexec/sandbox/tmp/tmp.LRQUwaErOc/E---3.1_19150.p',rule_001) ).
cnf(axiom_7,axiom,
n0(d,b),
file('/export/starexec/sandbox/tmp/tmp.LRQUwaErOc/E---3.1_19150.p',axiom_7) ).
cnf(rule_085,axiom,
( p1(X1,X1,X1)
| ~ p0(X2,X1) ),
file('/export/starexec/sandbox/tmp/tmp.LRQUwaErOc/E---3.1_19150.p',rule_085) ).
cnf(rule_136,axiom,
( m2(b)
| ~ k1(b) ),
file('/export/starexec/sandbox/tmp/tmp.LRQUwaErOc/E---3.1_19150.p',rule_136) ).
cnf(rule_137,axiom,
( n2(X1)
| ~ p1(X2,X3,X1) ),
file('/export/starexec/sandbox/tmp/tmp.LRQUwaErOc/E---3.1_19150.p',rule_137) ).
cnf(rule_316,axiom,
( n5(X1,X1)
| ~ p4(X2,X1,X1)
| ~ s1(X1)
| ~ p4(b,b,X3) ),
file('/export/starexec/sandbox/tmp/tmp.LRQUwaErOc/E---3.1_19150.p',rule_316) ).
cnf(rule_212,axiom,
( k3(X1,X1,X1)
| ~ m2(X1) ),
file('/export/starexec/sandbox/tmp/tmp.LRQUwaErOc/E---3.1_19150.p',rule_212) ).
cnf(rule_244,axiom,
( p3(X1,X1,X1)
| ~ n2(X1) ),
file('/export/starexec/sandbox/tmp/tmp.LRQUwaErOc/E---3.1_19150.p',rule_244) ).
cnf(rule_287,axiom,
( p4(X1,X2,X1)
| ~ k3(X1,X1,X2) ),
file('/export/starexec/sandbox/tmp/tmp.LRQUwaErOc/E---3.1_19150.p',rule_287) ).
cnf(rule_291,axiom,
( p4(X1,X1,X1)
| ~ p3(X2,X2,X1) ),
file('/export/starexec/sandbox/tmp/tmp.LRQUwaErOc/E---3.1_19150.p',rule_291) ).
cnf(prove_this,negated_conjecture,
~ n5(c,c),
file('/export/starexec/sandbox/tmp/tmp.LRQUwaErOc/E---3.1_19150.p',prove_this) ).
cnf(c_0_15,axiom,
( s1(X1)
| ~ q0(X1,X2)
| ~ s1(X3) ),
rule_126 ).
cnf(c_0_16,axiom,
q0(X1,d),
axiom_17 ).
cnf(c_0_17,axiom,
( s1(X1)
| ~ p0(X1,X1) ),
rule_125 ).
cnf(c_0_18,axiom,
p0(b,X1),
axiom_14 ).
cnf(c_0_19,axiom,
( k1(X1)
| ~ n0(X2,X1) ),
rule_001 ).
cnf(c_0_20,axiom,
n0(d,b),
axiom_7 ).
cnf(c_0_21,axiom,
( p1(X1,X1,X1)
| ~ p0(X2,X1) ),
rule_085 ).
cnf(c_0_22,plain,
( s1(X1)
| ~ s1(X2) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_23,plain,
s1(b),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_24,axiom,
( m2(b)
| ~ k1(b) ),
rule_136 ).
cnf(c_0_25,plain,
k1(b),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_26,axiom,
( n2(X1)
| ~ p1(X2,X3,X1) ),
rule_137 ).
cnf(c_0_27,plain,
p1(X1,X1,X1),
inference(spm,[status(thm)],[c_0_21,c_0_18]) ).
cnf(c_0_28,axiom,
( n5(X1,X1)
| ~ p4(X2,X1,X1)
| ~ s1(X1)
| ~ p4(b,b,X3) ),
rule_316 ).
cnf(c_0_29,plain,
s1(X1),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_30,axiom,
( k3(X1,X1,X1)
| ~ m2(X1) ),
rule_212 ).
cnf(c_0_31,plain,
m2(b),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_24,c_0_25])]) ).
cnf(c_0_32,axiom,
( p3(X1,X1,X1)
| ~ n2(X1) ),
rule_244 ).
cnf(c_0_33,plain,
n2(X1),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_34,plain,
( n5(X1,X1)
| ~ p4(b,b,X2)
| ~ p4(X3,X1,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_28,c_0_29])]) ).
cnf(c_0_35,axiom,
( p4(X1,X2,X1)
| ~ k3(X1,X1,X2) ),
rule_287 ).
cnf(c_0_36,plain,
k3(b,b,b),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_37,axiom,
( p4(X1,X1,X1)
| ~ p3(X2,X2,X1) ),
rule_291 ).
cnf(c_0_38,plain,
p3(X1,X1,X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_32,c_0_33])]) ).
cnf(c_0_39,plain,
( n5(X1,X1)
| ~ p4(X2,X1,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_36])]) ).
cnf(c_0_40,plain,
p4(X1,X1,X1),
inference(spm,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_41,negated_conjecture,
~ n5(c,c),
prove_this ).
cnf(c_0_42,plain,
n5(X1,X1),
inference(spm,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_43,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_41,c_0_42])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.13 % Problem : SYN162-1 : TPTP v8.1.2. Released v1.1.0.
% 0.10/0.14 % Command : run_E %s %d THM
% 0.13/0.35 % Computer : n031.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 2400
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Mon Oct 2 18:48:28 EDT 2023
% 0.13/0.35 % CPUTime :
% 0.20/0.48 Running first-order theorem proving
% 0.20/0.48 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.LRQUwaErOc/E---3.1_19150.p
% 0.20/0.54 # Version: 3.1pre001
% 0.20/0.54 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.20/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.54 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.20/0.54 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.54 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.54 # Starting sh5l with 300s (1) cores
% 0.20/0.54 # new_bool_1 with pid 19230 completed with status 0
% 0.20/0.54 # Result found by new_bool_1
% 0.20/0.54 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.20/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.54 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.20/0.54 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.54 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.54 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.54 # Search class: FHUNM-FSLM00-SFFFFFNN
% 0.20/0.54 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.54 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.20/0.54 # SAT001_MinMin_p005000_rr_RG with pid 19232 completed with status 0
% 0.20/0.54 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.20/0.54 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.20/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.54 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.20/0.54 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.54 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.54 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.54 # Search class: FHUNM-FSLM00-SFFFFFNN
% 0.20/0.54 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.54 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.20/0.54 # Preprocessing time : 0.003 s
% 0.20/0.54 # Presaturation interreduction done
% 0.20/0.54
% 0.20/0.54 # Proof found!
% 0.20/0.54 # SZS status Unsatisfiable
% 0.20/0.54 # SZS output start CNFRefutation
% See solution above
% 0.20/0.54 # Parsed axioms : 369
% 0.20/0.54 # Removed by relevancy pruning/SinE : 32
% 0.20/0.54 # Initial clauses : 337
% 0.20/0.54 # Removed in clause preprocessing : 6
% 0.20/0.54 # Initial clauses in saturation : 331
% 0.20/0.54 # Processed clauses : 915
% 0.20/0.54 # ...of these trivial : 61
% 0.20/0.54 # ...subsumed : 33
% 0.20/0.54 # ...remaining for further processing : 821
% 0.20/0.54 # Other redundant clauses eliminated : 0
% 0.20/0.54 # Clauses deleted for lack of memory : 0
% 0.20/0.54 # Backward-subsumed : 41
% 0.20/0.54 # Backward-rewritten : 213
% 0.20/0.54 # Generated clauses : 1005
% 0.20/0.54 # ...of the previous two non-redundant : 735
% 0.20/0.54 # ...aggressively subsumed : 0
% 0.20/0.54 # Contextual simplify-reflections : 2
% 0.20/0.54 # Paramodulations : 1005
% 0.20/0.54 # Factorizations : 0
% 0.20/0.54 # NegExts : 0
% 0.20/0.54 # Equation resolutions : 0
% 0.20/0.54 # Total rewrite steps : 761
% 0.20/0.54 # Propositional unsat checks : 0
% 0.20/0.54 # Propositional check models : 0
% 0.20/0.54 # Propositional check unsatisfiable : 0
% 0.20/0.54 # Propositional clauses : 0
% 0.20/0.54 # Propositional clauses after purity: 0
% 0.20/0.54 # Propositional unsat core size : 0
% 0.20/0.54 # Propositional preprocessing time : 0.000
% 0.20/0.54 # Propositional encoding time : 0.000
% 0.20/0.54 # Propositional solver time : 0.000
% 0.20/0.54 # Success case prop preproc time : 0.000
% 0.20/0.54 # Success case prop encoding time : 0.000
% 0.20/0.54 # Success case prop solver time : 0.000
% 0.20/0.54 # Current number of processed clauses : 269
% 0.20/0.54 # Positive orientable unit clauses : 106
% 0.20/0.54 # Positive unorientable unit clauses: 0
% 0.20/0.54 # Negative unit clauses : 3
% 0.20/0.54 # Non-unit-clauses : 160
% 0.20/0.54 # Current number of unprocessed clauses: 373
% 0.20/0.54 # ...number of literals in the above : 1014
% 0.20/0.54 # Current number of archived formulas : 0
% 0.20/0.54 # Current number of archived clauses : 552
% 0.20/0.54 # Clause-clause subsumption calls (NU) : 42222
% 0.20/0.54 # Rec. Clause-clause subsumption calls : 29325
% 0.20/0.54 # Non-unit clause-clause subsumptions : 59
% 0.20/0.54 # Unit Clause-clause subsumption calls : 2708
% 0.20/0.54 # Rewrite failures with RHS unbound : 0
% 0.20/0.54 # BW rewrite match attempts : 366
% 0.20/0.54 # BW rewrite match successes : 140
% 0.20/0.54 # Condensation attempts : 0
% 0.20/0.54 # Condensation successes : 0
% 0.20/0.54 # Termbank termtop insertions : 20221
% 0.20/0.54
% 0.20/0.54 # -------------------------------------------------
% 0.20/0.54 # User time : 0.040 s
% 0.20/0.54 # System time : 0.006 s
% 0.20/0.54 # Total time : 0.046 s
% 0.20/0.54 # Maximum resident set size: 2596 pages
% 0.20/0.54
% 0.20/0.54 # -------------------------------------------------
% 0.20/0.54 # User time : 0.045 s
% 0.20/0.54 # System time : 0.009 s
% 0.20/0.54 # Total time : 0.054 s
% 0.20/0.54 # Maximum resident set size: 1996 pages
% 0.20/0.54 % E---3.1 exiting
% 0.20/0.54 % E---3.1 exiting
%------------------------------------------------------------------------------