↑ Up

E---3.5.1.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : E---3.5.1
% Problem  : SYN311-1 : TPTP v9.3.1. Released v1.2.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:23:37 PM UTC 2026

% Result   : Unsatisfiable 0.14s 5.43s
% Output   : CNFRefutation 0.14s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :    6
% Syntax   : Number of clauses     :   33 (  15 unt;   0 nHn;  33 RR)
%            Number of literals    :   51 (   0 equ;  28 neg)
%            Maximal clause size   :    2 (   1 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    2 (   1 usr;   1 prp; 0-4 aty)
%            Number of functors    :    6 (   6 usr;   4 con; 0-1 aty)
%            Number of variables   :   72 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(clause6,negated_conjecture,
    ~ p(f(g(d)),f(g(c)),f(g(b)),f(g(a))),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause6) ).

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

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

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

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

cnf(clause5,negated_conjecture,
    p(a,b,c,d),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause5) ).

cnf(c_0_6,negated_conjecture,
    ~ p(f(g(d)),f(g(c)),f(g(b)),f(g(a))),
    inference(fof_simplification,[status(thm)],[clause6]) ).

cnf(c_0_7,negated_conjecture,
    ( ~ p(X1,X2,X3,X4)
    | p(f(X1),X2,X3,X4) ),
    inference(fof_simplification,[status(thm)],[clause4]) ).

cnf(c_0_8,negated_conjecture,
    ( ~ p(X4,X3,X2,X1)
    | p(X1,X2,X3,X4) ),
    inference(fof_simplification,[status(thm)],[clause2]) ).

cnf(c_0_9,negated_conjecture,
    ~ p(f(g(d)),f(g(c)),f(g(b)),f(g(a))),
    c_0_6 ).

cnf(c_0_10,negated_conjecture,
    ( ~ p(X1,X2,X3,X4)
    | p(f(X1),X2,X3,X4) ),
    c_0_7 ).

cnf(c_0_11,negated_conjecture,
    ( ~ p(X4,X3,X2,X1)
    | p(X1,X2,X3,X4) ),
    c_0_8 ).

cnf(c_0_12,negated_conjecture,
    ( ~ p(X2,X3,X4,X1)
    | p(X1,X2,X3,X4) ),
    inference(fof_simplification,[status(thm)],[clause1]) ).

cnf(c_0_13,negated_conjecture,
    ~ p(g(d),f(g(c)),f(g(b)),f(g(a))),
    inference(spm,[status(thm)],[c_0_9,c_0_10]) ).

cnf(c_0_14,negated_conjecture,
    ( ~ p(X4,X3,X2,X1)
    | p(X1,X2,X3,f(X4)) ),
    inference(spm,[status(thm)],[c_0_11,c_0_10]) ).

cnf(c_0_15,negated_conjecture,
    ( ~ p(X1,X2,X3,X4)
    | p(X1,X2,X3,g(X4)) ),
    inference(fof_simplification,[status(thm)],[clause3]) ).

cnf(c_0_16,negated_conjecture,
    ( ~ p(X2,X3,X4,X1)
    | p(X1,X2,X3,X4) ),
    c_0_12 ).

cnf(c_0_17,negated_conjecture,
    ~ p(g(a),f(g(b)),f(g(c)),g(d)),
    inference(spm,[status(thm)],[c_0_13,c_0_14]) ).

cnf(c_0_18,negated_conjecture,
    ( ~ p(X1,X2,X3,X4)
    | p(X1,X2,X3,g(X4)) ),
    c_0_15 ).

cnf(c_0_19,negated_conjecture,
    ( ~ p(X2,X3,X4,X1)
    | p(X1,f(X2),X3,X4) ),
    inference(spm,[status(thm)],[c_0_16,c_0_10]) ).

cnf(c_0_20,negated_conjecture,
    ~ p(g(a),f(g(b)),f(g(c)),d),
    inference(spm,[status(thm)],[c_0_17,c_0_18]) ).

cnf(c_0_21,negated_conjecture,
    ( ~ p(X3,X4,X1,X2)
    | p(X1,X2,f(X3),X4) ),
    inference(spm,[status(thm)],[c_0_16,c_0_19]) ).

cnf(c_0_22,negated_conjecture,
    ~ p(g(c),d,g(a),f(g(b))),
    inference(spm,[status(thm)],[c_0_20,c_0_21]) ).

