TSTP Solution File: SYN300-1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SYN300-1 : TPTP v8.2.0. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n010.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:44:05 EDT 2024
% Result : Unsatisfiable 0.20s 0.54s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 11
% Syntax : Number of clauses : 38 ( 17 unt; 0 nHn; 33 RR)
% Number of literals : 72 ( 0 equ; 38 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 11 ( 10 usr; 1 prp; 0-3 aty)
% Number of functors : 2 ( 2 usr; 2 con; 0-0 aty)
% Number of variables : 43 ( 14 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(rule_057,axiom,
( n1(X1,X1,X1)
| ~ r0(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_057) ).
cnf(rule_001,axiom,
( k1(X1)
| ~ n0(X2,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_001) ).
cnf(rule_179,axiom,
( q2(X1,X1,X1)
| ~ k1(X2)
| ~ n1(X1,X1,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_179) ).
cnf(axiom_9,axiom,
r0(b),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',axiom_9) ).
cnf(axiom_7,axiom,
n0(d,b),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',axiom_7) ).
cnf(rule_273,axiom,
( s3(X1,X2)
| ~ q2(X3,X1,X3)
| ~ s2(X1)
| ~ m0(X3,X4,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_273) ).
cnf(rule_125,axiom,
( s1(X1)
| ~ p0(X1,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_125) ).
cnf(prove_this,negated_conjecture,
~ s3(b,d),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).
cnf(axiom_19,axiom,
m0(X1,d,X2),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',axiom_19) ).
cnf(rule_189,axiom,
( s2(X1)
| ~ q2(b,X1,b)
| ~ s1(b) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_189) ).
cnf(axiom_14,axiom,
p0(b,X1),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',axiom_14) ).
cnf(c_0_11,plain,
( n1(X1,X1,X1)
| ~ r0(X1) ),
inference(fof_simplification,[status(thm)],[rule_057]) ).
cnf(c_0_12,plain,
( k1(X1)
| ~ n0(X2,X1) ),
inference(fof_simplification,[status(thm)],[rule_001]) ).
cnf(c_0_13,plain,
( q2(X1,X1,X1)
| ~ k1(X2)
| ~ n1(X1,X1,X2) ),
inference(fof_simplification,[status(thm)],[rule_179]) ).
cnf(c_0_14,plain,
( n1(X1,X1,X1)
| ~ r0(X1) ),
c_0_11 ).
cnf(c_0_15,axiom,
r0(b),
axiom_9 ).
cnf(c_0_16,plain,
( k1(X1)
| ~ n0(X2,X1) ),
c_0_12 ).
cnf(c_0_17,axiom,
n0(d,b),
axiom_7 ).
cnf(c_0_18,plain,
( s3(X1,X2)
| ~ q2(X3,X1,X3)
| ~ s2(X1)
| ~ m0(X3,X4,X2) ),
inference(fof_simplification,[status(thm)],[rule_273]) ).
cnf(c_0_19,plain,
( q2(X1,X1,X1)
| ~ k1(X2)
| ~ n1(X1,X1,X2) ),
c_0_13 ).
cnf(c_0_20,plain,
n1(b,b,b),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_21,plain,
k1(b),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_22,plain,
( s3(X1,X2)
| ~ q2(X3,X1,X3)
| ~ s2(X1)
| ~ m0(X3,X4,X2) ),
c_0_18 ).
cnf(c_0_23,plain,
q2(b,b,b),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21])]) ).
cnf(c_0_24,plain,
( s1(X1)
| ~ p0(X1,X1) ),
inference(fof_simplification,[status(thm)],[rule_125]) ).
cnf(c_0_25,negated_conjecture,
~ s3(b,d),
inference(fof_simplification,[status(thm)],[prove_this]) ).
cnf(c_0_26,plain,
( s3(b,X1)
| ~ s2(b)
| ~ m0(b,X2,X1) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_27,axiom,
m0(X1,d,X2),
axiom_19 ).
cnf(c_0_28,plain,
( s2(X1)
| ~ q2(b,X1,b)
| ~ s1(b) ),
inference(fof_simplification,[status(thm)],[rule_189]) ).
cnf(c_0_29,plain,
( s1(X1)
| ~ p0(X1,X1) ),
c_0_24 ).
cnf(c_0_30,axiom,
p0(b,X1),
axiom_14 ).
cnf(c_0_31,negated_conjecture,
~ s3(b,d),
c_0_25 ).
cnf(c_0_32,plain,
( s3(b,X1)
| ~ s2(b) ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_33,plain,
( s2(X1)
| ~ q2(b,X1,b)
| ~ s1(b) ),
c_0_28 ).
cnf(c_0_34,plain,
s1(b),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_35,negated_conjecture,
~ s2(b),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_36,plain,
( s2(X1)
| ~ q2(b,X1,b) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_33,c_0_34])]) ).
cnf(c_0_37,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_23])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : SYN300-1 : TPTP v8.2.0. Released v1.1.0.
% 0.10/0.13 % Command : run_E %s %d THM
% 0.14/0.34 % Computer : n010.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Mon May 20 13:55:23 EDT 2024
% 0.14/0.34 % CPUTime :
% 0.20/0.47 Running first-order theorem proving
% 0.20/0.47 Running: /export/starexec/sandbox2/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/sandbox2/benchmark/theBenchmark.p
% 0.20/0.54 # Version: 3.1.0
% 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 3263 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 3271 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.004 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 : 24
% 0.20/0.54 # Initial clauses : 345
% 0.20/0.54 # Removed in clause preprocessing : 6
% 0.20/0.54 # Initial clauses in saturation : 339
% 0.20/0.54 # Processed clauses : 786
% 0.20/0.54 # ...of these trivial : 25
% 0.20/0.54 # ...subsumed : 28
% 0.20/0.54 # ...remaining for further processing : 733
% 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 : 21
% 0.20/0.54 # Backward-rewritten : 83
% 0.20/0.54 # Generated clauses : 719
% 0.20/0.54 # ...of the previous two non-redundant : 498
% 0.20/0.54 # ...aggressively subsumed : 0
% 0.20/0.54 # Contextual simplify-reflections : 1
% 0.20/0.54 # Paramodulations : 719
% 0.20/0.54 # Factorizations : 0
% 0.20/0.54 # NegExts : 0
% 0.20/0.54 # Equation resolutions : 0
% 0.20/0.54 # Disequality decompositions : 0
% 0.20/0.54 # Total rewrite steps : 534
% 0.20/0.54 # ...of those cached : 378
% 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 : 324
% 0.20/0.54 # Positive orientable unit clauses : 121
% 0.20/0.54 # Positive unorientable unit clauses: 0
% 0.20/0.54 # Negative unit clauses : 2
% 0.20/0.54 # Non-unit-clauses : 201
% 0.20/0.54 # Current number of unprocessed clauses: 334
% 0.20/0.54 # ...number of literals in the above : 800
% 0.20/0.54 # Current number of archived formulas : 0
% 0.20/0.54 # Current number of archived clauses : 409
% 0.20/0.54 # Clause-clause subsumption calls (NU) : 33651
% 0.20/0.54 # Rec. Clause-clause subsumption calls : 24846
% 0.20/0.54 # Non-unit clause-clause subsumptions : 40
% 0.20/0.54 # Unit Clause-clause subsumption calls : 436
% 0.20/0.54 # Rewrite failures with RHS unbound : 0
% 0.20/0.54 # BW rewrite match attempts : 125
% 0.20/0.54 # BW rewrite match successes : 62
% 0.20/0.54 # Condensation attempts : 0
% 0.20/0.54 # Condensation successes : 0
% 0.20/0.54 # Termbank termtop insertions : 20045
% 0.20/0.54 # Search garbage collected termcells : 1491
% 0.20/0.54
% 0.20/0.54 # -------------------------------------------------
% 0.20/0.54 # User time : 0.051 s
% 0.20/0.54 # System time : 0.003 s
% 0.20/0.54 # Total time : 0.055 s
% 0.20/0.54 # Maximum resident set size: 2632 pages
% 0.20/0.54
% 0.20/0.54 # -------------------------------------------------
% 0.20/0.54 # User time : 0.056 s
% 0.20/0.54 # System time : 0.008 s
% 0.20/0.54 # Total time : 0.063 s
% 0.20/0.54 # Maximum resident set size: 2020 pages
% 0.20/0.54 % E---3.1 exiting
% 0.20/0.54 % E exiting
%------------------------------------------------------------------------------