TSTP Solution File: GRP166-3 by E---3.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : E---3.1
% Problem  : GRP166-3 : TPTP v8.1.2. Bugfixed v1.2.1.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E %s %d THM

% Computer : n020.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8042.1875MB
% OS       : Linux 3.10.0-693.el7.x86_64
% CPULimit : 2400s
% WCLimit  : 300s
% DateTime : Tue Oct 10 17:39:04 EDT 2023

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

% Comments : 
%------------------------------------------------------------------------------
cnf(monotony_lub2,axiom,
    multiply(least_upper_bound(X1,X2),X3) = least_upper_bound(multiply(X1,X3),multiply(X2,X3)),
    file('/export/starexec/sandbox2/tmp/tmp.larwSOlSAw/E---3.1_30574.p',monotony_lub2) ).

cnf(left_identity,axiom,
    multiply(identity,X1) = X1,
    file('/export/starexec/sandbox2/tmp/tmp.larwSOlSAw/E---3.1_30574.p',left_identity) ).

cnf(symmetry_of_lub,axiom,
    least_upper_bound(X1,X2) = least_upper_bound(X2,X1),
    file('/export/starexec/sandbox2/tmp/tmp.larwSOlSAw/E---3.1_30574.p',symmetry_of_lub) ).

cnf(lat3a_2,hypothesis,
    least_upper_bound(b,identity) = b,
    file('/export/starexec/sandbox2/tmp/tmp.larwSOlSAw/E---3.1_30574.p',lat3a_2) ).

cnf(prove_lat3a,negated_conjecture,
    least_upper_bound(a,multiply(b,a)) != multiply(b,a),
    file('/export/starexec/sandbox2/tmp/tmp.larwSOlSAw/E---3.1_30574.p',prove_lat3a) ).

cnf(c_0_5,axiom,
    multiply(least_upper_bound(X1,X2),X3) = least_upper_bound(multiply(X1,X3),multiply(X2,X3)),
    monotony_lub2 ).

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

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

cnf(c_0_8,hypothesis,
    least_upper_bound(b,identity) = b,
    lat3a_2 ).

cnf(c_0_9,negated_conjecture,
    least_upper_bound(a,multiply(b,a)) != multiply(b,a),
    prove_lat3a ).

cnf(c_0_10,plain,
    least_upper_bound(X1,multiply(X2,X1)) = multiply(least_upper_bound(X2,identity),X1),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_5,c_0_6]),c_0_7]) ).

cnf(c_0_11,hypothesis,
    least_upper_bound(identity,b) = b,
    inference(rw,[status(thm)],[c_0_8,c_0_7]) ).

