TSTP Solution File: SYN126-1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SYN126-1 : TPTP v8.2.0. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n023.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:28 EDT 2024
% Result : Unsatisfiable 0.20s 0.52s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 6
% Syntax : Number of clauses : 21 ( 9 unt; 0 nHn; 21 RR)
% Number of literals : 33 ( 0 equ; 15 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 6 ( 5 usr; 1 prp; 0-3 aty)
% Number of functors : 1 ( 1 usr; 1 con; 0-0 aty)
% Number of variables : 24 ( 12 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(rule_068,axiom,
( p1(X1,X1,X1)
| ~ k0(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_068) ).
cnf(rule_137,axiom,
( n2(X1)
| ~ p1(X2,X3,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_137) ).
cnf(axiom_32,axiom,
k0(b),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',axiom_32) ).
cnf(rule_244,axiom,
( p3(X1,X1,X1)
| ~ n2(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_244) ).
cnf(rule_277,axiom,
( l4(X1)
| ~ p3(X2,X3,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_277) ).
cnf(prove_this,negated_conjecture,
~ l4(b),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).
cnf(c_0_6,plain,
( p1(X1,X1,X1)
| ~ k0(X1) ),
inference(fof_simplification,[status(thm)],[rule_068]) ).
cnf(c_0_7,plain,
( n2(X1)
| ~ p1(X2,X3,X1) ),
inference(fof_simplification,[status(thm)],[rule_137]) ).
cnf(c_0_8,plain,
( p1(X1,X1,X1)
| ~ k0(X1) ),
c_0_6 ).
cnf(c_0_9,axiom,
k0(b),
axiom_32 ).
cnf(c_0_10,plain,
( p3(X1,X1,X1)
| ~ n2(X1) ),
inference(fof_simplification,[status(thm)],[rule_244]) ).
cnf(c_0_11,plain,
( n2(X1)
| ~ p1(X2,X3,X1) ),
c_0_7 ).
cnf(c_0_12,plain,
p1(b,b,b),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_13,plain,
( l4(X1)
| ~ p3(X2,X3,X1) ),
inference(fof_simplification,[status(thm)],[rule_277]) ).
cnf(c_0_14,plain,
( p3(X1,X1,X1)
| ~ n2(X1) ),
c_0_10 ).
cnf(c_0_15,plain,
n2(b),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_16,negated_conjecture,
~ l4(b),
inference(fof_simplification,[status(thm)],[prove_this]) ).
cnf(c_0_17,plain,
( l4(X1)
| ~ p3(X2,X3,X1) ),
c_0_13 ).
cnf(c_0_18,plain,
p3(b,b,b),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_19,negated_conjecture,
~ l4(b),
c_0_16 ).
cnf(c_0_20,plain,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SYN126-1 : TPTP v8.2.0. Released v1.1.0.
% 0.11/0.13 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n023.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Mon May 20 15:22:08 EDT 2024
% 0.13/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.52 # Version: 3.1.0
% 0.20/0.52 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.20/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.52 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.20/0.52 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.52 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.52 # Starting sh5l with 300s (1) cores
% 0.20/0.52 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 1563 completed with status 0
% 0.20/0.52 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.20/0.52 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.20/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.52 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.20/0.52 # No SInE strategy applied
% 0.20/0.52 # Search class: FHUNM-FSLM00-SFFFFFNN
% 0.20/0.52 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/0.52 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.20/0.52 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.20/0.52 # Starting new_bool_3 with 136s (1) cores
% 0.20/0.52 # Starting new_bool_1 with 136s (1) cores
% 0.20/0.52 # Starting sh5l with 136s (1) cores
% 0.20/0.52 # SAT001_MinMin_p005000_rr_RG with pid 1568 completed with status 0
% 0.20/0.52 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.20/0.52 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.20/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.52 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.20/0.52 # No SInE strategy applied
% 0.20/0.52 # Search class: FHUNM-FSLM00-SFFFFFNN
% 0.20/0.52 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/0.52 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.20/0.52 # Preprocessing time : 0.003 s
% 0.20/0.52 # Presaturation interreduction done
% 0.20/0.52
% 0.20/0.52 # Proof found!
% 0.20/0.52 # SZS status Unsatisfiable
% 0.20/0.52 # SZS output start CNFRefutation
% See solution above
% 0.20/0.52 # Parsed axioms : 369
% 0.20/0.52 # Removed by relevancy pruning/SinE : 0
% 0.20/0.52 # Initial clauses : 369
% 0.20/0.52 # Removed in clause preprocessing : 7
% 0.20/0.52 # Initial clauses in saturation : 362
% 0.20/0.52 # Processed clauses : 498
% 0.20/0.52 # ...of these trivial : 11
% 0.20/0.52 # ...subsumed : 23
% 0.20/0.52 # ...remaining for further processing : 464
% 0.20/0.52 # Other redundant clauses eliminated : 0
% 0.20/0.52 # Clauses deleted for lack of memory : 0
% 0.20/0.52 # Backward-subsumed : 4
% 0.20/0.52 # Backward-rewritten : 20
% 0.20/0.52 # Generated clauses : 65
% 0.20/0.52 # ...of the previous two non-redundant : 57
% 0.20/0.52 # ...aggressively subsumed : 0
% 0.20/0.52 # Contextual simplify-reflections : 2
% 0.20/0.52 # Paramodulations : 65
% 0.20/0.52 # Factorizations : 0
% 0.20/0.52 # NegExts : 0
% 0.20/0.52 # Equation resolutions : 0
% 0.20/0.52 # Disequality decompositions : 0
% 0.20/0.52 # Total rewrite steps : 106
% 0.20/0.52 # ...of those cached : 54
% 0.20/0.52 # Propositional unsat checks : 0
% 0.20/0.52 # Propositional check models : 0
% 0.20/0.52 # Propositional check unsatisfiable : 0
% 0.20/0.52 # Propositional clauses : 0
% 0.20/0.52 # Propositional clauses after purity: 0
% 0.20/0.52 # Propositional unsat core size : 0
% 0.20/0.52 # Propositional preprocessing time : 0.000
% 0.20/0.52 # Propositional encoding time : 0.000
% 0.20/0.52 # Propositional solver time : 0.000
% 0.20/0.52 # Success case prop preproc time : 0.000
% 0.20/0.52 # Success case prop encoding time : 0.000
% 0.20/0.52 # Success case prop solver time : 0.000
% 0.20/0.52 # Current number of processed clauses : 112
% 0.20/0.52 # Positive orientable unit clauses : 65
% 0.20/0.52 # Positive unorientable unit clauses: 0
% 0.20/0.52 # Negative unit clauses : 1
% 0.20/0.52 # Non-unit-clauses : 46
% 0.20/0.52 # Current number of unprocessed clauses: 248
% 0.20/0.52 # ...number of literals in the above : 750
% 0.20/0.52 # Current number of archived formulas : 0
% 0.20/0.52 # Current number of archived clauses : 352
% 0.20/0.52 # Clause-clause subsumption calls (NU) : 24549
% 0.20/0.52 # Rec. Clause-clause subsumption calls : 16198
% 0.20/0.52 # Non-unit clause-clause subsumptions : 28
% 0.20/0.52 # Unit Clause-clause subsumption calls : 115
% 0.20/0.52 # Rewrite failures with RHS unbound : 0
% 0.20/0.52 # BW rewrite match attempts : 21
% 0.20/0.52 # BW rewrite match successes : 17
% 0.20/0.52 # Condensation attempts : 0
% 0.20/0.52 # Condensation successes : 0
% 0.20/0.52 # Termbank termtop insertions : 13443
% 0.20/0.52 # Search garbage collected termcells : 1461
% 0.20/0.52
% 0.20/0.52 # -------------------------------------------------
% 0.20/0.52 # User time : 0.028 s
% 0.20/0.52 # System time : 0.004 s
% 0.20/0.52 # Total time : 0.032 s
% 0.20/0.52 # Maximum resident set size: 2636 pages
% 0.20/0.52
% 0.20/0.52 # -------------------------------------------------
% 0.20/0.52 # User time : 0.118 s
% 0.20/0.52 # System time : 0.016 s
% 0.20/0.52 # Total time : 0.134 s
% 0.20/0.52 # Maximum resident set size: 2016 pages
% 0.20/0.52 % E---3.1 exiting
% 0.20/0.52 % E exiting
%------------------------------------------------------------------------------