%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : BOO011-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n021.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 : Thu Jul 14 23:49:13 EDT 2022
% Result : Unsatisfiable 0.46s 0.71s
% Output : Refutation 0.46s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : BOO011-1 : TPTP v8.1.0. Released v1.0.0.
% 0.07/0.13 % Command : sos-script %s
% 0.14/0.34 % Computer : n021.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 600
% 0.14/0.34 % DateTime : Wed Jun 1 17:15:46 EDT 2022
% 0.14/0.34 % CPUTime :
% 0.14/0.36 ----- Otter 3.2, August 2001 -----
% 0.14/0.36 The process was started by sandbox2 on n021.cluster.edu,
% 0.14/0.36 Wed Jun 1 17:15:46 2022
% 0.14/0.36 The command was "./sos". The process ID is 31248.
% 0.14/0.36
% 0.14/0.36 set(prolog_style_variables).
% 0.14/0.36 set(auto).
% 0.14/0.36 dependent: set(auto1).
% 0.14/0.36 dependent: set(process_input).
% 0.14/0.36 dependent: clear(print_kept).
% 0.14/0.36 dependent: clear(print_new_demod).
% 0.14/0.36 dependent: clear(print_back_demod).
% 0.14/0.36 dependent: clear(print_back_sub).
% 0.14/0.36 dependent: set(control_memory).
% 0.14/0.36 dependent: assign(max_mem, 12000).
% 0.14/0.36 dependent: assign(pick_given_ratio, 4).
% 0.14/0.36 dependent: assign(stats_level, 1).
% 0.14/0.36 dependent: assign(pick_semantic_ratio, 3).
% 0.14/0.36 dependent: assign(sos_limit, 5000).
% 0.14/0.36 dependent: assign(max_weight, 60).
% 0.14/0.36 clear(print_given).
% 0.14/0.36
% 0.14/0.36 list(usable).
% 0.14/0.36
% 0.14/0.36 SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=5.
% 0.14/0.36
% 0.14/0.36 This is a Horn set with equality. The strategy will be
% 0.14/0.36 Knuth-Bendix and hyper_res, with positive clauses in
% 0.14/0.36 sos and nonpositive clauses in usable.
% 0.14/0.36
% 0.14/0.36 dependent: set(knuth_bendix).
% 0.14/0.36 dependent: set(para_from).
% 0.14/0.36 dependent: set(para_into).
% 0.14/0.36 dependent: clear(para_from_right).
% 0.14/0.36 dependent: clear(para_into_right).
% 0.14/0.36 dependent: set(para_from_vars).
% 0.14/0.36 dependent: set(eq_units_both_ways).
% 0.14/0.36 dependent: set(dynamic_demod_all).
% 0.14/0.36 dependent: set(dynamic_demod).
% 0.14/0.36 dependent: set(order_eq).
% 0.14/0.36 dependent: set(back_demod).
% 0.14/0.36 dependent: set(lrpo).
% 0.14/0.36 dependent: set(hyper_res).
% 0.14/0.36 dependent: clear(order_hyper).
% 0.14/0.36
% 0.14/0.36 ------------> process usable:
% 0.14/0.36
% 0.14/0.36 ------------> process sos:
% 0.14/0.36 Following clause subsumed by 24 during input processing: 0 [copy,24,flip.1] {-} A=A.
% 0.14/0.36
% 0.14/0.36 ======= end of input processing =======
% 0.20/0.41
% 0.20/0.41 Model 1 (0.00 seconds, 0 Inserts)
% 0.20/0.41
% 0.20/0.41 Stopped by limit on number of solutions
% 0.20/0.41
% 0.20/0.41
% 0.20/0.41 -------------- Softie stats --------------
% 0.20/0.41
% 0.20/0.41 UPDATE_STOP: 300
% 0.20/0.41 SFINDER_TIME_LIMIT: 2
% 0.20/0.41 SHORT_CLAUSE_CUTOFF: 4
% 0.20/0.41 number of clauses in intial UL: 13
% 0.20/0.41 number of clauses initially in problem: 24
% 0.20/0.41 percentage of clauses intially in UL: 54
% 0.20/0.41 percentage of distinct symbols occuring in initial UL: 75
% 0.20/0.41 percent of all initial clauses that are short: 100
% 0.20/0.41 absolute distinct symbol count: 8
% 0.20/0.41 distinct predicate count: 3
% 0.20/0.41 distinct function count: 3
% 0.20/0.41 distinct constant count: 2
% 0.20/0.41
% 0.20/0.41 ---------- no more Softie stats ----------
% 0.20/0.41
% 0.20/0.41
% 0.20/0.41
% 0.20/0.41 Model 2 (0.00 seconds, 0 Inserts)
% 0.20/0.41
% 0.20/0.41 Stopped by limit on number of solutions
% 0.20/0.41
% 0.20/0.41 =========== start of search ===========
% 0.46/0.71
% 0.46/0.71 -------- PROOF --------
% 0.46/0.71 % SZS status Unsatisfiable
% 0.46/0.71 % SZS output start Refutation
% 0.46/0.71
% 0.46/0.71 Model 3 (0.00 seconds, 0 Inserts)
% 0.46/0.71
% 0.46/0.71 Stopped by limit on number of solutions
% 0.46/0.71
% 0.46/0.71 Model 4 (0.00 seconds, 0 Inserts)
% 0.46/0.71
% 0.46/0.71 Stopped by limit on number of solutions
% 0.46/0.71
% 0.46/0.71 Stopped by limit on insertions
% 0.46/0.71
% 0.46/0.71 Model 5 [ 4 1 1029 ] (0.00 seconds, 250000 Inserts)
% 0.46/0.71
% 0.46/0.71 Model 6 [ 1 9 202053 ] (0.00 seconds, 222452 Inserts)
% 0.46/0.71
% 0.46/0.71 Model 7 [ 2 5 69054 ] (0.00 seconds, 148942 Inserts)
% 0.46/0.71
% 0.46/0.71 ----> UNIT CONFLICT at 0.32 sec ----> 111 [binary,109.1,13.1] {-} $F.
% 0.46/0.71
% 0.46/0.71 Length of proof is 1. Level of proof is 1.
% 0.46/0.71
% 0.46/0.71 ---------------- PROOF ----------------
% 0.46/0.71 % SZS status Unsatisfiable
% 0.46/0.71 % SZS output start Refutation
% 0.46/0.71
% 0.46/0.71 11 [] {+} -sum(A,B,C)| -sum(A,B,D)|C=D.
% 0.46/0.71 13 [] {+} inverse(additive_identity)!=multiplicative_identity.
% 0.46/0.71 16 [] {+} sum(additive_identity,A,A).
% 0.46/0.71 21 [] {+} sum(A,inverse(A),multiplicative_identity).
% 0.46/0.71 109 [hyper,21,11,16] {-} inverse(additive_identity)=multiplicative_identity.
% 0.46/0.71 111 [binary,109.1,13.1] {-} $F.
% 0.46/0.71
% 0.46/0.71 % SZS output end Refutation
% 0.46/0.71 ------------ end of proof -------------
% 0.46/0.71
% 0.46/0.71
% 0.46/0.71 Search stopped by max_proofs option.
% 0.46/0.71
% 0.46/0.71
% 0.46/0.71 Search stopped by max_proofs option.
% 0.46/0.71
% 0.46/0.71 ============ end of search ============
% 0.46/0.71
% 0.46/0.71 ----------- soft-scott stats ----------
% 0.46/0.71
% 0.46/0.71 true clauses given 1 (14.3%)
% 0.46/0.71 false clauses given 6
% 0.46/0.71
% 0.46/0.71 FALSE TRUE
% 0.46/0.71 4 2 0
% 0.46/0.71 5 4 0
% 0.46/0.71 6 2 6
% 0.46/0.71 7 2 3
% 0.46/0.71 8 2 7
% 0.46/0.71 9 1 7
% 0.46/0.71 10 4 15
% 0.46/0.71 11 0 6
% 0.46/0.71 12 4 11
% 0.46/0.71 13 0 4
% 0.46/0.71 14 0 5
% 0.46/0.71 tot: 21 64 (75.3% true)
% 0.46/0.71
% 0.46/0.71
% 0.46/0.71 Model 7 [ 2 5 69054 ] (0.00 seconds, 148942 Inserts)
% 0.46/0.71
% 0.46/0.71 That finishes the proof of the theorem.
% 0.46/0.71
% 0.46/0.71 Process 31248 finished Wed Jun 1 17:15:46 2022
%------------------------------------------------------------------------------