TSTP Solution File: SYN162-1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SYN162-1 : TPTP v8.2.0. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n003.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 : 300s
% WCLimit : 300s
% DateTime : Tue May 21 07:43:36 EDT 2024
% Result : Unsatisfiable 0.16s 0.49s
% Output : CNFRefutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 15
% Syntax : Number of clauses : 56 ( 20 unt; 0 nHn; 45 RR)
% Number of literals : 102 ( 0 equ; 49 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 : 77 ( 35 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(rule_126,axiom,
( s1(X1)
| ~ q0(X1,X2)
| ~ s1(X3) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_126) ).
cnf(rule_125,axiom,
( s1(X1)
| ~ p0(X1,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_125) ).
cnf(rule_001,axiom,
( k1(X1)
| ~ n0(X2,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_001) ).
cnf(rule_085,axiom,
( p1(X1,X1,X1)
| ~ p0(X2,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_085) ).
cnf(axiom_17,axiom,
q0(X1,d),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',axiom_17) ).
cnf(axiom_14,axiom,
p0(b,X1),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',axiom_14) ).
cnf(rule_136,axiom,
( m2(b)
| ~ k1(b) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_136) ).
cnf(axiom_7,axiom,
n0(d,b),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',axiom_7) ).
cnf(rule_137,axiom,
( n2(X1)
| ~ p1(X2,X3,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_137) ).
cnf(rule_316,axiom,
( n5(X1,X1)
| ~ p4(X2,X1,X1)
| ~ s1(X1)
| ~ p4(b,b,X3) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_316) ).
cnf(rule_212,axiom,
( k3(X1,X1,X1)
| ~ m2(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_212) ).
cnf(rule_244,axiom,
( p3(X1,X1,X1)
| ~ n2(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_244) ).
cnf(rule_287,axiom,
( p4(X1,X2,X1)
| ~ k3(X1,X1,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_287) ).
cnf(rule_291,axiom,
( p4(X1,X1,X1)
| ~ p3(X2,X2,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_291) ).
cnf(prove_this,negated_conjecture,
~ n5(c,c),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this) ).
cnf(c_0_15,plain,
( s1(X1)
| ~ q0(X1,X2)
| ~ s1(X3) ),
inference(fof_simplification,[status(thm)],[rule_126]) ).
cnf(c_0_16,plain,
( s1(X1)
| ~ p0(X1,X1) ),
inference(fof_simplification,[status(thm)],[rule_125]) ).
cnf(c_0_17,plain,
( k1(X1)
| ~ n0(X2,X1) ),
inference(fof_simplification,[status(thm)],[rule_001]) ).
cnf(c_0_18,plain,
( p1(X1,X1,X1)
| ~ p0(X2,X1) ),
inference(fof_simplification,[status(thm)],[rule_085]) ).
cnf(c_0_19,plain,
( s1(X1)
| ~ q0(X1,X2)
| ~ s1(X3) ),
c_0_15 ).
cnf(c_0_20,axiom,
q0(X1,d),
axiom_17 ).
cnf(c_0_21,plain,
( s1(X1)
| ~ p0(X1,X1) ),
c_0_16 ).
cnf(c_0_22,axiom,
p0(b,X1),
axiom_14 ).
cnf(c_0_23,plain,
( m2(b)
| ~ k1(b) ),
inference(fof_simplification,[status(thm)],[rule_136]) ).
cnf(c_0_24,plain,
( k1(X1)
| ~ n0(X2,X1) ),
c_0_17 ).
cnf(c_0_25,axiom,
n0(d,b),
axiom_7 ).
cnf(c_0_26,plain,
( n2(X1)
| ~ p1(X2,X3,X1) ),
inference(fof_simplification,[status(thm)],[rule_137]) ).
cnf(c_0_27,plain,
( p1(X1,X1,X1)
| ~ p0(X2,X1) ),
c_0_18 ).
cnf(c_0_28,plain,
( n5(X1,X1)
| ~ p4(X2,X1,X1)
| ~ s1(X1)
| ~ p4(b,b,X3) ),
inference(fof_simplification,[status(thm)],[rule_316]) ).
cnf(c_0_29,plain,
( s1(X1)
| ~ s1(X2) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_30,plain,
s1(b),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_31,plain,
( k3(X1,X1,X1)
| ~ m2(X1) ),
inference(fof_simplification,[status(thm)],[rule_212]) ).
cnf(c_0_32,plain,
( m2(b)
| ~ k1(b) ),
c_0_23 ).
cnf(c_0_33,plain,
k1(b),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_34,plain,
( p3(X1,X1,X1)
| ~ n2(X1) ),
inference(fof_simplification,[status(thm)],[rule_244]) ).
cnf(c_0_35,plain,
( n2(X1)
| ~ p1(X2,X3,X1) ),
c_0_26 ).
cnf(c_0_36,plain,
p1(X1,X1,X1),
inference(spm,[status(thm)],[c_0_27,c_0_22]) ).
cnf(c_0_37,plain,
( n5(X1,X1)
| ~ p4(X2,X1,X1)
| ~ s1(X1)
| ~ p4(b,b,X3) ),
c_0_28 ).
cnf(c_0_38,plain,
s1(X1),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_39,plain,
( p4(X1,X2,X1)
| ~ k3(X1,X1,X2) ),
inference(fof_simplification,[status(thm)],[rule_287]) ).
cnf(c_0_40,plain,
( k3(X1,X1,X1)
| ~ m2(X1) ),
c_0_31 ).
cnf(c_0_41,plain,
m2(b),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_32,c_0_33])]) ).
cnf(c_0_42,plain,
( p4(X1,X1,X1)
| ~ p3(X2,X2,X1) ),
inference(fof_simplification,[status(thm)],[rule_291]) ).
cnf(c_0_43,plain,
( p3(X1,X1,X1)
| ~ n2(X1) ),
c_0_34 ).
cnf(c_0_44,plain,
n2(X1),
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_45,plain,
( n5(X1,X1)
| ~ p4(b,b,X2)
| ~ p4(X3,X1,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_37,c_0_38])]) ).
cnf(c_0_46,plain,
( p4(X1,X2,X1)
| ~ k3(X1,X1,X2) ),
c_0_39 ).
cnf(c_0_47,plain,
k3(b,b,b),
inference(spm,[status(thm)],[c_0_40,c_0_41]) ).
cnf(c_0_48,plain,
( p4(X1,X1,X1)
| ~ p3(X2,X2,X1) ),
c_0_42 ).
cnf(c_0_49,plain,
p3(X1,X1,X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_43,c_0_44])]) ).
cnf(c_0_50,negated_conjecture,
~ n5(c,c),
inference(fof_simplification,[status(thm)],[prove_this]) ).
cnf(c_0_51,plain,
( n5(X1,X1)
| ~ p4(X2,X1,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_46]),c_0_47])]) ).
cnf(c_0_52,plain,
p4(X1,X1,X1),
inference(spm,[status(thm)],[c_0_48,c_0_49]) ).
cnf(c_0_53,negated_conjecture,
~ n5(c,c),
c_0_50 ).
cnf(c_0_54,plain,
n5(X1,X1),
inference(spm,[status(thm)],[c_0_51,c_0_52]) ).
cnf(c_0_55,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_53,c_0_54])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.10 % Problem : SYN162-1 : TPTP v8.2.0. Released v1.1.0.
% 0.02/0.11 % Command : run_E %s %d THM
% 0.10/0.31 % Computer : n003.cluster.edu
% 0.10/0.31 % Model : x86_64 x86_64
% 0.10/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.31 % Memory : 8042.1875MB
% 0.10/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.31 % CPULimit : 300
% 0.10/0.31 % WCLimit : 300
% 0.10/0.31 % DateTime : Mon May 20 14:25:37 EDT 2024
% 0.10/0.31 % CPUTime :
% 0.16/0.43 Running first-order theorem proving
% 0.16/0.43 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/benchmark/theBenchmark.p
% 0.16/0.49 # Version: 3.1.0
% 0.16/0.49 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.16/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.49 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.16/0.49 # Starting new_bool_3 with 300s (1) cores
% 0.16/0.49 # Starting new_bool_1 with 300s (1) cores
% 0.16/0.49 # Starting sh5l with 300s (1) cores
% 0.16/0.49 # new_bool_1 with pid 29800 completed with status 0
% 0.16/0.49 # Result found by new_bool_1
% 0.16/0.49 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.16/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.49 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.16/0.49 # Starting new_bool_3 with 300s (1) cores
% 0.16/0.49 # Starting new_bool_1 with 300s (1) cores
% 0.16/0.49 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.16/0.49 # Search class: FHUNM-FSLM00-SFFFFFNN
% 0.16/0.49 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.16/0.49 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.16/0.49 # SAT001_MinMin_p005000_rr_RG with pid 29809 completed with status 0
% 0.16/0.49 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.16/0.49 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.16/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.49 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.16/0.49 # Starting new_bool_3 with 300s (1) cores
% 0.16/0.49 # Starting new_bool_1 with 300s (1) cores
% 0.16/0.49 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.16/0.49 # Search class: FHUNM-FSLM00-SFFFFFNN
% 0.16/0.49 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.16/0.49 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.16/0.49 # Preprocessing time : 0.003 s
% 0.16/0.49 # Presaturation interreduction done
% 0.16/0.49
% 0.16/0.49 # Proof found!
% 0.16/0.49 # SZS status Unsatisfiable
% 0.16/0.49 # SZS output start CNFRefutation
% See solution above
% 0.16/0.49 # Parsed axioms : 369
% 0.16/0.49 # Removed by relevancy pruning/SinE : 32
% 0.16/0.49 # Initial clauses : 337
% 0.16/0.49 # Removed in clause preprocessing : 6
% 0.16/0.49 # Initial clauses in saturation : 331
% 0.16/0.49 # Processed clauses : 915
% 0.16/0.49 # ...of these trivial : 61
% 0.16/0.49 # ...subsumed : 33
% 0.16/0.49 # ...remaining for further processing : 821
% 0.16/0.49 # Other redundant clauses eliminated : 0
% 0.16/0.49 # Clauses deleted for lack of memory : 0
% 0.16/0.49 # Backward-subsumed : 41
% 0.16/0.49 # Backward-rewritten : 213
% 0.16/0.49 # Generated clauses : 1005
% 0.16/0.49 # ...of the previous two non-redundant : 735
% 0.16/0.49 # ...aggressively subsumed : 0
% 0.16/0.49 # Contextual simplify-reflections : 2
% 0.16/0.49 # Paramodulations : 1005
% 0.16/0.49 # Factorizations : 0
% 0.16/0.49 # NegExts : 0
% 0.16/0.49 # Equation resolutions : 0
% 0.16/0.49 # Disequality decompositions : 0
% 0.16/0.49 # Total rewrite steps : 761
% 0.16/0.49 # ...of those cached : 526
% 0.16/0.49 # Propositional unsat checks : 0
% 0.16/0.49 # Propositional check models : 0
% 0.16/0.49 # Propositional check unsatisfiable : 0
% 0.16/0.49 # Propositional clauses : 0
% 0.16/0.49 # Propositional clauses after purity: 0
% 0.16/0.49 # Propositional unsat core size : 0
% 0.16/0.49 # Propositional preprocessing time : 0.000
% 0.16/0.49 # Propositional encoding time : 0.000
% 0.16/0.49 # Propositional solver time : 0.000
% 0.16/0.49 # Success case prop preproc time : 0.000
% 0.16/0.49 # Success case prop encoding time : 0.000
% 0.16/0.49 # Success case prop solver time : 0.000
% 0.16/0.49 # Current number of processed clauses : 269
% 0.16/0.49 # Positive orientable unit clauses : 106
% 0.16/0.49 # Positive unorientable unit clauses: 0
% 0.16/0.49 # Negative unit clauses : 3
% 0.16/0.49 # Non-unit-clauses : 160
% 0.16/0.49 # Current number of unprocessed clauses: 373
% 0.16/0.49 # ...number of literals in the above : 1014
% 0.16/0.49 # Current number of archived formulas : 0
% 0.16/0.49 # Current number of archived clauses : 552
% 0.16/0.49 # Clause-clause subsumption calls (NU) : 42222
% 0.16/0.49 # Rec. Clause-clause subsumption calls : 29325
% 0.16/0.49 # Non-unit clause-clause subsumptions : 59
% 0.16/0.49 # Unit Clause-clause subsumption calls : 2708
% 0.16/0.49 # Rewrite failures with RHS unbound : 0
% 0.16/0.49 # BW rewrite match attempts : 366
% 0.16/0.49 # BW rewrite match successes : 140
% 0.16/0.49 # Condensation attempts : 0
% 0.16/0.49 # Condensation successes : 0
% 0.16/0.49 # Termbank termtop insertions : 23374
% 0.16/0.49 # Search garbage collected termcells : 1503
% 0.16/0.49
% 0.16/0.49 # -------------------------------------------------
% 0.16/0.49 # User time : 0.038 s
% 0.16/0.49 # System time : 0.007 s
% 0.16/0.49 # Total time : 0.045 s
% 0.16/0.49 # Maximum resident set size: 2620 pages
% 0.16/0.49
% 0.16/0.49 # -------------------------------------------------
% 0.16/0.49 # User time : 0.041 s
% 0.16/0.49 # System time : 0.009 s
% 0.16/0.49 # Total time : 0.050 s
% 0.16/0.49 # Maximum resident set size: 2016 pages
% 0.16/0.49 % E---3.1 exiting
% 0.16/0.49 % E exiting
%------------------------------------------------------------------------------