↑ Up

SOS---2.0.UNS-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : SOS---2.0
% Problem  : GRP537-1 : TPTP v8.1.0. Released v2.6.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : sos-script %s

% Computer : n027.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 : 300s
% WCLimit  : 600s
% DateTime : Sat Jul 16 11:43:16 EDT 2022

% Result   : Unsatisfiable 0.14s 0.37s
% Output   : Refutation 0.14s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.13/0.13  % Problem  : GRP537-1 : TPTP v8.1.0. Released v2.6.0.
% 0.13/0.14  % Command  : sos-script %s
% 0.14/0.35  % Computer : n027.cluster.edu
% 0.14/0.35  % Model    : x86_64 x86_64
% 0.14/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35  % Memory   : 8042.1875MB
% 0.14/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35  % CPULimit : 300
% 0.14/0.35  % WCLimit  : 600
% 0.14/0.35  % DateTime : Tue Jun 14 08:01:48 EDT 2022
% 0.14/0.35  % CPUTime  : 
% 0.14/0.37  
% 0.14/0.37  -------- PROOF -------- 
% 0.14/0.37  % SZS status Unsatisfiable
% 0.14/0.37  % SZS output start Refutation
% 0.14/0.37  ----- Otter 3.2, August 2001 -----
% 0.14/0.37  The process was started by sandbox2 on n027.cluster.edu,
% 0.14/0.37  Tue Jun 14 08:01:48 2022
% 0.14/0.37  The command was "./sos".  The process ID is 25509.
% 0.14/0.37  
% 0.14/0.37  set(prolog_style_variables).
% 0.14/0.37  set(auto).
% 0.14/0.37     dependent: set(auto1).
% 0.14/0.37     dependent: set(process_input).
% 0.14/0.37     dependent: clear(print_kept).
% 0.14/0.37     dependent: clear(print_new_demod).
% 0.14/0.37     dependent: clear(print_back_demod).
% 0.14/0.37     dependent: clear(print_back_sub).
% 0.14/0.37     dependent: set(control_memory).
% 0.14/0.37     dependent: assign(max_mem, 12000).
% 0.14/0.37     dependent: assign(pick_given_ratio, 4).
% 0.14/0.37     dependent: assign(stats_level, 1).
% 0.14/0.37     dependent: assign(pick_semantic_ratio, 3).
% 0.14/0.37     dependent: assign(sos_limit, 5000).
% 0.14/0.37     dependent: assign(max_weight, 60).
% 0.14/0.37  clear(print_given).
% 0.14/0.37  
% 0.14/0.37  list(usable).
% 0.14/0.37  
% 0.14/0.37  SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=1.
% 0.14/0.37  
% 0.14/0.37  All clauses are units, and equality is present; the
% 0.14/0.37  strategy will be Knuth-Bendix with positive clauses in sos.
% 0.14/0.37  
% 0.14/0.37     dependent: set(knuth_bendix).
% 0.14/0.37     dependent: set(para_from).
% 0.14/0.37     dependent: set(para_into).
% 0.14/0.37     dependent: clear(para_from_right).
% 0.14/0.37     dependent: clear(para_into_right).
% 0.14/0.37     dependent: set(para_from_vars).
% 0.14/0.37     dependent: set(eq_units_both_ways).
% 0.14/0.37     dependent: set(dynamic_demod_all).
% 0.14/0.37     dependent: set(dynamic_demod).
% 0.14/0.37     dependent: set(order_eq).
% 0.14/0.37     dependent: set(back_demod).
% 0.14/0.37     dependent: set(lrpo).
% 0.14/0.37  
% 0.14/0.37  ------------> process usable:
% 0.14/0.37  
% 0.14/0.37  ------------> process sos:
% 0.14/0.37    Following clause subsumed by 10 during input processing: 0 [copy,10,flip.1] {-} A=A.
% 0.14/0.37  
% 0.14/0.37  ----> UNIT CONFLICT at   0.00 sec ----> 16 [binary,15.1,10.1] {-} $F.
% 0.14/0.37  
% 0.14/0.37  Length of proof is 5.  Level of proof is 3.
% 0.14/0.37  
% 0.14/0.37  ---------------- PROOF ----------------
% 0.14/0.37  % SZS status Unsatisfiable
% 0.14/0.37  % SZS output start Refutation
% 0.14/0.37  
% 0.14/0.37  1 [] {-} multiply(inverse(a1),a1)!=multiply(inverse(b1),b1).
% 0.14/0.37  2 [copy,1,flip.1] {-} multiply(inverse(b1),b1)!=multiply(inverse(a1),a1).
% 0.14/0.37  5 [] {-} multiply(A,B)=divide(A,divide(divide(C,C),B)).
% 0.14/0.37  6 [] {-} inverse(A)=divide(divide(B,B),A).
% 0.14/0.37  7 [] {-} identity=divide(A,A).
% 0.14/0.37  9,8 [copy,7,flip.1] {-} divide(A,A)=identity.
% 0.14/0.37  10 [] {-} A=A.
% 0.14/0.37  12,11 [copy,5,flip.1,demod,9,flip.1] {-} multiply(A,B)=divide(A,divide(identity,B)).
% 0.14/0.37  14,13 [copy,6,flip.1,demod,9,flip.1] {-} inverse(A)=divide(identity,A).
% 0.14/0.37  15 [back_demod,2,demod,14,12,9,14,12,9] {-} identity!=identity.
% 0.14/0.37  16 [binary,15.1,10.1] {-} $F.
% 0.14/0.37  
% 0.14/0.37  % SZS output end Refutation
% 0.14/0.37  ------------ end of proof -------------
% 0.14/0.37  
% 0.14/0.37  
% 0.14/0.37  Search stopped by max_proofs option.
% 0.14/0.37  
% 0.14/0.37  
% 0.14/0.37  Search stopped by max_proofs option.
% 0.14/0.37  
% 0.14/0.37  ============ end of search ============
% 0.14/0.37  
% 0.14/0.37  That finishes the proof of the theorem.
% 0.14/0.37  
% 0.14/0.37  Process 25509 finished Tue Jun 14 08:01:48 2022
%------------------------------------------------------------------------------