cnf(c_0_23,negated_conjecture,
    ~ p(g(b),g(a),d,g(c)),
    inference(spm,[status(thm)],[c_0_22,c_0_14]) ).

cnf(c_0_24,negated_conjecture,
    ( ~ p(X2,X3,X4,X1)
    | p(g(X1),X2,X3,X4) ),
    inference(spm,[status(thm)],[c_0_16,c_0_18]) ).

cnf(c_0_25,negated_conjecture,
    p(a,b,c,d),
    clause5 ).

cnf(c_0_26,negated_conjecture,
    ~ p(g(b),g(a),d,c),
    inference(spm,[status(thm)],[c_0_23,c_0_18]) ).

cnf(c_0_27,negated_conjecture,
    ( ~ p(X3,X4,X1,X2)
    | p(X1,g(X2),X3,X4) ),
    inference(spm,[status(thm)],[c_0_16,c_0_24]) ).

cnf(c_0_28,negated_conjecture,
    p(d,c,b,a),
    inference(spm,[status(thm)],[c_0_11,c_0_25]) ).

cnf(c_0_29,negated_conjecture,
    ~ p(d,c,g(b),a),
    inference(spm,[status(thm)],[c_0_26,c_0_27]) ).

cnf(c_0_30,negated_conjecture,
    ( ~ p(X4,X1,X2,X3)
    | p(X1,X2,g(X3),X4) ),
    inference(spm,[status(thm)],[c_0_16,c_0_27]) ).

cnf(c_0_31,negated_conjecture,
    p(a,d,c,b),
    inference(spm,[status(thm)],[c_0_16,c_0_28]) ).