cnf(c_0_12,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_9,c_0_10]),c_0_7]),c_0_11])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13  % Problem    : GRP166-3 : TPTP v8.1.2. Bugfixed v1.2.1.
% 0.08/0.14  % Command    : run_E %s %d THM
% 0.15/0.35  % Computer : n020.cluster.edu
% 0.15/0.35  % Model    : x86_64 x86_64
% 0.15/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35  % Memory   : 8042.1875MB
% 0.15/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35  % CPULimit   : 2400
% 0.15/0.35  % WCLimit    : 300
% 0.15/0.35  % DateTime   : Tue Oct  3 02:44:31 EDT 2023
% 0.15/0.35  % CPUTime    : 
% 0.22/0.49  Running first-order theorem proving
% 0.22/0.49  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/tmp/tmp.larwSOlSAw/E---3.1_30574.p
% 0.22/0.52  # Version: 3.1pre001
% 0.22/0.52  # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.22/0.52  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.52  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.22/0.52  # Starting new_bool_3 with 300s (1) cores
% 0.22/0.52  # Starting new_bool_1 with 300s (1) cores
% 0.22/0.52  # Starting sh5l with 300s (1) cores
% 0.22/0.52  # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 30654 completed with status 0
% 0.22/0.52  # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.22/0.52  # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.22/0.52  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.52  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.22/0.52  # No SInE strategy applied
% 0.22/0.52  # Search class: FUUPM-FFSF21-SFFFFFNN
% 0.22/0.52  # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.22/0.52  # Starting U----_102_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 811s (1) cores
% 0.22/0.52  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.22/0.52  # Starting new_bool_3 with 136s (1) cores
% 0.22/0.52  # Starting new_bool_1 with 136s (1) cores
% 0.22/0.52  # Starting sh5l with 136s (1) cores
% 0.22/0.52  # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 30659 completed with status 0
% 0.22/0.52  # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.22/0.52  # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.22/0.52  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.52  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.22/0.52  # No SInE strategy applied
% 0.22/0.52  # Search class: FUUPM-FFSF21-SFFFFFNN
% 0.22/0.52  # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.22/0.52  # Starting U----_102_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 811s (1) cores
% 0.22/0.52  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.22/0.52  # Preprocessing time       : 0.001 s
% 0.22/0.52  # Presaturation interreduction done
% 0.22/0.52  
% 0.22/0.52  # Proof found!
% 0.22/0.52  # SZS status Unsatisfiable
% 0.22/0.52  # SZS output start CNFRefutation
% See solution above
% 0.22/0.52  # Parsed axioms                        : 18
% 0.22/0.52  # Removed by relevancy pruning/SinE    : 0
% 0.22/0.52  # Initial clauses                      : 18
% 0.22/0.52  # Removed in clause preprocessing      : 0
% 0.22/0.52  # Initial clauses in saturation        : 18
% 0.22/0.52  # Processed clauses                    : 196
% 0.22/0.52  # ...of these trivial                  : 70
% 0.22/0.52  # ...subsumed                          : 31
% 0.22/0.52  # ...remaining for further processing  : 95
% 0.22/0.52  # Other redundant clauses eliminated   : 0
% 0.22/0.52  # Clauses deleted for lack of memory   : 0
% 0.22/0.52  # Backward-subsumed                    : 0
% 0.22/0.52  # Backward-rewritten                   : 8
% 0.22/0.52  # Generated clauses                    : 1607
% 0.22/0.52  # ...of the previous two non-redundant : 761
% 0.22/0.52  # ...aggressively subsumed             : 0
% 0.22/0.52  # Contextual simplify-reflections      : 0
% 0.22/0.52  # Paramodulations                      : 1607
% 0.22/0.52  # Factorizations                       : 0
% 0.22/0.52  # NegExts                              : 0
% 0.22/0.52  # Equation resolutions                 : 0
% 0.22/0.52  # Total rewrite steps                  : 1671
% 0.22/0.52  # Propositional unsat checks           : 0
% 0.22/0.52  #    Propositional check models        : 0
% 0.22/0.52  #    Propositional check unsatisfiable : 0
% 0.22/0.52  #    Propositional clauses             : 0
% 0.22/0.52  #    Propositional clauses after purity: 0
% 0.22/0.52  #    Propositional unsat core size     : 0
% 0.22/0.52  #    Propositional preprocessing time  : 0.000
% 0.22/0.52  #    Propositional encoding time       : 0.000
% 0.22/0.52  #    Propositional solver time         : 0.000
% 0.22/0.52  #    Success case prop preproc time    : 0.000
% 0.22/0.52  #    Success case prop encoding time   : 0.000
% 0.22/0.52  #    Success case prop solver time     : 0.000
% 0.22/0.52  # Current number of processed clauses  : 69
% 0.22/0.52  #    Positive orientable unit clauses  : 64
% 0.22/0.52  #    Positive unorientable unit clauses: 5
% 0.22/0.52  #    Negative unit clauses             : 0
% 0.22/0.52  #    Non-unit-clauses                  : 0
% 0.22/0.52  # Current number of unprocessed clauses: 594
% 0.22/0.52  # ...number of literals in the above   : 594
% 0.22/0.52  # Current number of archived formulas  : 0
% 0.22/0.52  # Current number of archived clauses   : 26
% 0.22/0.52  # Clause-clause subsumption calls (NU) : 0
% 0.22/0.52  # Rec. Clause-clause subsumption calls : 0
% 0.22/0.52  # Non-unit clause-clause subsumptions  : 0
% 0.22/0.52  # Unit Clause-clause subsumption calls : 11
% 0.22/0.52  # Rewrite failures with RHS unbound    : 0
% 0.22/0.52  # BW rewrite match attempts            : 154
% 0.22/0.52  # BW rewrite match successes           : 107
% 0.22/0.52  # Condensation attempts                : 0
% 0.22/0.52  # Condensation successes               : 0
% 0.22/0.52  # Termbank termtop insertions          : 12352
% 0.22/0.52  
% 0.22/0.52  # -------------------------------------------------
% 0.22/0.52  # User time                : 0.015 s
% 0.22/0.52  # System time              : 0.004 s
% 0.22/0.52  # Total time               : 0.019 s
% 0.22/0.52  # Maximum resident set size: 1524 pages
% 0.22/0.52  
% 0.22/0.52  # -------------------------------------------------
% 0.22/0.52  # User time                : 0.084 s
% 0.22/0.52  # System time              : 0.010 s
% 0.22/0.52  # Total time               : 0.094 s
% 0.22/0.52  # Maximum resident set size: 1676 pages
% 0.22/0.52  % E---3.1 exiting
% 0.22/0.52  % E---3.1 exiting
%------------------------------------------------------------------------------