↑ Up

E-SAT---3.5.1.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : E-SAT---3.5.1
% Problem  : SYN622-1 : TPTP v9.3.1. Released v2.5.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM

% Computer : n001.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8046.5625MB
% OS       : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Thu Sep 24 03:35:23 PM UTC 2026

% Result   : Unsatisfiable 0.14s 5.56s
% Output   : CNFRefutation 0.14s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    7
% Syntax   : Number of clauses     :   24 (  15 unt;   0 nHn;  12 RR)
%            Number of literals    :   39 (   0 equ;  18 neg)
%            Maximal clause size   :    3 (   1 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of predicates  :    3 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    8 (   8 usr;   4 con; 0-2 aty)
%            Number of variables   :   45 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(p8_31,negated_conjecture,
    ( ~ p8(X2,X4)
    | ~ p11(X1,X3)
    | p8(f12(X1,X2),f12(X3,X4)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',p8_31) ).

cnf(p11_1,negated_conjecture,
    p11(X1,X1),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',p11_1) ).

cnf(p8_21,negated_conjecture,
    ( ~ p8(X3,X2)
    | ~ p8(X3,X1)
    | p8(X1,X2) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',p8_21) ).

cnf(p8_8,negated_conjecture,
    p8(f16(X1,f17(X2,X1)),X2),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',p8_8) ).

cnf(p8_3,negated_conjecture,
    p8(X1,X1),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',p8_3) ).

cnf(p8_24,negated_conjecture,
    p8(f12(f13(c23),X1),f12(f13(c26),f16(c27,X1))),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',p8_24) ).

cnf(not_p8_26,negated_conjecture,
    ~ p8(f12(f13(c23),f17(c28,c27)),f12(f13(c26),c28)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',not_p8_26) ).

cnf(c_0_7,negated_conjecture,
    ( ~ p8(X2,X4)
    | ~ p11(X1,X3)
    | p8(f12(X1,X2),f12(X3,X4)) ),
    inference(fof_simplification,[status(thm)],[p8_31]) ).

cnf(c_0_8,negated_conjecture,
    ( ~ p8(X2,X4)
    | ~ p11(X1,X3)
    | p8(f12(X1,X2),f12(X3,X4)) ),
    c_0_7 ).

cnf(c_0_9,negated_conjecture,
    p11(X1,X1),
    p11_1 ).

cnf(c_0_10,negated_conjecture,
    ( ~ p8(X3,X2)
    | ~ p8(X3,X1)
    | p8(X1,X2) ),
    inference(fof_simplification,[status(thm)],[p8_21]) ).

cnf(c_0_11,negated_conjecture,
    ( ~ p8(X2,X3)
    | p8(f12(X1,X2),f12(X1,X3)) ),
    inference(spm,[status(thm)],[c_0_8,c_0_9]) ).

cnf(c_0_12,negated_conjecture,
    p8(f16(X1,f17(X2,X1)),X2),
    p8_8 ).

cnf(c_0_13,negated_conjecture,
    ( ~ p8(X3,X2)
    | ~ p8(X3,X1)
    | p8(X1,X2) ),
    c_0_10 ).

cnf(c_0_14,negated_conjecture,
    p8(X1,X1),
    p8_3 ).

cnf(c_0_15,negated_conjecture,
    p8(f12(X1,f16(X2,f17(X3,X2))),f12(X1,X3)),
    inference(spm,[status(thm)],[c_0_11,c_0_12]) ).

cnf(c_0_16,negated_conjecture,
    ( ~ p8(X2,X1)
    | p8(X1,X2) ),
    inference(spm,[status(thm)],[c_0_13,c_0_14]) ).

cnf(c_0_17,negated_conjecture,
    p8(f12(f13(c23),X1),f12(f13(c26),f16(c27,X1))),
    p8_24 ).

cnf(c_0_18,negated_conjecture,
    ~ p8(f12(f13(c23),f17(c28,c27)),f12(f13(c26),c28)),
    inference(fof_simplification,[status(thm)],[not_p8_26]) ).

cnf(c_0_19,negated_conjecture,
    ( ~ p8(f12(X2,f16(X4,f17(X3,X4))),X1)
    | p8(X1,f12(X2,X3)) ),
    inference(spm,[status(thm)],[c_0_13,c_0_15]) ).

cnf(c_0_20,negated_conjecture,
    p8(f12(f13(c26),f16(c27,X1)),f12(f13(c23),X1)),
    inference(spm,[status(thm)],[c_0_16,c_0_17]) ).

cnf(c_0_21,negated_conjecture,
    ~ p8(f12(f13(c23),f17(c28,c27)),f12(f13(c26),c28)),
    c_0_18 ).

cnf(c_0_22,negated_conjecture,
    p8(f12(f13(c23),f17(X1,c27)),f12(f13(c26),X1)),
    inference(spm,[status(thm)],[c_0_19,c_0_20]) ).

cnf(c_0_23,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_21,c_0_22])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SYN622-1 : TPTP v9.3.1. Released v2.5.0.
% 0.00/0.04  % Command  : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/5.37  % Computer : n001.cluster.edu
% 0.09/5.37  % Model    : x86_64 x86_64
% 0.09/5.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/5.37  % Memory   : 8046.5625MB
% 0.09/5.37  % OS       : Linux 6.8.0-71-generic
% 0.09/5.37  % CPULimit : 300
% 0.09/5.37  % WCLimit  : 300
% 0.09/5.37  % DateTime : Mon Sep 21 11:15:49 UTC 2026
% 0.09/5.37  % CPUTime  : 
% 0.09/5.37  Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.14/5.42  Running first-order theorem proving
% 0.14/5.42  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.14/5.56  % Version: 3.5.1
% 0.14/5.56  % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/5.56  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/5.56  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/5.56  % Starting new_bool_3 with 300s (1) cores
% 0.14/5.56  % Starting new_bool_1 with 300s (1) cores
% 0.14/5.56  % Starting sh5l with 300s (1) cores
% 0.14/5.56  % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 2981027 completed with status 0
% 0.14/5.56  % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.14/5.56  % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/5.56  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/5.56  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/5.56  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.14/5.56  % No SInE strategy applied
% 0.14/5.56  % Search class: FGUNM-FFMF21-MFFFFFNN
% 0.14/5.56  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.14/5.56  % Starting SubtermCWHack with 136s (1) cores
% 0.14/5.56  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.14/5.56  % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.14/5.56  % Starting new_bool_3 with 136s (1) cores
% 0.14/5.56  % Starting new_bool_1 with 136s (1) cores
% 0.14/5.56  % new_bool_3 with pid 2981035 completed with status 0
% 0.14/5.56  % Result found by new_bool_3
% 0.14/5.56  % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/5.56  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/5.56  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/5.56  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.14/5.56  % No SInE strategy applied
% 0.14/5.56  % Search class: FGUNM-FFMF21-MFFFFFNN
% 0.14/5.56  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.14/5.56  % Starting SubtermCWHack with 136s (1) cores
% 0.14/5.56  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.14/5.56  % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.14/5.56  % Starting new_bool_3 with 136s (1) cores
% 0.14/5.56  % Preprocessing time       : 0.002 s
% 0.14/5.56  % Presaturation interreduction done
% 0.14/5.56  
% 0.14/5.56  % Proof found!
% 0.14/5.56  % SZS status Unsatisfiable
% 0.14/5.56  % SZS output start CNFRefutation
% See solution above
% 0.14/5.56  % Parsed axioms                        : 34
% 0.14/5.56  % Removed by relevancy pruning/SinE    : 0
% 0.14/5.56  % Initial clauses                      : 34
% 0.14/5.56  % Removed in clause preprocessing      : 0
% 0.14/5.56  % Initial clauses in saturation        : 34
% 0.14/5.56  % Processed clauses                    : 1085
% 0.14/5.56  % ...of these trivial                  : 184
% 0.14/5.56  % ...subsumed                          : 3
% 0.14/5.56  % ...remaining for further processing  : 898
% 0.14/5.56  % Other redundant clauses eliminated   : 0
% 0.14/5.56  % Clauses deleted for lack of memory   : 0
% 0.14/5.56  % Backward-subsumed                    : 0
% 0.14/5.56  % Backward-rewritten                   : 1
% 0.14/5.56  % Generated clauses                    : 6222
% 0.14/5.56  % ...of the previous two non-redundant : 5258
% 0.14/5.56  % ...aggressively subsumed             : 0
% 0.14/5.56  % Contextual simplify-reflections      : 0
% 0.14/5.56  % Paramodulations                      : 6222
% 0.14/5.56  % Factorizations                       : 0
% 0.14/5.56  % NegExts                              : 0
% 0.14/5.56  % Equation resolutions                 : 0
% 0.14/5.56  % Disequality decompositions           : 0
% 0.14/5.56  % Total rewrite steps                  : 1116
% 0.14/5.56  % ...of those cached                   : 341
% 0.14/5.56  % Propositional unsat checks           : 0
% 0.14/5.56  %    Propositional check models        : 0
% 0.14/5.56  %    Propositional check unsatisfiable : 0
% 0.14/5.56  %    Propositional clauses             : 0
% 0.14/5.56  %    Propositional clauses after purity: 0
% 0.14/5.56  %    Propositional unsat core size     : 0
% 0.14/5.56  %    Propositional preprocessing time  : 0.000
% 0.14/5.56  %    Propositional encoding time       : 0.000
% 0.14/5.56  %    Propositional solver time         : 0.000
% 0.14/5.56  %    Success case prop preproc time    : 0.000
% 0.14/5.56  %    Success case prop encoding time   : 0.000
% 0.14/5.56  %    Success case prop solver time     : 0.000
% 0.14/5.56  % Current number of processed clauses  : 863
% 0.14/5.56  %    Positive orientable unit clauses  : 459
% 0.14/5.56  %    Positive unorientable unit clauses: 0
% 0.14/5.56  %    Negative unit clauses             : 1
% 0.14/5.56  %    Non-unit-clauses                  : 403
% 0.14/5.56  % Current number of unprocessed clauses: 4241
% 0.14/5.56  % ...number of literals in the above   : 4537
% 0.14/5.56  % Current number of archived formulas  : 0
% 0.14/5.56  % Current number of archived clauses   : 35
% 0.14/5.56  % Clause-clause subsumption calls (NU) : 18059
% 0.14/5.56  % Rec. Clause-clause subsumption calls : 14644
% 0.14/5.56  % Non-unit clause-clause subsumptions  : 3
% 0.14/5.56  % Unit Clause-clause subsumption calls : 2864
% 0.14/5.56  % Rewrite failures with RHS unbound    : 0
% 0.14/5.56  % BW rewrite match attempts            : 4638
% 0.14/5.56  % BW rewrite match successes           : 1
% 0.14/5.56  % Condensation attempts                : 0
% 0.14/5.56  % Condensation successes               : 0
% 0.14/5.56  % Termbank termtop insertions          : 118805
% 0.14/5.56  % Search garbage collected termcells   : 95
% 0.14/5.56  
% 0.14/5.56  % -------------------------------------------------
% 0.14/5.56  % User time                : 0.108 s
% 0.14/5.56  % System time              : 0.016 s
% 0.14/5.56  % Total time               : 0.124 s
% 0.14/5.56  % Maximum resident set size: 3412 pages
% 0.14/5.56  
% 0.14/5.56  % -------------------------------------------------
% 0.14/5.56  % User time                : 0.571 s
% 0.14/5.56  % System time              : 0.051 s
% 0.14/5.56  % Total time               : 0.622 s
% 0.14/5.56  % Maximum resident set size: 4608 pages
% 0.14/5.56  % E exiting
%------------------------------------------------------------------------------