↑ Up

E---3.5.1.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : E---3.5.1
% Problem  : SYN621-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 : n019.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:45 PM UTC 2026

% Result   : Unsatisfiable 0.09s 0.43s
% Output   : CNFRefutation 0.09s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :    6
% Syntax   : Number of clauses     :   19 (   8 unt;   5 nHn;  14 RR)
%            Number of literals    :   34 (   0 equ;  16 neg)
%            Maximal clause size   :    3 (   1 avg)
%            Maximal term depth    :    6 (   2 avg)
%            Number of predicates  :    4 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :   19 (  19 usr;   6 con; 0-4 aty)
%            Number of variables   :   34 (   3 sgn)

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

cnf(p21_31,negated_conjecture,
    ( ~ p22(X1,f14(f11(c25,f12(c23,c26))))
    | p21(f5(f6(c27,f9(f11(c25,f12(c23,c26)),c28,c27))),f5(f6(c27,X1))) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',p21_31) ).

cnf(not_p2_7,negated_conjecture,
    ~ p2(c23,f3(c24)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',not_p2_7) ).

cnf(p2_34,negated_conjecture,
    ( p21(f5(f6(X2,f20(X3,X1,X4,X2))),f15(f19(f11(X3,f12(X1,X4)),X2),f16(f3(f17(f18(c24))))))
    | p2(X1,f3(c24)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',p2_34) ).

cnf(p2_28,negated_conjecture,
    ( p22(f20(X2,X1,X3,X4),f14(f11(X2,f12(X1,X3))))
    | p2(X1,f3(c24)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',p2_28) ).

cnf(not_p21_32,negated_conjecture,
    ~ p21(f5(f6(c27,f9(f11(c25,f12(c23,c26)),c28,c27))),f15(f19(f11(c25,f12(c23,c26)),c27),f16(f3(f17(f18(c24)))))),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',not_p21_32) ).

cnf(c_0_6,negated_conjecture,
    ( ~ p21(X3,X2)
    | ~ p21(X1,X3)
    | p21(X1,X2) ),
    inference(fof_simplification,[status(thm)],[p21_18]) ).

cnf(c_0_7,negated_conjecture,
    ( ~ p22(X1,f14(f11(c25,f12(c23,c26))))
    | p21(f5(f6(c27,f9(f11(c25,f12(c23,c26)),c28,c27))),f5(f6(c27,X1))) ),
    inference(fof_simplification,[status(thm)],[p21_31]) ).

cnf(c_0_8,negated_conjecture,
    ~ p2(c23,f3(c24)),
    inference(fof_simplification,[status(thm)],[not_p2_7]) ).

cnf(c_0_9,negated_conjecture,
    ( ~ p21(X3,X2)
    | ~ p21(X1,X3)
    | p21(X1,X2) ),
    c_0_6 ).

cnf(c_0_10,negated_conjecture,
    ( p21(f5(f6(X2,f20(X3,X1,X4,X2))),f15(f19(f11(X3,f12(X1,X4)),X2),f16(f3(f17(f18(c24))))))
    | p2(X1,f3(c24)) ),
    p2_34 ).

cnf(c_0_11,negated_conjecture,
    ( ~ p22(X1,f14(f11(c25,f12(c23,c26))))
    | p21(f5(f6(c27,f9(f11(c25,f12(c23,c26)),c28,c27))),f5(f6(c27,X1))) ),
    c_0_7 ).

cnf(c_0_12,negated_conjecture,
    ( p22(f20(X2,X1,X3,X4),f14(f11(X2,f12(X1,X3))))
    | p2(X1,f3(c24)) ),
    p2_28 ).

cnf(c_0_13,negated_conjecture,
    ~ p2(c23,f3(c24)),
    c_0_8 ).

cnf(c_0_14,negated_conjecture,
    ~ p21(f5(f6(c27,f9(f11(c25,f12(c23,c26)),c28,c27))),f15(f19(f11(c25,f12(c23,c26)),c27),f16(f3(f17(f18(c24)))))),
    inference(fof_simplification,[status(thm)],[not_p21_32]) ).

cnf(c_0_15,negated_conjecture,
    ( ~ p21(X1,f5(f6(X5,f20(X2,X3,X4,X5))))
    | p2(X3,f3(c24))
    | p21(X1,f15(f19(f11(X2,f12(X3,X4)),X5),f16(f3(f17(f18(c24)))))) ),
    inference(spm,[status(thm)],[c_0_9,c_0_10]) ).

cnf(c_0_16,negated_conjecture,
    p21(f5(f6(c27,f9(f11(c25,f12(c23,c26)),c28,c27))),f5(f6(c27,f20(c25,c23,c26,X1)))),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12]),c_0_13]) ).

cnf(c_0_17,negated_conjecture,
    ~ p21(f5(f6(c27,f9(f11(c25,f12(c23,c26)),c28,c27))),f15(f19(f11(c25,f12(c23,c26)),c27),f16(f3(f17(f18(c24)))))),
    c_0_14 ).

cnf(c_0_18,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_17]),c_0_13]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SYN621-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/0.36  % Computer : n019.cluster.edu
% 0.09/0.36  % Model    : x86_64 x86_64
% 0.09/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36  % Memory   : 8046.5625MB
% 0.09/0.36  % OS       : Linux 6.8.0-71-generic
% 0.09/0.36  % CPULimit : 300
% 0.09/0.36  % WCLimit  : 300
% 0.09/0.36  % DateTime : Mon Sep 21 11:10:20 UTC 2026
% 0.09/0.36  % CPUTime  : 
% 0.09/0.36  Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.40  Running first-order theorem proving
% 0.09/0.41  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.09/0.43  % Version: 3.5.1
% 0.09/0.43  % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.09/0.43  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.09/0.43  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.09/0.43  % Starting new_bool_3 with 300s (1) cores
% 0.09/0.43  % Starting new_bool_1 with 300s (1) cores
% 0.09/0.43  % Starting sh5l with 300s (1) cores
% 0.09/0.43  % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 2417981 completed with status 0
% 0.09/0.43  % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.09/0.43  % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.09/0.43  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.09/0.43  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.09/0.43  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.09/0.43  % No SInE strategy applied
% 0.09/0.43  % Search class: FGUNM-FFMF31-MFFFFFNN
% 0.09/0.43  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.09/0.43  % Starting SubtermCWHack with 136s (1) cores
% 0.09/0.43  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.09/0.43  % Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S0Y with 136s (1) cores
% 0.09/0.43  % Starting new_bool_3 with 136s (1) cores
% 0.09/0.43  % Starting new_bool_1 with 136s (1) cores
% 0.09/0.43  % new_bool_1 with pid 2417989 completed with status 0
% 0.09/0.43  % Result found by new_bool_1
% 0.09/0.43  % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.09/0.43  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.09/0.43  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.09/0.43  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.09/0.43  % No SInE strategy applied
% 0.09/0.43  % Search class: FGUNM-FFMF31-MFFFFFNN
% 0.09/0.43  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.09/0.43  % Starting SubtermCWHack with 136s (1) cores
% 0.09/0.43  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.09/0.43  % Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S0Y with 136s (1) cores
% 0.09/0.43  % Starting new_bool_3 with 136s (1) cores
% 0.09/0.43  % Starting new_bool_1 with 136s (1) cores
% 0.09/0.43  % Preprocessing time       : 0.001 s
% 0.09/0.43  % Presaturation interreduction done
% 0.09/0.43  
% 0.09/0.43  % Proof found!
% 0.09/0.43  % SZS status Unsatisfiable
% 0.09/0.43  % SZS output start CNFRefutation
% See solution above
% 0.09/0.43  % Parsed axioms                        : 34
% 0.09/0.43  % Removed by relevancy pruning/SinE    : 0
% 0.09/0.43  % Initial clauses                      : 34
% 0.09/0.43  % Removed in clause preprocessing      : 0
% 0.09/0.43  % Initial clauses in saturation        : 34
% 0.09/0.43  % Processed clauses                    : 92
% 0.09/0.43  % ...of these trivial                  : 0
% 0.09/0.43  % ...subsumed                          : 1
% 0.09/0.43  % ...remaining for further processing  : 91
% 0.09/0.43  % Other redundant clauses eliminated   : 0
% 0.09/0.43  % Clauses deleted for lack of memory   : 0
% 0.09/0.43  % Backward-subsumed                    : 0
% 0.09/0.43  % Backward-rewritten                   : 0
% 0.09/0.43  % Generated clauses                    : 47
% 0.09/0.43  % ...of the previous two non-redundant : 26
% 0.09/0.43  % ...aggressively subsumed             : 0
% 0.09/0.43  % Contextual simplify-reflections      : 0
% 0.09/0.43  % Paramodulations                      : 47
% 0.09/0.43  % Factorizations                       : 0
% 0.09/0.43  % NegExts                              : 0
% 0.09/0.43  % Equation resolutions                 : 0
% 0.09/0.43  % Disequality decompositions           : 0
% 0.09/0.43  % Total rewrite steps                  : 20
% 0.09/0.43  % ...of those cached                   : 0
% 0.09/0.43  % Propositional unsat checks           : 0
% 0.09/0.43  %    Propositional check models        : 0
% 0.09/0.43  %    Propositional check unsatisfiable : 0
% 0.09/0.43  %    Propositional clauses             : 0
% 0.09/0.43  %    Propositional clauses after purity: 0
% 0.09/0.43  %    Propositional unsat core size     : 0
% 0.09/0.43  %    Propositional preprocessing time  : 0.000
% 0.09/0.43  %    Propositional encoding time       : 0.000
% 0.09/0.43  %    Propositional solver time         : 0.000
% 0.09/0.43  %    Success case prop preproc time    : 0.000
% 0.09/0.43  %    Success case prop encoding time   : 0.000
% 0.09/0.43  %    Success case prop solver time     : 0.000
% 0.09/0.43  % Current number of processed clauses  : 57
% 0.09/0.43  %    Positive orientable unit clauses  : 7
% 0.09/0.43  %    Positive unorientable unit clauses: 0
% 0.09/0.43  %    Negative unit clauses             : 2
% 0.09/0.43  %    Non-unit-clauses                  : 48
% 0.09/0.43  % Current number of unprocessed clauses: 2
% 0.09/0.43  % ...number of literals in the above   : 6
% 0.09/0.43  % Current number of archived formulas  : 0
% 0.09/0.43  % Current number of archived clauses   : 34
% 0.09/0.43  % Clause-clause subsumption calls (NU) : 853
% 0.09/0.43  % Rec. Clause-clause subsumption calls : 649
% 0.09/0.43  % Non-unit clause-clause subsumptions  : 1
% 0.09/0.43  % Unit Clause-clause subsumption calls : 0
% 0.09/0.43  % Rewrite failures with RHS unbound    : 0
% 0.09/0.43  % BW rewrite match attempts            : 4
% 0.09/0.43  % BW rewrite match successes           : 0
% 0.09/0.43  % Condensation attempts                : 0
% 0.09/0.43  % Condensation successes               : 0
% 0.09/0.43  % Termbank termtop insertions          : 2518
% 0.09/0.43  % Search garbage collected termcells   : 118
% 0.09/0.43  
% 0.09/0.43  % -------------------------------------------------
% 0.09/0.43  % User time                : 0.005 s
% 0.09/0.43  % System time              : 0.002 s
% 0.09/0.43  % Total time               : 0.007 s
% 0.09/0.43  % Maximum resident set size: 3676 pages
% 0.09/0.43  
% 0.09/0.43  % -------------------------------------------------
% 0.09/0.43  % User time                : 0.023 s
% 0.09/0.43  % System time              : 0.015 s
% 0.09/0.43  % Total time               : 0.038 s
% 0.09/0.43  % Maximum resident set size: 4608 pages
% 0.09/0.43  % E exiting
%------------------------------------------------------------------------------