↑ Up

E---3.5.1.UNS-CRf.s

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

% Computer : n012.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 12:37:25 PM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
cnf(condition,axiom,
    ( ~ product(X1,inverse(X2),X3)
    | ~ an_element(X2)
    | ~ an_element(X1)
    | an_element(X3) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',condition) ).

cnf(prove_identity_is_an_element,negated_conjecture,
    ~ an_element(identity),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_identity_is_an_element) ).

cnf(right_inverse,axiom,
    product(X1,inverse(X1),identity),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',right_inverse) ).

cnf(element_of_set,axiom,
    an_element(a),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',element_of_set) ).

cnf(c_0_4,plain,
    ( ~ product(X1,inverse(X2),X3)
    | ~ an_element(X2)
    | ~ an_element(X1)
    | an_element(X3) ),
    inference(fof_simplification,[status(thm)],[condition]) ).

cnf(c_0_5,negated_conjecture,
    ~ an_element(identity),
    inference(fof_simplification,[status(thm)],[prove_identity_is_an_element]) ).

cnf(c_0_6,plain,
    ( ~ product(X1,inverse(X2),X3)
    | ~ an_element(X2)
    | ~ an_element(X1)
    | an_element(X3) ),
    c_0_4 ).

cnf(c_0_7,axiom,
    product(X1,inverse(X1),identity),
    right_inverse ).

cnf(c_0_8,negated_conjecture,
    ~ an_element(identity),
    c_0_5 ).

cnf(c_0_9,axiom,
    an_element(a),
    element_of_set ).

cnf(c_0_10,plain,
    ~ an_element(X1),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_7]),c_0_8]) ).

cnf(c_0_11,plain,
    $false,
    inference(sr,[status(thm)],[c_0_9,c_0_10]),
    [proof] ).

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