↑ Up

SOS---2.0.THM-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : SOS---2.0
% Problem  : COM021+4 : TPTP v8.1.0. Released v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : sos-script %s

% 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 : 300s
% WCLimit  : 600s
% DateTime : Fri Jul 15 01:43:33 EDT 2022

% Result   : Theorem 6.13s 6.38s
% Output   : Refutation 6.13s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : COM021+4 : TPTP v8.1.0. Released v4.0.0.
% 0.03/0.13  % Command  : sos-script %s
% 0.12/0.34  % Computer : n020.cluster.edu
% 0.12/0.34  % Model    : x86_64 x86_64
% 0.12/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34  % Memory   : 8042.1875MB
% 0.12/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34  % CPULimit : 300
% 0.12/0.34  % WCLimit  : 600
% 0.12/0.34  % DateTime : Thu Jun 16 16:58:34 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 6.13/6.38  
% 6.13/6.38  -------- PROOF -------- 
% 6.13/6.38  % SZS status Unsatisfiable
% 6.13/6.38  % SZS output start Refutation
% 6.13/6.38  ----- Otter 3.2, August 2001 -----
% 6.13/6.38  The process was started by sandbox on n020.cluster.edu,
% 6.13/6.38  Thu Jun 16 16:58:34 2022
% 6.13/6.38  The command was "./sos".  The process ID is 14588.
% 6.13/6.38  
% 6.13/6.38  set(prolog_style_variables).
% 6.13/6.38  set(auto).
% 6.13/6.38     dependent: set(auto1).
% 6.13/6.38     dependent: set(process_input).
% 6.13/6.38     dependent: clear(print_kept).
% 6.13/6.38     dependent: clear(print_new_demod).
% 6.13/6.38     dependent: clear(print_back_demod).
% 6.13/6.38     dependent: clear(print_back_sub).
% 6.13/6.38     dependent: set(control_memory).
% 6.13/6.38     dependent: assign(max_mem, 12000).
% 6.13/6.38     dependent: assign(pick_given_ratio, 4).
% 6.13/6.38     dependent: assign(stats_level, 1).
% 6.13/6.38     dependent: assign(pick_semantic_ratio, 3).
% 6.13/6.38     dependent: assign(sos_limit, 5000).
% 6.13/6.38     dependent: assign(max_weight, 60).
% 6.13/6.38  clear(print_given).
% 6.13/6.38  
% 6.13/6.38  formula_list(usable).
% 6.13/6.38  
% 6.13/6.38  SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=13.
% 6.13/6.38  
% 6.13/6.38  This ia a non-Horn set with equality.  The strategy will be
% 6.13/6.38  Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 6.13/6.38  unit deletion, with positive clauses in sos and nonpositive
% 6.13/6.38  clauses in usable.
% 6.13/6.38  
% 6.13/6.38     dependent: set(knuth_bendix).
% 6.13/6.38     dependent: set(para_from).
% 6.13/6.38     dependent: set(para_into).
% 6.13/6.38     dependent: clear(para_from_right).
% 6.13/6.38     dependent: clear(para_into_right).
% 6.13/6.38     dependent: set(para_from_vars).
% 6.13/6.38     dependent: set(eq_units_both_ways).
% 6.13/6.38     dependent: set(dynamic_demod_all).
% 6.13/6.38     dependent: set(dynamic_demod).
% 6.13/6.38     dependent: set(order_eq).
% 6.13/6.38     dependent: set(back_demod).
% 6.13/6.38     dependent: set(lrpo).
% 6.13/6.38     dependent: set(hyper_res).
% 6.13/6.38     dependent: set(unit_deletion).
% 6.13/6.38     dependent: set(factor).
% 6.13/6.38  
% 6.13/6.38  ------------> process usable:
% 6.13/6.38  791 back subsumes 661.
% 6.13/6.38  794 back subsumes 664.
% 6.13/6.38  797 back subsumes 667.
% 6.13/6.38  800 back subsumes 670.
% 6.13/6.38  803 back subsumes 673.
% 6.13/6.38  806 back subsumes 676.
% 6.13/6.38  809 back subsumes 679.
% 6.13/6.38  812 back subsumes 682.
% 6.13/6.38  815 back subsumes 685.
% 6.13/6.38  818 back subsumes 688.
% 6.13/6.38  821 back subsumes 691.
% 6.13/6.38  901 back subsumes 868.
% 6.13/6.38  904 back subsumes 871.
% 6.13/6.38  907 back subsumes 874.
% 6.13/6.38  910 back subsumes 877.
% 6.13/6.38  913 back subsumes 880.
% 6.13/6.38  916 back subsumes 883.
% 6.13/6.38  919 back subsumes 886.
% 6.13/6.38  922 back subsumes 889.
% 6.13/6.38  925 back subsumes 892.
% 6.13/6.38  928 back subsumes 895.
% 6.13/6.38  931 back subsumes 898.
% 6.13/6.38  1095 back subsumes 976.
% 6.13/6.38  1098 back subsumes 979.
% 6.13/6.38  1101 back subsumes 982.
% 6.13/6.38  1104 back subsumes 985.
% 6.13/6.38  1107 back subsumes 988.
% 6.13/6.38  1110 back subsumes 991.
% 6.13/6.38  1113 back subsumes 994.
% 6.13/6.38  1116 back subsumes 997.
% 6.13/6.38  1119 back subsumes 1000.
% 6.13/6.38  
% 6.13/6.38  ------------> process sos:
% 6.13/6.38  
% 6.13/6.38  ----> UNIT CONFLICT at   6.00 sec ----> 1444 [binary,1443.1,543.1] {-} $F.
% 6.13/6.38  
% 6.13/6.38  Length of proof is 2.  Level of proof is 2.
% 6.13/6.38  
% 6.13/6.38  ---------------- PROOF ----------------
% 6.13/6.38  % SZS status Theorem
% 6.13/6.38  % SZS output start Refutation
% 6.13/6.38  
% 6.13/6.38  537 [] {-} -aReductOfIn0(A,xd,xR).
% 6.13/6.38  543 [] {-} -sdtmndtasgtdt0(xb,xR,xd).
% 6.13/6.38  1430 [] {-} sdtmndtasgtdt0(xb,xR,xx).
% 6.13/6.38  1433 [] {-} xd=xx|aReductOfIn0(xx,xd,xR)|aReductOfIn0($c9,xd,xR).
% 6.13/6.38  1435,1434 [copy,1433,unit_del,537,537,flip.1] {-} xx=xd.
% 6.13/6.38  1443 [back_demod,1430,demod,1435] {-} sdtmndtasgtdt0(xb,xR,xd).
% 6.13/6.38  1444 [binary,1443.1,543.1] {-} $F.
% 6.13/6.38  
% 6.13/6.38  % SZS output end Refutation
% 6.13/6.38  ------------ end of proof -------------
% 6.13/6.38  
% 6.13/6.38  
% 6.13/6.38  Search stopped by max_proofs option.
% 6.13/6.38  
% 6.13/6.38  
% 6.13/6.38  Search stopped by max_proofs option.
% 6.13/6.38  
% 6.13/6.38  ============ end of search ============
% 6.13/6.38  
% 6.13/6.38  That finishes the proof of the theorem.
% 6.13/6.38  
% 6.13/6.38  Process 14588 finished Thu Jun 16 16:58:40 2022
%------------------------------------------------------------------------------