↑ Up

E---3.5.1.UNS-CRf.s

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

% Computer : n016.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:38:55 PM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
cnf(associativity,axiom,
    multiply(multiply(X1,X2),X3) = multiply(X1,multiply(X2,X3)),
    file('/export/starexec/sandbox2/benchmark/Axioms/GRP004-0.ax',associativity) ).

cnf(left_inverse,axiom,
    multiply(inverse(X1),X1) = identity,
    file('/export/starexec/sandbox2/benchmark/Axioms/GRP004-0.ax',left_inverse) ).

cnf(left_identity,axiom,
    multiply(identity,X1) = X1,
    file('/export/starexec/sandbox2/benchmark/Axioms/GRP004-0.ax',left_identity) ).

cnf(prove_p23x,negated_conjecture,
    least_upper_bound(multiply(a,b),identity) != multiply(a,least_upper_bound(inverse(a),b)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_p23x) ).

cnf(symmetry_of_lub,axiom,
    least_upper_bound(X1,X2) = least_upper_bound(X2,X1),
    file('/export/starexec/sandbox2/benchmark/Axioms/GRP004-2.ax',symmetry_of_lub) ).

cnf(monotony_lub1,axiom,
    multiply(X1,least_upper_bound(X2,X3)) = least_upper_bound(multiply(X1,X2),multiply(X1,X3)),
    file('/export/starexec/sandbox2/benchmark/Axioms/GRP004-2.ax',monotony_lub1) ).

cnf(c_0_6,axiom,
    multiply(multiply(X1,X2),X3) = multiply(X1,multiply(X2,X3)),
    associativity ).

cnf(c_0_7,axiom,
    multiply(inverse(X1),X1) = identity,
    left_inverse ).

cnf(c_0_8,axiom,
    multiply(identity,X1) = X1,
    left_identity ).

cnf(c_0_9,plain,
    multiply(inverse(X1),multiply(X1,X2)) = X2,
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_7]),c_0_8]) ).

cnf(c_0_10,plain,
    multiply(inverse(inverse(X1)),identity) = X1,
    inference(spm,[status(thm)],[c_0_9,c_0_7]) ).

cnf(c_0_11,plain,
    multiply(inverse(inverse(X1)),X2) = multiply(X1,X2),
    inference(spm,[status(thm)],[c_0_9,c_0_9]) ).

cnf(c_0_12,plain,
    multiply(X1,identity) = X1,
    inference(rw,[status(thm)],[c_0_10,c_0_11]) ).

cnf(c_0_13,negated_conjecture,
    least_upper_bound(multiply(a,b),identity) != multiply(a,least_upper_bound(inverse(a),b)),
    inference(fof_simplification,[status(thm)],[prove_p23x]) ).

cnf(c_0_14,plain,
    inverse(inverse(X1)) = X1,
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12]),c_0_12]) ).

cnf(c_0_15,negated_conjecture,
    least_upper_bound(multiply(a,b),identity) != multiply(a,least_upper_bound(inverse(a),b)),
    c_0_13 ).

cnf(c_0_16,axiom,
    least_upper_bound(X1,X2) = least_upper_bound(X2,X1),
    symmetry_of_lub ).

cnf(c_0_17,axiom,
    multiply(X1,least_upper_bound(X2,X3)) = least_upper_bound(multiply(X1,X2),multiply(X1,X3)),
    monotony_lub1 ).

cnf(c_0_18,plain,
    multiply(X1,inverse(X1)) = identity,
    inference(spm,[status(thm)],[c_0_7,c_0_14]) ).

cnf(c_0_19,negated_conjecture,
    multiply(a,least_upper_bound(b,inverse(a))) != least_upper_bound(identity,multiply(a,b)),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_15,c_0_16]),c_0_16]) ).

cnf(c_0_20,plain,
    multiply(X1,least_upper_bound(X2,inverse(X1))) = least_upper_bound(identity,multiply(X1,X2)),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_16]) ).

