↑ Up

E---3.5.1.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : E---3.5.1
% Problem  : SYN347-1 : TPTP v9.3.1. Bugfixed v1.2.1.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E /export/starexec/sandbox/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:46 PM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
cnf(clause2,negated_conjecture,
    ( ~ f(X1,y(X1,X2))
    | f(a,b)
    | f(X2,y(X1,X2)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause2) ).

cnf(clause5,negated_conjecture,
    ( f(b,y(X1,X2))
    | f(a,y(X1,X2)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause5) ).

cnf(clause1,negated_conjecture,
    ( ~ f(X2,y(X1,X2))
    | f(a,b)
    | f(X1,y(X1,X2)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause1) ).

cnf(clause6,negated_conjecture,
    ( ~ f(b,y(X1,X2))
    | ~ f(a,y(X1,X2)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause6) ).

cnf(clause3,negated_conjecture,
    ( ~ f(a,b)
    | ~ f(X2,y(X1,X2))
    | ~ f(X1,y(X1,X2)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause3) ).

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

cnf(c_0_6,negated_conjecture,
    ( ~ f(X1,y(X1,X2))
    | f(a,b)
    | f(X2,y(X1,X2)) ),
    inference(fof_simplification,[status(thm)],[clause2]) ).

cnf(c_0_7,negated_conjecture,
    ( ~ f(X1,y(X1,X2))
    | f(a,b)
    | f(X2,y(X1,X2)) ),
    c_0_6 ).

cnf(c_0_8,negated_conjecture,
    ( f(b,y(X1,X2))
    | f(a,y(X1,X2)) ),
    clause5 ).

cnf(c_0_9,negated_conjecture,
    ( ~ f(X2,y(X1,X2))
    | f(a,b)
    | f(X1,y(X1,X2)) ),
    inference(fof_simplification,[status(thm)],[clause1]) ).

cnf(c_0_10,negated_conjecture,
    ( f(a,b)
    | f(X1,y(a,X1))
    | f(b,y(a,X1)) ),
    inference(spm,[status(thm)],[c_0_7,c_0_8]) ).

cnf(c_0_11,negated_conjecture,
    ( ~ f(b,y(X1,X2))
    | ~ f(a,y(X1,X2)) ),
    inference(fof_simplification,[status(thm)],[clause6]) ).

cnf(c_0_12,negated_conjecture,
    ( ~ f(X2,y(X1,X2))
    | f(a,b)
    | f(X1,y(X1,X2)) ),
    c_0_9 ).

cnf(c_0_13,negated_conjecture,
    ( f(a,b)
    | f(b,y(a,b)) ),
    inference(ef,[status(thm)],[c_0_10]) ).

cnf(c_0_14,negated_conjecture,
    ( ~ f(a,b)
    | ~ f(X2,y(X1,X2))
    | ~ f(X1,y(X1,X2)) ),
    inference(fof_simplification,[status(thm)],[clause3]) ).

cnf(c_0_15,negated_conjecture,
    ( ~ f(b,y(X1,X2))
    | ~ f(a,y(X1,X2)) ),
    c_0_11 ).

cnf(c_0_16,negated_conjecture,
    ( f(a,b)
    | f(a,y(a,b)) ),
    inference(spm,[status(thm)],[c_0_12,c_0_13]) ).

cnf(c_0_17,negated_conjecture,
    ( ~ f(a,b)
    | f(X2,y(X1,X2))
    | f(X1,y(X1,X2)) ),
    inference(fof_simplification,[status(thm)],[clause4]) ).

cnf(c_0_18,negated_conjecture,
    ( ~ f(a,b)
    | ~ f(X2,y(X1,X2))
    | ~ f(X1,y(X1,X2)) ),
    c_0_14 ).

cnf(c_0_19,negated_conjecture,
    f(a,b),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_13]) ).

cnf(c_0_20,negated_conjecture,
    ( ~ f(a,b)
    | f(X2,y(X1,X2))
    | f(X1,y(X1,X2)) ),
    c_0_17 ).

cnf(c_0_21,negated_conjecture,
    ( ~ f(X2,y(X2,X1))
    | ~ f(X1,y(X2,X1)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_18,c_0_19])]) ).

cnf(c_0_22,negated_conjecture,
    ( f(X2,y(X1,X2))
    | f(X1,y(X1,X2)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_20,c_0_19])]) ).

cnf(c_0_23,negated_conjecture,
    ( ~ f(X1,y(X1,a))
    | f(b,y(X1,a)) ),
    inference(spm,[status(thm)],[c_0_21,c_0_8]) ).

cnf(c_0_24,negated_conjecture,
    ( ~ f(b,y(X1,a))
    | f(X1,y(X1,a)) ),
    inference(spm,[status(thm)],[c_0_15,c_0_22]) ).

cnf(c_0_25,negated_conjecture,
    f(b,y(a,a)),
    inference(spm,[status(thm)],[c_0_23,c_0_8]) ).

cnf(c_0_26,negated_conjecture,
    f(a,y(a,a)),
    inference(spm,[status(thm)],[c_0_24,c_0_25]) ).

cnf(c_0_27,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_26]),c_0_26])]),
    [proof] ).

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