↑ Up

E---3.5.1.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : E---3.5.1
% Problem  : SYN079-1 : TPTP v9.3.1. Released v1.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM

% Computer : n011.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:04 PM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
cnf(clause_3,axiom,
    ( ~ big_f(X2,X3)
    | ~ big_f(X1,X2)
    | big_f(X1,X3) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_3) ).

cnf(prove_this,negated_conjecture,
    ~ big_f(f(a,b),f(a,c)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).

cnf(clause_2,axiom,
    big_f(f(b,c),f(a,c)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_2) ).

cnf(clause_1,axiom,
    big_f(f(a,b),f(b,c)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_1) ).

cnf(c_0_4,plain,
    ( ~ big_f(X2,X3)
    | ~ big_f(X1,X2)
    | big_f(X1,X3) ),
    inference(fof_simplification,[status(thm)],[clause_3]) ).

cnf(c_0_5,negated_conjecture,
    ~ big_f(f(a,b),f(a,c)),
    inference(fof_simplification,[status(thm)],[prove_this]) ).

cnf(c_0_6,plain,
    ( ~ big_f(X2,X3)
    | ~ big_f(X1,X2)
    | big_f(X1,X3) ),
    c_0_4 ).

cnf(c_0_7,axiom,
    big_f(f(b,c),f(a,c)),
    clause_2 ).

cnf(c_0_8,negated_conjecture,
    ~ big_f(f(a,b),f(a,c)),
    c_0_5 ).

cnf(c_0_9,plain,
    ( ~ big_f(X1,f(b,c))
    | big_f(X1,f(a,c)) ),
    inference(spm,[status(thm)],[c_0_6,c_0_7]) ).

cnf(c_0_10,axiom,
    big_f(f(a,b),f(b,c)),
    clause_1 ).

cnf(c_0_11,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_9]),c_0_10])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05  % Problem  : SYN079-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.07  % Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.16/0.44  % Computer : n011.cluster.edu
% 0.16/0.44  % Model    : x86_64 x86_64
% 0.16/0.44  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.44  % Memory   : 8046.5625MB
% 0.16/0.44  % OS       : Linux 6.8.0-71-generic
% 0.16/0.44  % CPULimit : 300
% 0.16/0.44  % WCLimit  : 300
% 0.16/0.44  % DateTime : Mon Sep 21 10:42:41 UTC 2026
% 0.16/0.44  % CPUTime  : 
% 0.16/0.44  Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.26/0.51  Running first-order theorem proving
% 0.26/0.51  Running: /export/starexec/sandbox2/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/sandbox2/benchmark/theBenchmark.p
% 0.26/0.54  % Version: 3.5.1
% 0.26/0.54  % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.26/0.54  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.26/0.54  % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.26/0.54  % Starting new_bool_3 with 300s (1) cores
% 0.26/0.54  % Starting new_bool_1 with 300s (1) cores
% 0.26/0.54  % Starting sh5l with 300s (1) cores
% 0.26/0.54  % sh5l with pid 1692132 completed with status 0
% 0.26/0.54  % Result found by sh5l
% 0.26/0.54  % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.26/0.54  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.26/0.54  % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.26/0.54  % Starting new_bool_3 with 300s (1) cores
% 0.26/0.54  % Starting new_bool_1 with 300s (1) cores
% 0.26/0.54  % Starting sh5l with 300s (1) cores
% 0.26/0.54  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.26/0.54  % SinE strategy is gf500_gu_R04_F100_L20000
% 0.26/0.54  % Search class: FHUNF-FFSF22-SFFFFFNN
% 0.26/0.54  % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.26/0.54  % Starting SubtermCWHack with 31s (1) cores
% 0.26/0.54  % SubtermCWHack with pid 1692134 completed with status 0
% 0.26/0.54  % Result found by SubtermCWHack
% 0.26/0.54  % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.26/0.54  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.26/0.54  % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.26/0.54  % Starting new_bool_3 with 300s (1) cores
% 0.26/0.54  % Starting new_bool_1 with 300s (1) cores
% 0.26/0.54  % Starting sh5l with 300s (1) cores
% 0.26/0.54  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.26/0.54  % SinE strategy is gf500_gu_R04_F100_L20000
% 0.26/0.54  % Search class: FHUNF-FFSF22-SFFFFFNN
% 0.26/0.54  % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.26/0.54  % Starting SubtermCWHack with 31s (1) cores
% 0.26/0.54  % Preprocessing time       : 0.002 s
% 0.26/0.54  
% 0.26/0.54  % Proof found!
% 0.26/0.54  % SZS status Unsatisfiable
% 0.26/0.54  % SZS output start CNFRefutation
% See solution above
% 0.26/0.54  % Parsed axioms                        : 4
% 0.26/0.54  % Removed by relevancy pruning/SinE    : 0
% 0.26/0.54  % Initial clauses                      : 4
% 0.26/0.54  % Removed in clause preprocessing      : 0
% 0.26/0.54  % Initial clauses in saturation        : 4
% 0.26/0.54  % Processed clauses                    : 5
% 0.26/0.54  % ...of these trivial                  : 0
% 0.26/0.54  % ...subsumed                          : 0
% 0.26/0.54  % ...remaining for further processing  : 5
% 0.26/0.54  % Other redundant clauses eliminated   : 0
% 0.26/0.54  % Clauses deleted for lack of memory   : 0
% 0.26/0.54  % Backward-subsumed                    : 0
% 0.26/0.54  % Backward-rewritten                   : 0
% 0.26/0.54  % Generated clauses                    : 4
% 0.26/0.54  % ...of the previous two non-redundant : 2
% 0.26/0.54  % ...aggressively subsumed             : 0
% 0.26/0.54  % Contextual simplify-reflections      : 0
% 0.26/0.54  % Paramodulations                      : 4
% 0.26/0.54  % Factorizations                       : 0
% 0.26/0.54  % NegExts                              : 0
% 0.26/0.54  % Equation resolutions                 : 0
% 0.26/0.54  % Disequality decompositions           : 0
% 0.26/0.54  % Total rewrite steps                  : 1
% 0.26/0.54  % ...of those cached                   : 0
% 0.26/0.54  % Propositional unsat checks           : 0
% 0.26/0.54  %    Propositional check models        : 0
% 0.26/0.54  %    Propositional check unsatisfiable : 0
% 0.26/0.54  %    Propositional clauses             : 0
% 0.26/0.54  %    Propositional clauses after purity: 0
% 0.26/0.54  %    Propositional unsat core size     : 0
% 0.26/0.54  %    Propositional preprocessing time  : 0.000
% 0.26/0.54  %    Propositional encoding time       : 0.000
% 0.26/0.54  %    Propositional solver time         : 0.000
% 0.26/0.54  %    Success case prop preproc time    : 0.000
% 0.26/0.54  %    Success case prop encoding time   : 0.000
% 0.26/0.54  %    Success case prop solver time     : 0.000
% 0.26/0.54  % Current number of processed clauses  : 5
% 0.26/0.54  %    Positive orientable unit clauses  : 2
% 0.26/0.54  %    Positive unorientable unit clauses: 0
% 0.26/0.54  %    Negative unit clauses             : 1
% 0.26/0.54  %    Non-unit-clauses                  : 2
% 0.26/0.54  % Current number of unprocessed clauses: 1
% 0.26/0.54  % ...number of literals in the above   : 2
% 0.26/0.54  % Current number of archived formulas  : 0
% 0.26/0.54  % Current number of archived clauses   : 0
% 0.26/0.54  % Clause-clause subsumption calls (NU) : 0
% 0.26/0.54  % Rec. Clause-clause subsumption calls : 0
% 0.26/0.54  % Non-unit clause-clause subsumptions  : 0
% 0.26/0.54  % Unit Clause-clause subsumption calls : 0
% 0.26/0.54  % Rewrite failures with RHS unbound    : 0
% 0.26/0.54  % BW rewrite match attempts            : 0
% 0.26/0.54  % BW rewrite match successes           : 0
% 0.26/0.54  % Condensation attempts                : 0
% 0.26/0.54  % Condensation successes               : 0
% 0.26/0.54  % Termbank termtop insertions          : 145
% 0.26/0.54  % Search garbage collected termcells   : 8
% 0.26/0.54  
% 0.26/0.54  % -------------------------------------------------
% 0.26/0.54  % User time                : 0.001 s
% 0.26/0.54  % System time              : 0.003 s
% 0.26/0.54  % Total time               : 0.005 s
% 0.26/0.54  % Maximum resident set size: 3628 pages
% 0.26/0.54  
% 0.26/0.54  % -------------------------------------------------
% 0.26/0.54  % User time                : 0.004 s
% 0.26/0.54  % System time              : 0.008 s
% 0.26/0.54  % Total time               : 0.012 s
% 0.26/0.54  % Maximum resident set size: 4608 pages
% 0.26/0.54  % E exiting
%------------------------------------------------------------------------------