cnf(c_0_21,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_19,c_0_20])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : GRP186-3 : TPTP v9.3.1. Bugfixed v1.2.1.
% 0.00/0.06  % Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.16/0.44  % Computer : n016.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 : Sun Sep 20 20:09:53 UTC 2026
% 0.16/0.45  % CPUTime  : 
% 0.16/0.45  Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.26/0.52  Running first-order theorem proving
% 0.26/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.26/0.59  % Version: 3.5.1
% 0.26/0.59  % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.26/0.59  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.26/0.59  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.26/0.59  % Starting new_bool_3 with 300s (1) cores
% 0.26/0.59  % Starting new_bool_1 with 300s (1) cores
% 0.26/0.59  % Starting sh5l with 300s (1) cores
% 0.26/0.59  % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 685035 completed with status 0
% 0.26/0.59  % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.26/0.59  % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.26/0.59  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.26/0.59  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.26/0.59  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.26/0.59  % No SInE strategy applied
% 0.26/0.59  % Search class: FUUPM-FFSF21-MFFFFFNN
% 0.26/0.59  % Scheduled 8 strats onto 5 cores with 1500 seconds (1500 total)
% 0.26/0.59  % Starting SubtermCWHack with 136s (1) cores
% 0.26/0.59  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.26/0.59  % Starting H----_047_B31_F1_PI_AE_R4_CS_SP_S2S with 136s (1) cores
% 0.26/0.59  % Starting G-E--_060_C18_F1_PI_SE_CS_SP_CO_S0Y with 136s (1) cores
% 0.26/0.59  % Starting U----_043_B31_F1_PI_AE_CS_SP_S2S with 136s (1) cores
% 0.26/0.59  % G-E--_060_C18_F1_PI_SE_CS_SP_CO_S0Y with pid 685042 completed with status 0
% 0.26/0.59  % Result found by G-E--_060_C18_F1_PI_SE_CS_SP_CO_S0Y
% 0.26/0.59  % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.26/0.59  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.26/0.59  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.26/0.59  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.26/0.59  % No SInE strategy applied
% 0.26/0.59  % Search class: FUUPM-FFSF21-MFFFFFNN
% 0.26/0.59  % Scheduled 8 strats onto 5 cores with 1500 seconds (1500 total)
% 0.26/0.59  % Starting SubtermCWHack with 136s (1) cores
% 0.26/0.59  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.26/0.59  % Starting H----_047_B31_F1_PI_AE_R4_CS_SP_S2S with 136s (1) cores
% 0.26/0.59  % Starting G-E--_060_C18_F1_PI_SE_CS_SP_CO_S0Y with 136s (1) cores
% 0.26/0.59  % Preprocessing time       : 0.002 s
% 0.26/0.59  
% 0.26/0.59  % Proof found!
% 0.26/0.59  % SZS status Unsatisfiable
% 0.26/0.59  % SZS output start CNFRefutation
% See solution above
% 0.26/0.59  % Parsed axioms                        : 16
% 0.26/0.59  % Removed by relevancy pruning/SinE    : 0
% 0.26/0.59  % Initial clauses                      : 16
% 0.26/0.59  % Removed in clause preprocessing      : 0
% 0.26/0.59  % Initial clauses in saturation        : 16
% 0.26/0.59  % Processed clauses                    : 259
% 0.26/0.59  % ...of these trivial                  : 57
% 0.26/0.59  % ...subsumed                          : 132
% 0.26/0.59  % ...remaining for further processing  : 70
% 0.26/0.59  % Other redundant clauses eliminated   : 0
% 0.26/0.59  % Clauses deleted for lack of memory   : 0
% 0.26/0.59  % Backward-subsumed                    : 0
% 0.26/0.59  % Backward-rewritten                   : 12
% 0.26/0.59  % Generated clauses                    : 1685
% 0.26/0.59  % ...of the previous two non-redundant : 1037
% 0.26/0.59  % ...aggressively subsumed             : 0
% 0.26/0.59  % Contextual simplify-reflections      : 0
% 0.26/0.59  % Paramodulations                      : 1685
% 0.26/0.59  % Factorizations                       : 0
% 0.26/0.59  % NegExts                              : 0
% 0.26/0.59  % Equation resolutions                 : 0
% 0.26/0.59  % Disequality decompositions           : 0
% 0.26/0.59  % Total rewrite steps                  : 1830
% 0.26/0.59  % ...of those cached                   : 1201
% 0.26/0.59  % Propositional unsat checks           : 0
% 0.26/0.59  %    Propositional check models        : 0
% 0.26/0.59  %    Propositional check unsatisfiable : 0
% 0.26/0.59  %    Propositional clauses             : 0
% 0.26/0.59  %    Propositional clauses after purity: 0
% 0.26/0.59  %    Propositional unsat core size     : 0
% 0.26/0.59  %    Propositional preprocessing time  : 0.000
% 0.26/0.59  %    Propositional encoding time       : 0.000
% 0.26/0.59  %    Propositional solver time         : 0.000
% 0.26/0.59  %    Success case prop preproc time    : 0.000
% 0.26/0.59  %    Success case prop encoding time   : 0.000
% 0.26/0.59  %    Success case prop solver time     : 0.000
% 0.26/0.59  % Current number of processed clauses  : 58
% 0.26/0.59  %    Positive orientable unit clauses  : 53
% 0.26/0.59  %    Positive unorientable unit clauses: 5
% 0.26/0.59  %    Negative unit clauses             : 0
% 0.26/0.59  %    Non-unit-clauses                  : 0
% 0.26/0.59  % Current number of unprocessed clauses: 787
% 0.26/0.59  % ...number of literals in the above   : 787
% 0.26/0.59  % Current number of archived formulas  : 0
% 0.26/0.59  % Current number of archived clauses   : 12
% 0.26/0.59  % Clause-clause subsumption calls (NU) : 0
% 0.26/0.59  % Rec. Clause-clause subsumption calls : 0
% 0.26/0.59  % Non-unit clause-clause subsumptions  : 0
% 0.26/0.59  % Unit Clause-clause subsumption calls : 6
% 0.26/0.59  % Rewrite failures with RHS unbound    : 0
% 0.26/0.59  % BW rewrite match attempts            : 101
% 0.26/0.59  % BW rewrite match successes           : 62
% 0.26/0.59  % Condensation attempts                : 259
% 0.26/0.59  % Condensation successes               : 0
% 0.26/0.59  % Termbank termtop insertions          : 12454
% 0.26/0.59  % Search garbage collected termcells   : 2
% 0.26/0.59  
% 0.26/0.59  % -------------------------------------------------
% 0.26/0.59  % User time                : 0.024 s
% 0.26/0.59  % System time              : 0.008 s
% 0.26/0.59  % Total time               : 0.032 s
% 0.26/0.59  % Maximum resident set size: 3384 pages
% 0.26/0.59  
% 0.26/0.59  % -------------------------------------------------
% 0.26/0.59  % User time                : 0.103 s
% 0.26/0.59  % System time              : 0.023 s
% 0.26/0.59  % Total time               : 0.126 s
% 0.26/0.59  % Maximum resident set size: 4608 pages
% 0.26/0.59  % E exiting
%------------------------------------------------------------------------------