↑ Up

E---3.5.1.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : E---3.5.1
% Problem  : GRP166-2 : 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 : n007.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:48 PM UTC 2026

% Result   : Unsatisfiable 0.15s 0.45s
% Output   : CNFRefutation 0.15s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    7
% Syntax   : Number of clauses     :   22 (  22 unt;   0 nHn;   7 RR)
%            Number of literals    :   22 (  21 equ;   3 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   :   28 (   0 sgn)

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

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

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

cnf(prove_lat2b,negated_conjecture,
    greatest_lower_bound(a,multiply(a,b)) != a,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_lat2b) ).

cnf(monotony_glb1,axiom,
    multiply(X1,greatest_lower_bound(X2,X3)) = greatest_lower_bound(multiply(X1,X2),multiply(X1,X3)),
    file('/export/starexec/sandbox/benchmark/Axioms/GRP004-2.ax',monotony_glb1) ).

cnf(lat2b_2,hypothesis,
    greatest_lower_bound(b,identity) = identity,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',lat2b_2) ).

cnf(symmetry_of_glb,axiom,
    greatest_lower_bound(X1,X2) = greatest_lower_bound(X2,X1),
    file('/export/starexec/sandbox/benchmark/Axioms/GRP004-2.ax',symmetry_of_glb) ).

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

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

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

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

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

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

cnf(c_0_13,negated_conjecture,
    greatest_lower_bound(a,multiply(a,b)) != a,
    inference(fof_simplification,[status(thm)],[prove_lat2b]) ).

cnf(c_0_14,axiom,
    multiply(X1,greatest_lower_bound(X2,X3)) = greatest_lower_bound(multiply(X1,X2),multiply(X1,X3)),
    monotony_glb1 ).

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

cnf(c_0_16,hypothesis,
    greatest_lower_bound(b,identity) = identity,
    lat2b_2 ).

cnf(c_0_17,axiom,
    greatest_lower_bound(X1,X2) = greatest_lower_bound(X2,X1),
    symmetry_of_glb ).

cnf(c_0_18,negated_conjecture,
    greatest_lower_bound(a,multiply(a,b)) != a,
    c_0_13 ).

cnf(c_0_19,plain,
    greatest_lower_bound(X1,multiply(X1,X2)) = multiply(X1,greatest_lower_bound(identity,X2)),
    inference(spm,[status(thm)],[c_0_14,c_0_15]) ).

cnf(c_0_20,hypothesis,
    greatest_lower_bound(identity,b) = identity,
    inference(rw,[status(thm)],[c_0_16,c_0_17]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : GRP166-2 : TPTP v9.3.1. Bugfixed v1.2.1.
% 0.00/0.05  % Command  : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.12/0.37  % Computer : n007.cluster.edu
% 0.12/0.37  % Model    : x86_64 x86_64
% 0.12/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.37  % Memory   : 8046.5625MB
% 0.12/0.37  % OS       : Linux 6.8.0-71-generic
% 0.12/0.37  % CPULimit : 300
% 0.12/0.37  % WCLimit  : 300
% 0.12/0.37  % DateTime : Sun Sep 20 20:01:05 UTC 2026
% 0.12/0.37  % CPUTime  : 
% 0.12/0.37  Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.15/0.41  Running first-order theorem proving
% 0.15/0.41  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.15/0.45  % Version: 3.5.1
% 0.15/0.45  % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.45  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.45  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.45  % Starting new_bool_3 with 300s (1) cores
% 0.15/0.45  % Starting new_bool_1 with 300s (1) cores
% 0.15/0.45  % Starting sh5l with 300s (1) cores
% 0.15/0.45  % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 3456997 completed with status 0
% 0.15/0.45  % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.15/0.45  % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.45  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.45  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.45  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.15/0.45  % No SInE strategy applied
% 0.15/0.45  % Search class: FUUPM-FFSF21-SFFFFFNN
% 0.15/0.45  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.15/0.45  % Starting SubtermCWHack with 136s (1) cores
% 0.15/0.45  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.15/0.45  % Starting SAT001_MinMin_p005000_rr_RG with 136s (1) cores
% 0.15/0.45  % Starting new_bool_3 with 136s (1) cores
% 0.15/0.45  % Starting new_bool_1 with 136s (1) cores
% 0.15/0.45  % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 3457002 completed with status 0
% 0.15/0.45  % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.15/0.45  % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.45  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.45  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.45  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.15/0.45  % No SInE strategy applied
% 0.15/0.45  % Search class: FUUPM-FFSF21-SFFFFFNN
% 0.15/0.45  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.15/0.45  % Starting SubtermCWHack with 136s (1) cores
% 0.15/0.45  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.15/0.45  % Preprocessing time       : 0.001 s
% 0.15/0.45  % Presaturation interreduction done
% 0.15/0.45  
% 0.15/0.45  % Proof found!
% 0.15/0.45  % SZS status Unsatisfiable
% 0.15/0.45  % SZS output start CNFRefutation
% See solution above
% 0.15/0.45  % Parsed axioms                        : 18
% 0.15/0.45  % Removed by relevancy pruning/SinE    : 0
% 0.15/0.45  % Initial clauses                      : 18
% 0.15/0.45  % Removed in clause preprocessing      : 0
% 0.15/0.45  % Initial clauses in saturation        : 18
% 0.15/0.45  % Processed clauses                    : 218
% 0.15/0.45  % ...of these trivial                  : 55
% 0.15/0.45  % ...subsumed                          : 41
% 0.15/0.45  % ...remaining for further processing  : 122
% 0.15/0.45  % Other redundant clauses eliminated   : 0
% 0.15/0.45  % Clauses deleted for lack of memory   : 0
% 0.15/0.45  % Backward-subsumed                    : 0
% 0.15/0.45  % Backward-rewritten                   : 11
% 0.15/0.45  % Generated clauses                    : 2425
% 0.15/0.45  % ...of the previous two non-redundant : 1295
% 0.15/0.45  % ...aggressively subsumed             : 0
% 0.15/0.45  % Contextual simplify-reflections      : 0
% 0.15/0.45  % Paramodulations                      : 2425
% 0.15/0.45  % Factorizations                       : 0
% 0.15/0.45  % NegExts                              : 0
% 0.15/0.45  % Equation resolutions                 : 0
% 0.15/0.45  % Disequality decompositions           : 0
% 0.15/0.45  % Total rewrite steps                  : 2829
% 0.15/0.45  % ...of those cached                   : 2076
% 0.15/0.45  % Propositional unsat checks           : 0
% 0.15/0.45  %    Propositional check models        : 0
% 0.15/0.45  %    Propositional check unsatisfiable : 0
% 0.15/0.45  %    Propositional clauses             : 0
% 0.15/0.45  %    Propositional clauses after purity: 0
% 0.15/0.45  %    Propositional unsat core size     : 0
% 0.15/0.45  %    Propositional preprocessing time  : 0.000
% 0.15/0.45  %    Propositional encoding time       : 0.000
% 0.15/0.45  %    Propositional solver time         : 0.000
% 0.15/0.45  %    Success case prop preproc time    : 0.000
% 0.15/0.45  %    Success case prop encoding time   : 0.000
% 0.15/0.45  %    Success case prop solver time     : 0.000
% 0.15/0.45  % Current number of processed clauses  : 93
% 0.15/0.45  %    Positive orientable unit clauses  : 87
% 0.15/0.45  %    Positive unorientable unit clauses: 6
% 0.15/0.45  %    Negative unit clauses             : 0
% 0.15/0.45  %    Non-unit-clauses                  : 0
% 0.15/0.45  % Current number of unprocessed clauses: 1101
% 0.15/0.45  % ...number of literals in the above   : 1101
% 0.15/0.45  % Current number of archived formulas  : 0
% 0.15/0.45  % Current number of archived clauses   : 29
% 0.15/0.45  % Clause-clause subsumption calls (NU) : 0
% 0.15/0.45  % Rec. Clause-clause subsumption calls : 0
% 0.15/0.45  % Non-unit clause-clause subsumptions  : 0
% 0.15/0.45  % Unit Clause-clause subsumption calls : 8
% 0.15/0.45  % Rewrite failures with RHS unbound    : 0
% 0.15/0.45  % BW rewrite match attempts            : 163
% 0.15/0.45  % BW rewrite match successes           : 98
% 0.15/0.45  % Condensation attempts                : 0
% 0.15/0.45  % Condensation successes               : 0
% 0.15/0.45  % Termbank termtop insertions          : 21430
% 0.15/0.45  % Search garbage collected termcells   : 2
% 0.15/0.45  
% 0.15/0.45  % -------------------------------------------------
% 0.15/0.45  % User time                : 0.023 s
% 0.15/0.45  % System time              : 0.005 s
% 0.15/0.45  % Total time               : 0.028 s
% 0.15/0.45  % Maximum resident set size: 3640 pages
% 0.15/0.45  
% 0.15/0.45  % -------------------------------------------------
% 0.15/0.45  % User time                : 0.113 s
% 0.15/0.45  % System time              : 0.018 s
% 0.15/0.45  % Total time               : 0.131 s
% 0.15/0.45  % Maximum resident set size: 4864 pages
% 0.15/0.45  % E exiting
%------------------------------------------------------------------------------