↑ Up

E---3.5.1.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : E---3.5.1
% Problem  : SYN655-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 : n013.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:25:49 PM UTC 2026

% Result   : Unsatisfiable 0.13s 5.47s
% Output   : CNFRefutation 0.13s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    7
% Syntax   : Number of clauses     :   28 (  14 unt;   0 nHn;  15 RR)
%            Number of literals    :   45 (   0 equ;  20 neg)
%            Maximal clause size   :    3 (   1 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of predicates  :    4 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :   19 (  19 usr;  12 con; 0-8 aty)
%            Number of variables   :  104 (  38 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(p9_17,negated_conjecture,
    ( ~ p9(X3,X2)
    | ~ p9(X3,X1)
    | p9(X1,X2) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',p9_17) ).

cnf(p9_35,negated_conjecture,
    ( ~ p21(f11(X3,X4,X7,X8,X1,X5),X6)
    | p9(X1,f15(X2,X3,X4,X5,X6,X7,X8,X1)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',p9_35) ).

cnf(p3_48,negated_conjecture,
    ( ~ p21(f11(X3,X4,X6,X7,X8,X5),X1)
    | p3(X1,f11(f19(X2,X3,X4,X5,X1,X6,X7,X8),f18(X2,X3,X4,X5,X1,X6,X7,X8),f17(X2,X3,X4,X5,X1,X6,X7,X8),f16(X2,X3,X4,X5,X1,X6,X7,X8),f15(X2,X3,X4,X5,X1,X6,X7,X8),f14(X2,X3,X4,X5,X1,X6,X7,X8))) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',p3_48) ).

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

cnf(p21_27,negated_conjecture,
    p21(f11(c24,c25,c26,c27,c22,c28),f11(c29,c30,c31,c32,c23,c33)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',p21_27) ).

cnf(p9_30,negated_conjecture,
    ( ~ p3(f11(X3,X4,X5,X6,X1,X7),f11(X8,X9,X10,X11,X2,X12))
    | p9(X1,X2) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',p9_30) ).

cnf(not_p9_10,negated_conjecture,
    ~ p9(c22,c23),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',not_p9_10) ).

cnf(c_0_7,negated_conjecture,
    ( ~ p9(X3,X2)
    | ~ p9(X3,X1)
    | p9(X1,X2) ),
    inference(fof_simplification,[status(thm)],[p9_17]) ).

cnf(c_0_8,negated_conjecture,
    ( ~ p21(f11(X3,X4,X7,X8,X1,X5),X6)
    | p9(X1,f15(X2,X3,X4,X5,X6,X7,X8,X1)) ),
    inference(fof_simplification,[status(thm)],[p9_35]) ).

cnf(c_0_9,negated_conjecture,
    ( ~ p21(f11(X3,X4,X6,X7,X8,X5),X1)
    | p3(X1,f11(f19(X2,X3,X4,X5,X1,X6,X7,X8),f18(X2,X3,X4,X5,X1,X6,X7,X8),f17(X2,X3,X4,X5,X1,X6,X7,X8),f16(X2,X3,X4,X5,X1,X6,X7,X8),f15(X2,X3,X4,X5,X1,X6,X7,X8),f14(X2,X3,X4,X5,X1,X6,X7,X8))) ),
    inference(fof_simplification,[status(thm)],[p3_48]) ).

cnf(c_0_10,negated_conjecture,
    ( ~ p9(X3,X2)
    | ~ p9(X3,X1)
    | p9(X1,X2) ),
    c_0_7 ).

cnf(c_0_11,negated_conjecture,
    p9(X1,X1),
    p9_2 ).

cnf(c_0_12,negated_conjecture,
    ( ~ p21(f11(X3,X4,X7,X8,X1,X5),X6)
    | p9(X1,f15(X2,X3,X4,X5,X6,X7,X8,X1)) ),
    c_0_8 ).

cnf(c_0_13,negated_conjecture,
    p21(f11(c24,c25,c26,c27,c22,c28),f11(c29,c30,c31,c32,c23,c33)),
    p21_27 ).

cnf(c_0_14,negated_conjecture,
    ( ~ p3(f11(X3,X4,X5,X6,X1,X7),f11(X8,X9,X10,X11,X2,X12))
    | p9(X1,X2) ),
    inference(fof_simplification,[status(thm)],[p9_30]) ).

cnf(c_0_15,negated_conjecture,
    ( ~ p21(f11(X3,X4,X6,X7,X8,X5),X1)
    | p3(X1,f11(f19(X2,X3,X4,X5,X1,X6,X7,X8),f18(X2,X3,X4,X5,X1,X6,X7,X8),f17(X2,X3,X4,X5,X1,X6,X7,X8),f16(X2,X3,X4,X5,X1,X6,X7,X8),f15(X2,X3,X4,X5,X1,X6,X7,X8),f14(X2,X3,X4,X5,X1,X6,X7,X8))) ),
    c_0_9 ).

cnf(c_0_16,negated_conjecture,
    ( ~ p9(X2,X1)
    | p9(X1,X2) ),
    inference(spm,[status(thm)],[c_0_10,c_0_11]) ).

cnf(c_0_17,negated_conjecture,
    p9(c22,f15(X1,c24,c25,c28,f11(c29,c30,c31,c32,c23,c33),c26,c27,c22)),
    inference(spm,[status(thm)],[c_0_12,c_0_13]) ).

cnf(c_0_18,negated_conjecture,
    ( ~ p3(f11(X3,X4,X5,X6,X1,X7),f11(X8,X9,X10,X11,X2,X12))
    | p9(X1,X2) ),
    c_0_14 ).

cnf(c_0_19,negated_conjecture,
    p3(f11(c29,c30,c31,c32,c23,c33),f11(f19(X1,c24,c25,c28,f11(c29,c30,c31,c32,c23,c33),c26,c27,c22),f18(X1,c24,c25,c28,f11(c29,c30,c31,c32,c23,c33),c26,c27,c22),f17(X1,c24,c25,c28,f11(c29,c30,c31,c32,c23,c33),c26,c27,c22),f16(X1,c24,c25,c28,f11(c29,c30,c31,c32,c23,c33),c26,c27,c22),f15(X1,c24,c25,c28,f11(c29,c30,c31,c32,c23,c33),c26,c27,c22),f14(X1,c24,c25,c28,f11(c29,c30,c31,c32,c23,c33),c26,c27,c22))),
    inference(spm,[status(thm)],[c_0_15,c_0_13]) ).

cnf(c_0_20,negated_conjecture,
    p9(f15(X1,c24,c25,c28,f11(c29,c30,c31,c32,c23,c33),c26,c27,c22),c22),
    inference(spm,[status(thm)],[c_0_16,c_0_17]) ).

cnf(c_0_21,negated_conjecture,
    p9(c23,f15(X1,c24,c25,c28,f11(c29,c30,c31,c32,c23,c33),c26,c27,c22)),
    inference(spm,[status(thm)],[c_0_18,c_0_19]) ).

cnf(c_0_22,negated_conjecture,
    ( ~ p9(f15(X2,c24,c25,c28,f11(c29,c30,c31,c32,c23,c33),c26,c27,c22),X1)
    | p9(X1,c22) ),
    inference(spm,[status(thm)],[c_0_10,c_0_20]) ).

cnf(c_0_23,negated_conjecture,
    p9(f15(X1,c24,c25,c28,f11(c29,c30,c31,c32,c23,c33),c26,c27,c22),c23),
    inference(spm,[status(thm)],[c_0_16,c_0_21]) ).

cnf(c_0_24,negated_conjecture,
    ~ p9(c22,c23),
    inference(fof_simplification,[status(thm)],[not_p9_10]) ).

cnf(c_0_25,negated_conjecture,
    p9(c23,c22),
    inference(spm,[status(thm)],[c_0_22,c_0_23]) ).

cnf(c_0_26,negated_conjecture,
    ~ p9(c22,c23),
    c_0_24 ).

cnf(c_0_27,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_25]),c_0_26]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SYN655-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.08/5.37  % Computer : n013.cluster.edu
% 0.08/5.37  % Model    : x86_64 x86_64
% 0.08/5.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/5.37  % Memory   : 8046.5625MB
% 0.08/5.37  % OS       : Linux 6.8.0-71-generic
% 0.08/5.37  % CPULimit : 300
% 0.08/5.37  % WCLimit  : 300
% 0.08/5.37  % DateTime : Mon Sep 21 11:10:58 UTC 2026
% 0.08/5.37  % CPUTime  : 
% 0.08/5.37  Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.13/5.42  Running first-order theorem proving
% 0.13/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.13/5.47  % Version: 3.5.1
% 0.13/5.47  % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.13/5.47  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/5.47  % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.13/5.47  % Starting new_bool_3 with 300s (1) cores
% 0.13/5.47  % Starting new_bool_1 with 300s (1) cores
% 0.13/5.47  % Starting sh5l with 300s (1) cores
% 0.13/5.47  % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 630726 completed with status 0
% 0.13/5.47  % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.13/5.47  % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.13/5.47  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/5.47  % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.13/5.47  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.13/5.47  % No SInE strategy applied
% 0.13/5.47  % Search class: FHUNM-FFMF33-SFFFFFNN
% 0.13/5.47  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.13/5.47  % Starting SubtermCWHack with 136s (1) cores
% 0.13/5.47  % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.13/5.47  % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.13/5.47  % Starting new_bool_3 with 136s (1) cores
% 0.13/5.47  % Starting new_bool_1 with 136s (1) cores
% 0.13/5.47  % new_bool_3 with pid 630733 completed with status 0
% 0.13/5.47  % Result found by new_bool_3
% 0.13/5.47  % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.13/5.47  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/5.47  % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.13/5.47  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.13/5.47  % No SInE strategy applied
% 0.13/5.47  % Search class: FHUNM-FFMF33-SFFFFFNN
% 0.13/5.47  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.13/5.47  % Starting SubtermCWHack with 136s (1) cores
% 0.13/5.47  % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.13/5.47  % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.13/5.47  % Starting new_bool_3 with 136s (1) cores
% 0.13/5.47  % Preprocessing time       : 0.002 s
% 0.13/5.47  % Presaturation interreduction done
% 0.13/5.47  
% 0.13/5.47  % Proof found!
% 0.13/5.47  % SZS status Unsatisfiable
% 0.13/5.47  % SZS output start CNFRefutation
% See solution above
% 0.13/5.47  % Parsed axioms                        : 48
% 0.13/5.47  % Removed by relevancy pruning/SinE    : 0
% 0.13/5.47  % Initial clauses                      : 48
% 0.13/5.47  % Removed in clause preprocessing      : 0
% 0.13/5.47  % Initial clauses in saturation        : 48
% 0.13/5.47  % Processed clauses                    : 247
% 0.13/5.47  % ...of these trivial                  : 1
% 0.13/5.47  % ...subsumed                          : 5
% 0.13/5.47  % ...remaining for further processing  : 241
% 0.13/5.47  % Other redundant clauses eliminated   : 0
% 0.13/5.47  % Clauses deleted for lack of memory   : 0
% 0.13/5.47  % Backward-subsumed                    : 1
% 0.13/5.47  % Backward-rewritten                   : 1
% 0.13/5.47  % Generated clauses                    : 598
% 0.13/5.47  % ...of the previous two non-redundant : 476
% 0.13/5.47  % ...aggressively subsumed             : 0
% 0.13/5.47  % Contextual simplify-reflections      : 0
% 0.13/5.47  % Paramodulations                      : 598
% 0.13/5.47  % Factorizations                       : 0
% 0.13/5.47  % NegExts                              : 0
% 0.13/5.47  % Equation resolutions                 : 0
% 0.13/5.47  % Disequality decompositions           : 0
% 0.13/5.47  % Total rewrite steps                  : 104
% 0.13/5.47  % ...of those cached                   : 53
% 0.13/5.47  % Propositional unsat checks           : 0
% 0.13/5.47  %    Propositional check models        : 0
% 0.13/5.47  %    Propositional check unsatisfiable : 0
% 0.13/5.47  %    Propositional clauses             : 0
% 0.13/5.47  %    Propositional clauses after purity: 0
% 0.13/5.47  %    Propositional unsat core size     : 0
% 0.13/5.47  %    Propositional preprocessing time  : 0.000
% 0.13/5.47  %    Propositional encoding time       : 0.000
% 0.13/5.47  %    Propositional solver time         : 0.000
% 0.13/5.47  %    Success case prop preproc time    : 0.000
% 0.13/5.47  %    Success case prop encoding time   : 0.000
% 0.13/5.47  %    Success case prop solver time     : 0.000
% 0.13/5.47  % Current number of processed clauses  : 193
% 0.13/5.47  %    Positive orientable unit clauses  : 44
% 0.13/5.47  %    Positive unorientable unit clauses: 0
% 0.13/5.47  %    Negative unit clauses             : 2
% 0.13/5.47  %    Non-unit-clauses                  : 147
% 0.13/5.47  % Current number of unprocessed clauses: 322
% 0.13/5.47  % ...number of literals in the above   : 839
% 0.13/5.47  % Current number of archived formulas  : 0
% 0.13/5.47  % Current number of archived clauses   : 48
% 0.13/5.47  % Clause-clause subsumption calls (NU) : 3849
% 0.13/5.47  % Rec. Clause-clause subsumption calls : 2056
% 0.13/5.47  % Non-unit clause-clause subsumptions  : 6
% 0.13/5.47  % Unit Clause-clause subsumption calls : 293
% 0.13/5.47  % Rewrite failures with RHS unbound    : 0
% 0.13/5.47  % BW rewrite match attempts            : 39
% 0.13/5.47  % BW rewrite match successes           : 1
% 0.13/5.47  % Condensation attempts                : 0
% 0.13/5.47  % Condensation successes               : 0
% 0.13/5.47  % Termbank termtop insertions          : 20144
% 0.13/5.47  % Search garbage collected termcells   : 209
% 0.13/5.47  
% 0.13/5.47  % -------------------------------------------------
% 0.13/5.47  % User time                : 0.028 s
% 0.13/5.47  % System time              : 0.009 s
% 0.13/5.47  % Total time               : 0.037 s
% 0.13/5.47  % Maximum resident set size: 3692 pages
% 0.13/5.47  
% 0.13/5.47  % -------------------------------------------------
% 0.13/5.47  % User time                : 0.158 s
% 0.13/5.47  % System time              : 0.023 s
% 0.13/5.47  % Total time               : 0.181 s
% 0.13/5.47  % Maximum resident set size: 4864 pages
% 0.13/5.47  % E exiting
%------------------------------------------------------------------------------