%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : NUM003-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n008.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 : Mon Jul 18 14:15:42 EDT 2022
% Result : Unsatisfiable 1.40s 1.63s
% Output : Refutation 1.40s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : NUM003-1 : TPTP v8.1.0. Released v1.0.0.
% 0.06/0.12 % Command : sos-script %s
% 0.12/0.33 % Computer : n008.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Thu Jul 7 22:23:38 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.12/0.35 ----- Otter 3.2, August 2001 -----
% 0.12/0.35 The process was started by sandbox on n008.cluster.edu,
% 0.12/0.35 Thu Jul 7 22:23:38 2022
% 0.12/0.35 The command was "./sos". The process ID is 16322.
% 0.12/0.35
% 0.12/0.35 set(prolog_style_variables).
% 0.12/0.35 set(auto).
% 0.12/0.35 dependent: set(auto1).
% 0.12/0.35 dependent: set(process_input).
% 0.12/0.35 dependent: clear(print_kept).
% 0.12/0.35 dependent: clear(print_new_demod).
% 0.12/0.35 dependent: clear(print_back_demod).
% 0.12/0.35 dependent: clear(print_back_sub).
% 0.12/0.35 dependent: set(control_memory).
% 0.12/0.35 dependent: assign(max_mem, 12000).
% 0.12/0.35 dependent: assign(pick_given_ratio, 4).
% 0.12/0.35 dependent: assign(stats_level, 1).
% 0.12/0.35 dependent: assign(pick_semantic_ratio, 3).
% 0.12/0.35 dependent: assign(sos_limit, 5000).
% 0.12/0.35 dependent: assign(max_weight, 60).
% 0.12/0.35 clear(print_given).
% 0.12/0.35
% 0.12/0.35 list(usable).
% 0.12/0.35
% 0.12/0.35 SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=3.
% 0.12/0.35
% 0.12/0.35 This is a Horn set with equality. The strategy will be
% 0.12/0.35 Knuth-Bendix and hyper_res, with positive clauses in
% 0.12/0.35 sos and nonpositive clauses in usable.
% 0.12/0.35
% 0.12/0.35 dependent: set(knuth_bendix).
% 0.12/0.35 dependent: set(para_from).
% 0.12/0.35 dependent: set(para_into).
% 0.12/0.35 dependent: clear(para_from_right).
% 0.12/0.35 dependent: clear(para_into_right).
% 0.12/0.35 dependent: set(para_from_vars).
% 0.12/0.35 dependent: set(eq_units_both_ways).
% 0.12/0.35 dependent: set(dynamic_demod_all).
% 0.12/0.35 dependent: set(dynamic_demod).
% 0.12/0.35 dependent: set(order_eq).
% 0.12/0.35 dependent: set(back_demod).
% 0.12/0.35 dependent: set(lrpo).
% 0.12/0.35 dependent: set(hyper_res).
% 0.12/0.35 dependent: clear(order_hyper).
% 0.12/0.35
% 0.12/0.35 ------------> process usable:
% 0.12/0.35
% 0.12/0.35 ------------> process sos:
% 0.12/0.35 Following clause subsumed by 7 during input processing: 0 [demod,13] {-} equalish(A,A).
% 0.12/0.35 Following clause subsumed by 7 during input processing: 0 [demod,16] {-} equalish(add(subtract(A,C),B),add(subtract(A,C),B)).
% 0.12/0.35 Following clause subsumed by 7 during input processing: 0 [copy,7,flip.1] {-} equalish(A,A).
% 0.12/0.35 Following clause subsumed by 8 during input processing: 0 [copy,8,flip.1] {-} equalish(add(A,B),add(B,A)).
% 0.12/0.35
% 0.12/0.35 ======= end of input processing =======
% 0.12/0.37
% 0.12/0.37 Model 1 (0.00 seconds, 0 Inserts)
% 0.12/0.37
% 0.12/0.37 Stopped by limit on number of solutions
% 0.12/0.37
% 0.12/0.37
% 0.12/0.37 -------------- Softie stats --------------
% 0.12/0.37
% 0.12/0.37 UPDATE_STOP: 300
% 0.12/0.37 SFINDER_TIME_LIMIT: 2
% 0.12/0.37 SHORT_CLAUSE_CUTOFF: 4
% 0.12/0.37 number of clauses in intial UL: 6
% 0.12/0.37 number of clauses initially in problem: 14
% 0.12/0.37 percentage of clauses intially in UL: 42
% 0.12/0.37 percentage of distinct symbols occuring in initial UL: 100
% 0.12/0.37 percent of all initial clauses that are short: 100
% 0.12/0.37 absolute distinct symbol count: 6
% 0.12/0.37 distinct predicate count: 1
% 0.12/0.37 distinct function count: 2
% 0.12/0.37 distinct constant count: 3
% 0.12/0.37
% 0.12/0.37 ---------- no more Softie stats ----------
% 0.12/0.37
% 0.12/0.37
% 0.12/0.37
% 0.12/0.37 =========== start of search ===========
% 1.40/1.63
% 1.40/1.63 -------- PROOF --------
% 1.40/1.63 % SZS status Unsatisfiable
% 1.40/1.63 % SZS output start Refutation
% 1.40/1.63
% 1.40/1.63 Model 2 (0.00 seconds, 0 Inserts)
% 1.40/1.63
% 1.40/1.63 Stopped by limit on number of solutions
% 1.40/1.63
% 1.40/1.63 ----> UNIT CONFLICT at 1.25 sec ----> 30 [binary,29.1,20.1] {+} $F.
% 1.40/1.63
% 1.40/1.63 Length of proof is 3. Level of proof is 2.
% 1.40/1.63
% 1.40/1.63 ---------------- PROOF ----------------
% 1.40/1.63 % SZS status Unsatisfiable
% 1.40/1.63 % SZS output start Refutation
% 1.40/1.63
% 1.40/1.63 4 [] {+} -equalish(A,B)| -equalish(C,subtract(A,D))|equalish(C,subtract(B,D)).
% 1.40/1.63 6 [] {+} -equalish(add(a,subtract(b,c)),add(subtract(a,c),b)).
% 1.40/1.63 7 [] {+} equalish(A,A).
% 1.40/1.63 8 [] {+} equalish(add(A,B),add(B,A)).
% 1.40/1.63 14 [] {-} equalish(add(subtract(A,B),C),subtract(add(A,C),B)).
% 1.40/1.63 16,15 [copy,14,flip.1] {-} equalish(subtract(add(A,B),C),add(subtract(A,C),B)).
% 1.40/1.63 20 [hyper,8,4,7,demod,16,16] {-} equalish(add(subtract(A,B),C),add(subtract(C,B),A)).
% 1.40/1.63 29 [para_from,8.1.1,6.1.1] {-} -equalish(add(subtract(b,c),a),add(subtract(a,c),b)).
% 1.40/1.63 30 [binary,29.1,20.1] {+} $F.
% 1.40/1.63
% 1.40/1.63 % SZS output end Refutation
% 1.40/1.63 ------------ end of proof -------------
% 1.40/1.63
% 1.40/1.63
% 1.40/1.63 Search stopped by max_proofs option.
% 1.40/1.63
% 1.40/1.63
% 1.40/1.63 Search stopped by max_proofs option.
% 1.40/1.63
% 1.40/1.63 ============ end of search ============
% 1.40/1.63
% 1.40/1.63 ----------- soft-scott stats ----------
% 1.40/1.63
% 1.40/1.63 true clauses given 1 (50.0%)
% 1.40/1.63 false clauses given 1
% 1.40/1.63
% 1.40/1.63 FALSE TRUE
% 1.40/1.63 7 1 0
% 1.40/1.63 11 2 0
% 1.40/1.63 tot: 3 0 (0.0% true)
% 1.40/1.63
% 1.40/1.63
% 1.40/1.63 Model 2 (0.00 seconds, 0 Inserts)
% 1.40/1.63
% 1.40/1.63 That finishes the proof of the theorem.
% 1.40/1.63
% 1.40/1.63 Process 16322 finished Thu Jul 7 22:23:39 2022
%------------------------------------------------------------------------------