↑ Up

E-SAT---3.5.1.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : E-SAT---3.5.1
% Problem  : GRP031-2 : 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 : n014.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:41:25 PM UTC 2026

% Result   : Unsatisfiable 0.24s 0.56s
% Output   : CNFRefutation 0.24s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    5
% Syntax   : Number of clauses     :   20 (  10 unt;   0 nHn;  14 RR)
%            Number of literals    :   44 (   0 equ;  27 neg)
%            Maximal clause size   :    4 (   2 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    2 (   1 usr;   1 prp; 0-3 aty)
%            Number of functors    :    3 (   3 usr;   2 con; 0-1 aty)
%            Number of variables   :   57 (   3 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(associativity2,axiom,
    ( ~ product(X1,X5,X6)
    | ~ product(X2,X4,X5)
    | ~ product(X1,X2,X3)
    | product(X3,X4,X6) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',associativity2) ).

cnf(associativity1,axiom,
    ( ~ product(X3,X4,X6)
    | ~ product(X2,X4,X5)
    | ~ product(X1,X2,X3)
    | product(X1,X5,X6) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',associativity1) ).

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

cnf(right_identity,hypothesis,
    product(X1,identity,X1),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',right_identity) ).

cnf(prove_a_has_a_left_inverse,negated_conjecture,
    ~ product(X1,a,identity),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_a_has_a_left_inverse) ).

cnf(c_0_5,plain,
    ( ~ product(X1,X5,X6)
    | ~ product(X2,X4,X5)
    | ~ product(X1,X2,X3)
    | product(X3,X4,X6) ),
    inference(fof_simplification,[status(thm)],[associativity2]) ).

cnf(c_0_6,plain,
    ( ~ product(X3,X4,X6)
    | ~ product(X2,X4,X5)
    | ~ product(X1,X2,X3)
    | product(X1,X5,X6) ),
    inference(fof_simplification,[status(thm)],[associativity1]) ).

cnf(c_0_7,plain,
    ( ~ product(X1,X5,X6)
    | ~ product(X2,X4,X5)
    | ~ product(X1,X2,X3)
    | product(X3,X4,X6) ),
    c_0_5 ).

cnf(c_0_8,hypothesis,
    product(X1,inverse(X1),identity),
    right_inverse ).

cnf(c_0_9,plain,
    ( ~ product(X3,X4,X6)
    | ~ product(X2,X4,X5)
    | ~ product(X1,X2,X3)
    | product(X1,X5,X6) ),
    c_0_6 ).

cnf(c_0_10,hypothesis,
    ( ~ product(X4,X2,X1)
    | ~ product(X4,identity,X3)
    | product(X1,inverse(X2),X3) ),
    inference(spm,[status(thm)],[c_0_7,c_0_8]) ).

cnf(c_0_11,hypothesis,
    ( ~ product(X1,X3,X4)
    | ~ product(X3,inverse(X4),X2)
    | product(X1,X2,identity) ),
    inference(spm,[status(thm)],[c_0_9,c_0_8]) ).

cnf(c_0_12,hypothesis,
    product(X1,identity,X1),
    right_identity ).

cnf(c_0_13,hypothesis,
    ( ~ product(X1,identity,X2)
    | product(identity,inverse(inverse(X1)),X2) ),
    inference(spm,[status(thm)],[c_0_10,c_0_8]) ).

cnf(c_0_14,negated_conjecture,
    ~ product(X1,a,identity),
    inference(fof_simplification,[status(thm)],[prove_a_has_a_left_inverse]) ).

cnf(c_0_15,hypothesis,
    ( ~ product(identity,inverse(X1),X2)
    | product(X1,X2,identity) ),
    inference(spm,[status(thm)],[c_0_11,c_0_12]) ).

cnf(c_0_16,hypothesis,
    product(identity,inverse(inverse(X1)),X1),
    inference(spm,[status(thm)],[c_0_13,c_0_12]) ).

cnf(c_0_17,negated_conjecture,
    ~ product(X1,a,identity),
    c_0_14 ).

cnf(c_0_18,hypothesis,
    product(inverse(X1),X1,identity),
    inference(spm,[status(thm)],[c_0_15,c_0_16]) ).

cnf(c_0_19,negated_conjecture,
    $false,
    inference(spm,[status(thm)],[c_0_17,c_0_18]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05  % Problem  : GRP031-2 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.07  % Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.19/0.46  % Computer : n014.cluster.edu
% 0.19/0.46  % Model    : x86_64 x86_64
% 0.19/0.46  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.19/0.46  % Memory   : 8046.5625MB
% 0.19/0.46  % OS       : Linux 6.8.0-71-generic
% 0.19/0.46  % CPULimit : 300
% 0.19/0.46  % WCLimit  : 300
% 0.19/0.46  % DateTime : Sun Sep 20 19:54:34 UTC 2026
% 0.19/0.46  % CPUTime  : 
% 0.19/0.47  Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.24/0.52  Running first-order theorem proving
% 0.24/0.52  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.24/0.56  % Version: 3.5.1
% 0.24/0.56  % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.24/0.56  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/0.56  % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.24/0.56  % Starting new_bool_3 with 300s (1) cores
% 0.24/0.56  % Starting new_bool_1 with 300s (1) cores
% 0.24/0.56  % Starting sh5l with 300s (1) cores
% 0.24/0.56  % G-E--_302_C18_F1_URBAN_RG_S04BN with pid 2210065 completed with status 0
% 0.24/0.56  % Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 0.24/0.56  % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.24/0.56  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/0.56  % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.24/0.56  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.24/0.56  % No SInE strategy applied
% 0.24/0.56  % Search class: FHUNS-FFSF21-SFFFFFNN
% 0.24/0.56  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.24/0.56  % Starting SubtermCWHack with 136s (1) cores
% 0.24/0.56  % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.24/0.56  % Starting G-E--_107_C18_F1_AE_Q4_CS_SP_S0Y with 136s (1) cores
% 0.24/0.56  % Starting new_bool_3 with 136s (1) cores
% 0.24/0.56  % Starting new_bool_1 with 136s (1) cores
% 0.24/0.56  % new_bool_1 with pid 2210076 completed with status 0
% 0.24/0.56  % Result found by new_bool_1
% 0.24/0.56  % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.24/0.56  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/0.56  % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.24/0.56  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.24/0.56  % No SInE strategy applied
% 0.24/0.56  % Search class: FHUNS-FFSF21-SFFFFFNN
% 0.24/0.56  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.24/0.56  % Starting SubtermCWHack with 136s (1) cores
% 0.24/0.56  % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.24/0.56  % Starting G-E--_107_C18_F1_AE_Q4_CS_SP_S0Y with 136s (1) cores
% 0.24/0.56  % Starting new_bool_3 with 136s (1) cores
% 0.24/0.56  % Starting new_bool_1 with 136s (1) cores
% 0.24/0.56  % Preprocessing time       : 0.001 s
% 0.24/0.56  % Presaturation interreduction done
% 0.24/0.56  
% 0.24/0.56  % Proof found!
% 0.24/0.56  % SZS status Unsatisfiable
% 0.24/0.56  % SZS output start CNFRefutation
% See solution above
% 0.24/0.56  % Parsed axioms                        : 7
% 0.24/0.56  % Removed by relevancy pruning/SinE    : 0
% 0.24/0.56  % Initial clauses                      : 7
% 0.24/0.56  % Removed in clause preprocessing      : 0
% 0.24/0.56  % Initial clauses in saturation        : 7
% 0.24/0.56  % Processed clauses                    : 66
% 0.24/0.56  % ...of these trivial                  : 0
% 0.24/0.56  % ...subsumed                          : 0
% 0.24/0.56  % ...remaining for further processing  : 66
% 0.24/0.56  % Other redundant clauses eliminated   : 0
% 0.24/0.56  % Clauses deleted for lack of memory   : 0
% 0.24/0.56  % Backward-subsumed                    : 0
% 0.24/0.56  % Backward-rewritten                   : 1
% 0.24/0.56  % Generated clauses                    : 269
% 0.24/0.56  % ...of the previous two non-redundant : 188
% 0.24/0.56  % ...aggressively subsumed             : 0
% 0.24/0.56  % Contextual simplify-reflections      : 0
% 0.24/0.56  % Paramodulations                      : 269
% 0.24/0.56  % Factorizations                       : 0
% 0.24/0.56  % NegExts                              : 0
% 0.24/0.56  % Equation resolutions                 : 0
% 0.24/0.56  % Disequality decompositions           : 0
% 0.24/0.56  % Total rewrite steps                  : 56
% 0.24/0.56  % ...of those cached                   : 33
% 0.24/0.56  % Propositional unsat checks           : 0
% 0.24/0.56  %    Propositional check models        : 0
% 0.24/0.56  %    Propositional check unsatisfiable : 0
% 0.24/0.56  %    Propositional clauses             : 0
% 0.24/0.56  %    Propositional clauses after purity: 0
% 0.24/0.56  %    Propositional unsat core size     : 0
% 0.24/0.56  %    Propositional preprocessing time  : 0.000
% 0.24/0.56  %    Propositional encoding time       : 0.000
% 0.24/0.56  %    Propositional solver time         : 0.000
% 0.24/0.56  %    Success case prop preproc time    : 0.000
% 0.24/0.56  %    Success case prop encoding time   : 0.000
% 0.24/0.56  %    Success case prop solver time     : 0.000
% 0.24/0.56  % Current number of processed clauses  : 58
% 0.24/0.56  %    Positive orientable unit clauses  : 22
% 0.24/0.56  %    Positive unorientable unit clauses: 0
% 0.24/0.56  %    Negative unit clauses             : 1
% 0.24/0.56  %    Non-unit-clauses                  : 35
% 0.24/0.56  % Current number of unprocessed clauses: 136
% 0.24/0.56  % ...number of literals in the above   : 239
% 0.24/0.56  % Current number of archived formulas  : 0
% 0.24/0.56  % Current number of archived clauses   : 8
% 0.24/0.56  % Clause-clause subsumption calls (NU) : 115
% 0.24/0.56  % Rec. Clause-clause subsumption calls : 101
% 0.24/0.56  % Non-unit clause-clause subsumptions  : 0
% 0.24/0.56  % Unit Clause-clause subsumption calls : 9
% 0.24/0.56  % Rewrite failures with RHS unbound    : 0
% 0.24/0.56  % BW rewrite match attempts            : 20
% 0.24/0.56  % BW rewrite match successes           : 1
% 0.24/0.56  % Condensation attempts                : 0
% 0.24/0.56  % Condensation successes               : 0
% 0.24/0.56  % Termbank termtop insertions          : 3041
% 0.24/0.56  % Search garbage collected termcells   : 18
% 0.24/0.56  
% 0.24/0.56  % -------------------------------------------------
% 0.24/0.56  % User time                : 0.004 s
% 0.24/0.56  % System time              : 0.006 s
% 0.24/0.56  % Total time               : 0.011 s
% 0.24/0.56  % Maximum resident set size: 3324 pages
% 0.24/0.56  
% 0.24/0.56  % -------------------------------------------------
% 0.24/0.56  % User time                : 0.016 s
% 0.24/0.56  % System time              : 0.014 s
% 0.24/0.56  % Total time               : 0.030 s
% 0.24/0.56  % Maximum resident set size: 4864 pages
% 0.24/0.56  % E exiting
%------------------------------------------------------------------------------