TSTP Solution File: SYN266-1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SYN266-1 : TPTP v8.1.2. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n005.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:14 EDT 2023
% Result : Unsatisfiable 0.37s 0.58s
% Output : CNFRefutation 0.37s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 14
% Syntax : Number of clauses : 38 ( 20 unt; 0 nHn; 34 RR)
% Number of literals : 64 ( 0 equ; 28 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 13 ( 12 usr; 1 prp; 0-3 aty)
% Number of functors : 4 ( 4 usr; 4 con; 0-0 aty)
% Number of variables : 40 ( 14 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(rule_090,axiom,
( p1(e,e,e)
| ~ r0(e)
| ~ k0(e) ),
file('/export/starexec/sandbox/tmp/tmp.y4NrhufpfU/E---3.1_2078.p',rule_090) ).
cnf(axiom_13,axiom,
r0(e),
file('/export/starexec/sandbox/tmp/tmp.y4NrhufpfU/E---3.1_2078.p',axiom_13) ).
cnf(axiom_28,axiom,
k0(e),
file('/export/starexec/sandbox/tmp/tmp.y4NrhufpfU/E---3.1_2078.p',axiom_28) ).
cnf(rule_029,axiom,
( m1(X1,X2,X1)
| ~ p0(X1,X2)
| ~ s0(X1) ),
file('/export/starexec/sandbox/tmp/tmp.y4NrhufpfU/E---3.1_2078.p',rule_029) ).
cnf(axiom_14,axiom,
p0(b,X1),
file('/export/starexec/sandbox/tmp/tmp.y4NrhufpfU/E---3.1_2078.p',axiom_14) ).
cnf(axiom_5,axiom,
s0(b),
file('/export/starexec/sandbox/tmp/tmp.y4NrhufpfU/E---3.1_2078.p',axiom_5) ).
cnf(rule_137,axiom,
( n2(X1)
| ~ p1(X2,X3,X1) ),
file('/export/starexec/sandbox/tmp/tmp.y4NrhufpfU/E---3.1_2078.p',rule_137) ).
cnf(rule_176,axiom,
( p2(X1,X2,X1)
| ~ m1(X2,X1,X2) ),
file('/export/starexec/sandbox/tmp/tmp.y4NrhufpfU/E---3.1_2078.p',rule_176) ).
cnf(rule_236,axiom,
( m3(X1,X1,X1)
| ~ n2(X1) ),
file('/export/starexec/sandbox/tmp/tmp.y4NrhufpfU/E---3.1_2078.p',rule_236) ).
cnf(rule_155,axiom,
( p2(X1,X2,X2)
| ~ k1(X3)
| ~ p2(e,X1,X2) ),
file('/export/starexec/sandbox/tmp/tmp.y4NrhufpfU/E---3.1_2078.p',rule_155) ).
cnf(rule_001,axiom,
( k1(X1)
| ~ n0(X2,X1) ),
file('/export/starexec/sandbox/tmp/tmp.y4NrhufpfU/E---3.1_2078.p',rule_001) ).
cnf(axiom_26,axiom,
n0(d,c),
file('/export/starexec/sandbox/tmp/tmp.y4NrhufpfU/E---3.1_2078.p',axiom_26) ).
cnf(rule_251,axiom,
( p3(X1,X2,X2)
| ~ m3(X2,X3,X4)
| ~ p2(X1,X2,X4) ),
file('/export/starexec/sandbox/tmp/tmp.y4NrhufpfU/E---3.1_2078.p',rule_251) ).
cnf(prove_this,negated_conjecture,
~ p3(b,e,e),
file('/export/starexec/sandbox/tmp/tmp.y4NrhufpfU/E---3.1_2078.p',prove_this) ).
cnf(c_0_14,axiom,
( p1(e,e,e)
| ~ r0(e)
| ~ k0(e) ),
rule_090 ).
cnf(c_0_15,axiom,
r0(e),
axiom_13 ).
cnf(c_0_16,axiom,
k0(e),
axiom_28 ).
cnf(c_0_17,axiom,
( m1(X1,X2,X1)
| ~ p0(X1,X2)
| ~ s0(X1) ),
rule_029 ).
cnf(c_0_18,axiom,
p0(b,X1),
axiom_14 ).
cnf(c_0_19,axiom,
s0(b),
axiom_5 ).
cnf(c_0_20,axiom,
( n2(X1)
| ~ p1(X2,X3,X1) ),
rule_137 ).
cnf(c_0_21,plain,
p1(e,e,e),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_14,c_0_15]),c_0_16])]) ).
cnf(c_0_22,axiom,
( p2(X1,X2,X1)
| ~ m1(X2,X1,X2) ),
rule_176 ).
cnf(c_0_23,plain,
m1(b,X1,b),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19])]) ).
cnf(c_0_24,axiom,
( m3(X1,X1,X1)
| ~ n2(X1) ),
rule_236 ).
cnf(c_0_25,plain,
n2(e),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_26,axiom,
( p2(X1,X2,X2)
| ~ k1(X3)
| ~ p2(e,X1,X2) ),
rule_155 ).
cnf(c_0_27,plain,
p2(X1,b,X1),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_28,axiom,
( k1(X1)
| ~ n0(X2,X1) ),
rule_001 ).
cnf(c_0_29,axiom,
n0(d,c),
axiom_26 ).
cnf(c_0_30,axiom,
( p3(X1,X2,X2)
| ~ m3(X2,X3,X4)
| ~ p2(X1,X2,X4) ),
rule_251 ).
cnf(c_0_31,plain,
m3(e,e,e),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_32,plain,
( p2(b,e,e)
| ~ k1(X1) ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_33,plain,
k1(c),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_34,negated_conjecture,
~ p3(b,e,e),
prove_this ).
cnf(c_0_35,plain,
( p3(X1,e,e)
| ~ p2(X1,e,e) ),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_36,plain,
p2(b,e,e),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_37,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_36])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.14 % Problem : SYN266-1 : TPTP v8.1.2. Released v1.1.0.
% 0.06/0.15 % Command : run_E %s %d THM
% 0.16/0.36 % Computer : n005.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.37 % CPULimit : 2400
% 0.16/0.37 % WCLimit : 300
% 0.16/0.37 % DateTime : Mon Oct 2 18:31:16 EDT 2023
% 0.16/0.37 % CPUTime :
% 0.23/0.51 Running first-order theorem proving
% 0.23/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.y4NrhufpfU/E---3.1_2078.p
% 0.37/0.58 # Version: 3.1pre001
% 0.37/0.58 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.37/0.58 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.37/0.58 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.37/0.58 # Starting new_bool_3 with 300s (1) cores
% 0.37/0.58 # Starting new_bool_1 with 300s (1) cores
% 0.37/0.58 # Starting sh5l with 300s (1) cores
% 0.37/0.58 # new_bool_3 with pid 2164 completed with status 0
% 0.37/0.58 # Result found by new_bool_3
% 0.37/0.58 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.37/0.58 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.37/0.58 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.37/0.58 # Starting new_bool_3 with 300s (1) cores
% 0.37/0.58 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.37/0.58 # Search class: FHUNM-FSLM00-SFFFFFNN
% 0.37/0.58 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.37/0.58 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.37/0.58 # SAT001_MinMin_p005000_rr_RG with pid 2170 completed with status 0
% 0.37/0.58 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.37/0.58 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.37/0.58 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.37/0.58 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.37/0.58 # Starting new_bool_3 with 300s (1) cores
% 0.37/0.58 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.37/0.58 # Search class: FHUNM-FSLM00-SFFFFFNN
% 0.37/0.58 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.37/0.58 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.37/0.58 # Preprocessing time : 0.005 s
% 0.37/0.58 # Presaturation interreduction done
% 0.37/0.58
% 0.37/0.58 # Proof found!
% 0.37/0.58 # SZS status Unsatisfiable
% 0.37/0.58 # SZS output start CNFRefutation
% See solution above
% 0.37/0.58 # Parsed axioms : 369
% 0.37/0.58 # Removed by relevancy pruning/SinE : 38
% 0.37/0.58 # Initial clauses : 331
% 0.37/0.58 # Removed in clause preprocessing : 5
% 0.37/0.58 # Initial clauses in saturation : 326
% 0.37/0.58 # Processed clauses : 707
% 0.37/0.58 # ...of these trivial : 18
% 0.37/0.58 # ...subsumed : 27
% 0.37/0.58 # ...remaining for further processing : 662
% 0.37/0.58 # Other redundant clauses eliminated : 0
% 0.37/0.58 # Clauses deleted for lack of memory : 0
% 0.37/0.58 # Backward-subsumed : 6
% 0.37/0.58 # Backward-rewritten : 45
% 0.37/0.58 # Generated clauses : 616
% 0.37/0.58 # ...of the previous two non-redundant : 410
% 0.37/0.58 # ...aggressively subsumed : 0
% 0.37/0.58 # Contextual simplify-reflections : 1
% 0.37/0.58 # Paramodulations : 616
% 0.37/0.58 # Factorizations : 0
% 0.37/0.58 # NegExts : 0
% 0.37/0.58 # Equation resolutions : 0
% 0.37/0.58 # Total rewrite steps : 422
% 0.37/0.58 # Propositional unsat checks : 0
% 0.37/0.58 # Propositional check models : 0
% 0.37/0.58 # Propositional check unsatisfiable : 0
% 0.37/0.58 # Propositional clauses : 0
% 0.37/0.58 # Propositional clauses after purity: 0
% 0.37/0.58 # Propositional unsat core size : 0
% 0.37/0.58 # Propositional preprocessing time : 0.000
% 0.37/0.58 # Propositional encoding time : 0.000
% 0.37/0.58 # Propositional solver time : 0.000
% 0.37/0.58 # Success case prop preproc time : 0.000
% 0.37/0.58 # Success case prop encoding time : 0.000
% 0.37/0.58 # Success case prop solver time : 0.000
% 0.37/0.58 # Current number of processed clauses : 319
% 0.37/0.58 # Positive orientable unit clauses : 130
% 0.37/0.58 # Positive unorientable unit clauses: 0
% 0.37/0.58 # Negative unit clauses : 1
% 0.37/0.58 # Non-unit-clauses : 188
% 0.37/0.58 # Current number of unprocessed clauses: 302
% 0.37/0.58 # ...number of literals in the above : 722
% 0.37/0.58 # Current number of archived formulas : 0
% 0.37/0.58 # Current number of archived clauses : 343
% 0.37/0.58 # Clause-clause subsumption calls (NU) : 27662
% 0.37/0.58 # Rec. Clause-clause subsumption calls : 19750
% 0.37/0.58 # Non-unit clause-clause subsumptions : 33
% 0.37/0.58 # Unit Clause-clause subsumption calls : 256
% 0.37/0.58 # Rewrite failures with RHS unbound : 0
% 0.37/0.58 # BW rewrite match attempts : 70
% 0.37/0.58 # BW rewrite match successes : 38
% 0.37/0.58 # Condensation attempts : 0
% 0.37/0.58 # Condensation successes : 0
% 0.37/0.58 # Termbank termtop insertions : 15273
% 0.37/0.58
% 0.37/0.58 # -------------------------------------------------
% 0.37/0.58 # User time : 0.048 s
% 0.37/0.58 # System time : 0.007 s
% 0.37/0.58 # Total time : 0.055 s
% 0.37/0.58 # Maximum resident set size: 2480 pages
% 0.37/0.58
% 0.37/0.58 # -------------------------------------------------
% 0.37/0.58 # User time : 0.054 s
% 0.37/0.58 # System time : 0.010 s
% 0.37/0.58 # Total time : 0.063 s
% 0.37/0.58 # Maximum resident set size: 2000 pages
% 0.37/0.58 % E---3.1 exiting
% 0.37/0.59 % E---3.1 exiting
%------------------------------------------------------------------------------