cnf(c_0_32,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_31])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SYN311-1 : TPTP v9.3.1. Released v1.2.0.
% 0.00/0.04  % Command  : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/5.36  % Computer : n013.cluster.edu
% 0.11/5.36  % Model    : x86_64 x86_64
% 0.11/5.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/5.36  % Memory   : 8046.5625MB
% 0.11/5.36  % OS       : Linux 6.8.0-71-generic
% 0.11/5.37  % CPULimit : 300
% 0.11/5.37  % WCLimit  : 300
% 0.11/5.37  % DateTime : Mon Sep 21 10:48:26 UTC 2026
% 0.11/5.37  % CPUTime  : 
% 0.11/5.37  Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.14/5.41  Running first-order theorem proving
% 0.14/5.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.14/5.43  % Version: 3.5.1
% 0.14/5.43  % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.14/5.43  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/5.43  % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.14/5.43  % Starting new_bool_3 with 300s (1) cores
% 0.14/5.43  % Starting new_bool_1 with 300s (1) cores
% 0.14/5.43  % Starting sh5l with 300s (1) cores
% 0.14/5.43  % G-E--_302_C18_F1_URBAN_RG_S04BN with pid 589666 completed with status 0
% 0.14/5.43  % Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 0.14/5.43  % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.14/5.43  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/5.43  % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.14/5.43  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.14/5.43  % No SInE strategy applied
% 0.14/5.43  % Search class: FHUNF-FFSF11-SFFFFFNN
% 0.14/5.43  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.14/5.43  % Starting SubtermCWHack with 136s (1) cores
% 0.14/5.43  % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.14/5.43  % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.14/5.43  % Starting new_bool_3 with 136s (1) cores
% 0.14/5.43  % Starting new_bool_1 with 136s (1) cores
% 0.14/5.43  % SubtermCWHack with pid 589670 completed with status 0
% 0.14/5.43  % Result found by SubtermCWHack
% 0.14/5.43  % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.14/5.43  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/5.43  % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.14/5.43  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.14/5.43  % No SInE strategy applied
% 0.14/5.43  % Search class: FHUNF-FFSF11-SFFFFFNN
% 0.14/5.43  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.14/5.43  % Starting SubtermCWHack with 136s (1) cores
% 0.14/5.43  % Preprocessing time       : 0.001 s
% 0.14/5.43  
% 0.14/5.43  % Proof found!
% 0.14/5.43  % SZS status Unsatisfiable
% 0.14/5.43  % SZS output start CNFRefutation
% See solution above
% 0.14/5.43  % Parsed axioms                        : 6
% 0.14/5.43  % Removed by relevancy pruning/SinE    : 0
% 0.14/5.43  % Initial clauses                      : 6
% 0.14/5.43  % Removed in clause preprocessing      : 0
% 0.14/5.43  % Initial clauses in saturation        : 6
% 0.14/5.43  % Processed clauses                    : 39
% 0.14/5.43  % ...of these trivial                  : 2
% 0.14/5.43  % ...subsumed                          : 4
% 0.14/5.43  % ...remaining for further processing  : 33
% 0.14/5.43  % Other redundant clauses eliminated   : 0
% 0.14/5.43  % Clauses deleted for lack of memory   : 0
% 0.14/5.43  % Backward-subsumed                    : 0
% 0.14/5.43  % Backward-rewritten                   : 0
% 0.14/5.43  % Generated clauses                    : 91
% 0.14/5.43  % ...of the previous two non-redundant : 82
% 0.14/5.43  % ...aggressively subsumed             : 0
% 0.14/5.43  % Contextual simplify-reflections      : 0
% 0.14/5.43  % Paramodulations                      : 91
% 0.14/5.43  % Factorizations                       : 0
% 0.14/5.43  % NegExts                              : 0
% 0.14/5.43  % Equation resolutions                 : 0
% 0.14/5.43  % Disequality decompositions           : 0
% 0.14/5.43  % Total rewrite steps                  : 10
% 0.14/5.43  % ...of those cached                   : 2
% 0.14/5.43  % Propositional unsat checks           : 0
% 0.14/5.43  %    Propositional check models        : 0
% 0.14/5.43  %    Propositional check unsatisfiable : 0
% 0.14/5.43  %    Propositional clauses             : 0
% 0.14/5.43  %    Propositional clauses after purity: 0
% 0.14/5.43  %    Propositional unsat core size     : 0
% 0.14/5.43  %    Propositional preprocessing time  : 0.000
% 0.14/5.43  %    Propositional encoding time       : 0.000
% 0.14/5.43  %    Propositional solver time         : 0.000
% 0.14/5.43  %    Success case prop preproc time    : 0.000
% 0.14/5.43  %    Success case prop encoding time   : 0.000
% 0.14/5.43  %    Success case prop solver time     : 0.000
% 0.14/5.43  % Current number of processed clauses  : 33
% 0.14/5.43  %    Positive orientable unit clauses  : 8
% 0.14/5.43  %    Positive unorientable unit clauses: 0
% 0.14/5.43  %    Negative unit clauses             : 9
% 0.14/5.43  %    Non-unit-clauses                  : 16
% 0.14/5.43  % Current number of unprocessed clauses: 49
% 0.14/5.43  % ...number of literals in the above   : 61
% 0.14/5.43  % Current number of archived formulas  : 0
% 0.14/5.43  % Current number of archived clauses   : 0
% 0.14/5.43  % Clause-clause subsumption calls (NU) : 149
% 0.14/5.43  % Rec. Clause-clause subsumption calls : 149
% 0.14/5.43  % Non-unit clause-clause subsumptions  : 4
% 0.14/5.43  % Unit Clause-clause subsumption calls : 36
% 0.14/5.43  % Rewrite failures with RHS unbound    : 0
% 0.14/5.43  % BW rewrite match attempts            : 0
% 0.14/5.43  % BW rewrite match successes           : 0
% 0.14/5.43  % Condensation attempts                : 0
% 0.14/5.43  % Condensation successes               : 0
% 0.14/5.43  % Termbank termtop insertions          : 684
% 0.14/5.43  % Search garbage collected termcells   : 11
% 0.14/5.43  
% 0.14/5.43  % -------------------------------------------------
% 0.14/5.43  % User time                : 0.003 s
% 0.14/5.43  % System time              : 0.002 s
% 0.14/5.43  % Total time               : 0.005 s
% 0.14/5.43  % Maximum resident set size: 3632 pages
% 0.14/5.43  
% 0.14/5.43  % -------------------------------------------------
% 0.14/5.43  % User time                : 0.014 s
% 0.14/5.43  % System time              : 0.008 s
% 0.14/5.43  % Total time               : 0.022 s
% 0.14/5.43  % Maximum resident set size: 4864 pages
% 0.14/5.43  % E exiting
%------------------------------------------------------------------------------