TSTP Solution File: SYN150-1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : SYN150-1 : TPTP v8.2.0. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n022.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:16 EDT 2024
% Result : Unsatisfiable 0.20s 0.54s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 4
% Syntax : Number of clauses : 13 ( 7 unt; 0 nHn; 13 RR)
% Number of literals : 19 ( 0 equ; 9 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 1 ( 1 usr; 1 con; 0-0 aty)
% Number of variables : 12 ( 6 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(prove_this,negated_conjecture,
~ n2(b),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).
cnf(c_0_4,plain,
( p1(X1,X1,X1)
| ~ k0(X1) ),
inference(fof_simplification,[status(thm)],[rule_068]) ).
cnf(c_0_5,plain,
( n2(X1)
| ~ p1(X2,X3,X1) ),
inference(fof_simplification,[status(thm)],[rule_137]) ).
cnf(c_0_6,plain,
( p1(X1,X1,X1)
| ~ k0(X1) ),
c_0_4 ).
cnf(c_0_7,axiom,
k0(b),
axiom_32 ).
cnf(c_0_8,negated_conjecture,
~ n2(b),
inference(fof_simplification,[status(thm)],[prove_this]) ).
cnf(c_0_9,plain,
( n2(X1)
| ~ p1(X2,X3,X1) ),
c_0_5 ).
cnf(c_0_10,plain,
p1(b,b,b),
inference(spm,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_11,negated_conjecture,
~ n2(b),
c_0_8 ).
cnf(c_0_12,plain,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_10]),c_0_11]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : SYN150-1 : TPTP v8.2.0. Released v1.1.0.
% 0.10/0.14 % Command : run_E %s %d THM
% 0.14/0.35 % Computer : n022.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Mon May 20 15:18:08 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.20/0.48 Running first-order model finding
% 0.20/0.48 Running: /export/starexec/sandbox2/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/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_3 with pid 831 completed with status 0
% 0.20/0.54 # Result found by new_bool_3
% 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 # 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 841 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 # 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.005 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 : 41
% 0.20/0.54 # Initial clauses : 328
% 0.20/0.54 # Removed in clause preprocessing : 5
% 0.20/0.54 # Initial clauses in saturation : 323
% 0.20/0.54 # Processed clauses : 420
% 0.20/0.54 # ...of these trivial : 12
% 0.20/0.54 # ...subsumed : 23
% 0.20/0.54 # ...remaining for further processing : 385
% 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 : 2
% 0.20/0.54 # Backward-rewritten : 14
% 0.20/0.54 # Generated clauses : 48
% 0.20/0.54 # ...of the previous two non-redundant : 41
% 0.20/0.54 # ...aggressively subsumed : 0
% 0.20/0.54 # Contextual simplify-reflections : 1
% 0.20/0.54 # Paramodulations : 48
% 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 : 96
% 0.20/0.54 # ...of those cached : 51
% 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 : 80
% 0.20/0.54 # Positive orientable unit clauses : 51
% 0.20/0.54 # Positive unorientable unit clauses: 0
% 0.20/0.54 # Negative unit clauses : 1
% 0.20/0.54 # Non-unit-clauses : 28
% 0.20/0.54 # Current number of unprocessed clauses: 232
% 0.20/0.54 # ...number of literals in the above : 685
% 0.20/0.54 # Current number of archived formulas : 0
% 0.20/0.54 # Current number of archived clauses : 305
% 0.20/0.54 # Clause-clause subsumption calls (NU) : 17799
% 0.20/0.54 # Rec. Clause-clause subsumption calls : 11615
% 0.20/0.54 # Non-unit clause-clause subsumptions : 26
% 0.20/0.54 # Unit Clause-clause subsumption calls : 61
% 0.20/0.54 # Rewrite failures with RHS unbound : 0
% 0.20/0.54 # BW rewrite match attempts : 13
% 0.20/0.54 # BW rewrite match successes : 12
% 0.20/0.54 # Condensation attempts : 0
% 0.20/0.54 # Condensation successes : 0
% 0.20/0.54 # Termbank termtop insertions : 12079
% 0.20/0.54 # Search garbage collected termcells : 1516
% 0.20/0.54
% 0.20/0.54 # -------------------------------------------------
% 0.20/0.54 # User time : 0.033 s
% 0.20/0.54 # System time : 0.006 s
% 0.20/0.54 # Total time : 0.039 s
% 0.20/0.54 # Maximum resident set size: 2604 pages
% 0.20/0.54
% 0.20/0.54 # -------------------------------------------------
% 0.20/0.54 # User time : 0.038 s
% 0.20/0.54 # System time : 0.010 s
% 0.20/0.54 # Total time : 0.048 s
% 0.20/0.54 # Maximum resident set size: 2020 pages
% 0.20/0.54 % E---3.1 exiting
%------------------------------------------------------------------------------