TSTP Solution File: SYN208-1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : SYN208-1 : TPTP v8.2.0. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n012.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:57:28 EDT 2024
% Result : Unsatisfiable 0.65s 0.57s
% Output : CNFRefutation 0.65s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 14
% Syntax : Number of clauses : 47 ( 23 unt; 0 nHn; 40 RR)
% Number of literals : 86 ( 0 equ; 42 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 12 ( 11 usr; 1 prp; 0-3 aty)
% Number of functors : 4 ( 4 usr; 4 con; 0-0 aty)
% Number of variables : 48 ( 23 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_045,axiom,
( n1(d,d,d)
| ~ q0(d,d) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_045) ).
cnf(rule_001,axiom,
( k1(X1)
| ~ n0(X2,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_001) ).
cnf(rule_190,axiom,
( s2(d)
| ~ s1(a)
| ~ s0(d) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_190) ).
cnf(axiom_36,axiom,
q0(a,b),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',axiom_36) ).
cnf(axiom_14,axiom,
p0(b,X1),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',axiom_14) ).
cnf(rule_179,axiom,
( q2(X1,X1,X1)
| ~ k1(X2)
| ~ n1(X1,X1,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_179) ).
cnf(axiom_17,axiom,
q0(X1,d),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',axiom_17) ).
cnf(axiom_34,axiom,
n0(c,d),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',axiom_34) ).
cnf(axiom_1,axiom,
s0(d),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',axiom_1) ).
cnf(rule_273,axiom,
( s3(X1,X2)
| ~ q2(X3,X1,X3)
| ~ s2(X1)
| ~ m0(X3,X4,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_273) ).
cnf(prove_this,negated_conjecture,
~ s3(d,b),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this) ).
cnf(axiom_19,axiom,
m0(X1,d,X2),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',axiom_19) ).
cnf(c_0_14,plain,
( s1(X1)
| ~ q0(X1,X2)
| ~ s1(X3) ),
inference(fof_simplification,[status(thm)],[rule_126]) ).
cnf(c_0_15,plain,
( s1(X1)
| ~ p0(X1,X1) ),
inference(fof_simplification,[status(thm)],[rule_125]) ).
cnf(c_0_16,plain,
( n1(d,d,d)
| ~ q0(d,d) ),
inference(fof_simplification,[status(thm)],[rule_045]) ).
cnf(c_0_17,plain,
( k1(X1)
| ~ n0(X2,X1) ),
inference(fof_simplification,[status(thm)],[rule_001]) ).
cnf(c_0_18,plain,
( s2(d)
| ~ s1(a)
| ~ s0(d) ),
inference(fof_simplification,[status(thm)],[rule_190]) ).
cnf(c_0_19,plain,
( s1(X1)
| ~ q0(X1,X2)
| ~ s1(X3) ),
c_0_14 ).
cnf(c_0_20,axiom,
q0(a,b),
axiom_36 ).
cnf(c_0_21,plain,
( s1(X1)
| ~ p0(X1,X1) ),
c_0_15 ).
cnf(c_0_22,axiom,
p0(b,X1),
axiom_14 ).
cnf(c_0_23,plain,
( q2(X1,X1,X1)
| ~ k1(X2)
| ~ n1(X1,X1,X2) ),
inference(fof_simplification,[status(thm)],[rule_179]) ).
cnf(c_0_24,plain,
( n1(d,d,d)
| ~ q0(d,d) ),
c_0_16 ).
cnf(c_0_25,axiom,
q0(X1,d),
axiom_17 ).
cnf(c_0_26,plain,
( k1(X1)
| ~ n0(X2,X1) ),
c_0_17 ).
cnf(c_0_27,axiom,
n0(c,d),
axiom_34 ).
cnf(c_0_28,plain,
( s2(d)
| ~ s1(a)
| ~ s0(d) ),
c_0_18 ).
cnf(c_0_29,axiom,
s0(d),
axiom_1 ).
cnf(c_0_30,plain,
( s1(a)
| ~ s1(X1) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_31,plain,
s1(b),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_32,plain,
( s3(X1,X2)
| ~ q2(X3,X1,X3)
| ~ s2(X1)
| ~ m0(X3,X4,X2) ),
inference(fof_simplification,[status(thm)],[rule_273]) ).
cnf(c_0_33,plain,
( q2(X1,X1,X1)
| ~ k1(X2)
| ~ n1(X1,X1,X2) ),
c_0_23 ).
cnf(c_0_34,plain,
n1(d,d,d),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_24,c_0_25])]) ).
cnf(c_0_35,plain,
k1(d),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_36,plain,
( s2(d)
| ~ s1(a) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_28,c_0_29])]) ).
cnf(c_0_37,plain,
s1(a),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_38,plain,
( s3(X1,X2)
| ~ q2(X3,X1,X3)
| ~ s2(X1)
| ~ m0(X3,X4,X2) ),
c_0_32 ).
cnf(c_0_39,plain,
q2(d,d,d),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_35])]) ).
cnf(c_0_40,plain,
s2(d),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_36,c_0_37])]) ).
cnf(c_0_41,negated_conjecture,
~ s3(d,b),
inference(fof_simplification,[status(thm)],[prove_this]) ).
cnf(c_0_42,plain,
( s3(d,X1)
| ~ m0(d,X2,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_40])]) ).
cnf(c_0_43,axiom,
m0(X1,d,X2),
axiom_19 ).
cnf(c_0_44,negated_conjecture,
~ s3(d,b),
c_0_41 ).
cnf(c_0_45,plain,
s3(d,X1),
inference(spm,[status(thm)],[c_0_42,c_0_43]) ).
cnf(c_0_46,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_44,c_0_45])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13 % Problem : SYN208-1 : TPTP v8.2.0. Released v1.1.0.
% 0.15/0.14 % Command : run_E %s %d THM
% 0.15/0.36 % Computer : n012.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Mon May 20 15:47:53 EDT 2024
% 0.15/0.36 % CPUTime :
% 0.22/0.49 Running first-order model finding
% 0.22/0.49 Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.65/0.57 # Version: 3.1.0
% 0.65/0.57 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.65/0.57 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.65/0.57 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.65/0.57 # Starting new_bool_3 with 300s (1) cores
% 0.65/0.57 # Starting new_bool_1 with 300s (1) cores
% 0.65/0.57 # Starting sh5l with 300s (1) cores
% 0.65/0.57 # new_bool_3 with pid 27575 completed with status 0
% 0.65/0.57 # Result found by new_bool_3
% 0.65/0.57 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.65/0.57 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.65/0.57 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.65/0.57 # Starting new_bool_3 with 300s (1) cores
% 0.65/0.57 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.65/0.57 # Search class: FHUNM-FSLM00-SFFFFFNN
% 0.65/0.57 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.65/0.57 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.65/0.57 # SAT001_MinMin_p005000_rr_RG with pid 27582 completed with status 0
% 0.65/0.57 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.65/0.57 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.65/0.57 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.65/0.57 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.65/0.57 # Starting new_bool_3 with 300s (1) cores
% 0.65/0.57 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.65/0.57 # Search class: FHUNM-FSLM00-SFFFFFNN
% 0.65/0.57 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.65/0.57 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.65/0.57 # Preprocessing time : 0.005 s
% 0.65/0.57 # Presaturation interreduction done
% 0.65/0.57
% 0.65/0.57 # Proof found!
% 0.65/0.57 # SZS status Unsatisfiable
% 0.65/0.57 # SZS output start CNFRefutation
% See solution above
% 0.65/0.57 # Parsed axioms : 369
% 0.65/0.57 # Removed by relevancy pruning/SinE : 24
% 0.65/0.57 # Initial clauses : 345
% 0.65/0.57 # Removed in clause preprocessing : 6
% 0.65/0.57 # Initial clauses in saturation : 339
% 0.65/0.57 # Processed clauses : 740
% 0.65/0.57 # ...of these trivial : 23
% 0.65/0.57 # ...subsumed : 26
% 0.65/0.57 # ...remaining for further processing : 691
% 0.65/0.57 # Other redundant clauses eliminated : 0
% 0.65/0.57 # Clauses deleted for lack of memory : 0
% 0.65/0.57 # Backward-subsumed : 18
% 0.65/0.57 # Backward-rewritten : 50
% 0.65/0.57 # Generated clauses : 587
% 0.65/0.57 # ...of the previous two non-redundant : 403
% 0.65/0.57 # ...aggressively subsumed : 0
% 0.65/0.57 # Contextual simplify-reflections : 1
% 0.65/0.57 # Paramodulations : 587
% 0.65/0.57 # Factorizations : 0
% 0.65/0.57 # NegExts : 0
% 0.65/0.57 # Equation resolutions : 0
% 0.65/0.57 # Disequality decompositions : 0
% 0.65/0.57 # Total rewrite steps : 425
% 0.65/0.57 # ...of those cached : 292
% 0.65/0.57 # Propositional unsat checks : 0
% 0.65/0.57 # Propositional check models : 0
% 0.65/0.57 # Propositional check unsatisfiable : 0
% 0.65/0.57 # Propositional clauses : 0
% 0.65/0.57 # Propositional clauses after purity: 0
% 0.65/0.57 # Propositional unsat core size : 0
% 0.65/0.57 # Propositional preprocessing time : 0.000
% 0.65/0.57 # Propositional encoding time : 0.000
% 0.65/0.57 # Propositional solver time : 0.000
% 0.65/0.57 # Success case prop preproc time : 0.000
% 0.65/0.57 # Success case prop encoding time : 0.000
% 0.65/0.57 # Success case prop solver time : 0.000
% 0.65/0.57 # Current number of processed clauses : 318
% 0.65/0.57 # Positive orientable unit clauses : 127
% 0.65/0.57 # Positive unorientable unit clauses: 0
% 0.65/0.57 # Negative unit clauses : 0
% 0.65/0.57 # Non-unit-clauses : 191
% 0.65/0.57 # Current number of unprocessed clauses: 288
% 0.65/0.57 # ...number of literals in the above : 709
% 0.65/0.57 # Current number of archived formulas : 0
% 0.65/0.57 # Current number of archived clauses : 373
% 0.65/0.57 # Clause-clause subsumption calls (NU) : 30404
% 0.65/0.57 # Rec. Clause-clause subsumption calls : 22112
% 0.65/0.57 # Non-unit clause-clause subsumptions : 37
% 0.65/0.57 # Unit Clause-clause subsumption calls : 331
% 0.65/0.57 # Rewrite failures with RHS unbound : 0
% 0.65/0.57 # BW rewrite match attempts : 83
% 0.65/0.57 # BW rewrite match successes : 46
% 0.65/0.57 # Condensation attempts : 0
% 0.65/0.57 # Condensation successes : 0
% 0.65/0.57 # Termbank termtop insertions : 18458
% 0.65/0.57 # Search garbage collected termcells : 1491
% 0.65/0.57
% 0.65/0.57 # -------------------------------------------------
% 0.65/0.57 # User time : 0.057 s
% 0.65/0.57 # System time : 0.004 s
% 0.65/0.57 # Total time : 0.062 s
% 0.65/0.57 # Maximum resident set size: 2632 pages
% 0.65/0.57
% 0.65/0.57 # -------------------------------------------------
% 0.65/0.57 # User time : 0.063 s
% 0.65/0.57 # System time : 0.008 s
% 0.65/0.57 # Total time : 0.070 s
% 0.65/0.57 # Maximum resident set size: 2016 pages
% 0.65/0.57 % E---3.1 exiting
%------------------------------------------------------------------------------