%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : HWC001-1 : TPTP v8.1.0. Bugfixed v1.1.1.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n018.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 13:07:36 EDT 2022
% Result : Unsatisfiable 1.25s 1.42s
% Output : Refutation 1.25s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : HWC001-1 : TPTP v8.1.0. Bugfixed v1.1.1.
% 0.07/0.12 % Command : sos-script %s
% 0.13/0.33 % Computer : n018.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Thu Jun 9 12:54:08 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.13/0.35 ----- Otter 3.2, August 2001 -----
% 0.13/0.35 The process was started by sandbox on n018.cluster.edu,
% 0.13/0.35 Thu Jun 9 12:54:08 2022
% 0.13/0.35 The command was "./sos". The process ID is 30115.
% 0.13/0.35
% 0.13/0.35 set(prolog_style_variables).
% 0.13/0.35 set(auto).
% 0.13/0.35 dependent: set(auto1).
% 0.13/0.35 dependent: set(process_input).
% 0.13/0.35 dependent: clear(print_kept).
% 0.13/0.35 dependent: clear(print_new_demod).
% 0.13/0.35 dependent: clear(print_back_demod).
% 0.13/0.35 dependent: clear(print_back_sub).
% 0.13/0.35 dependent: set(control_memory).
% 0.13/0.35 dependent: assign(max_mem, 12000).
% 0.13/0.35 dependent: assign(pick_given_ratio, 4).
% 0.13/0.35 dependent: assign(stats_level, 1).
% 0.13/0.35 dependent: assign(pick_semantic_ratio, 3).
% 0.13/0.35 dependent: assign(sos_limit, 5000).
% 0.13/0.35 dependent: assign(max_weight, 60).
% 0.13/0.35 clear(print_given).
% 0.13/0.35
% 0.13/0.35 list(usable).
% 0.13/0.35
% 0.13/0.35 SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=3.
% 0.13/0.35
% 0.13/0.35 This is a Horn set with equality. The strategy will be
% 0.13/0.35 Knuth-Bendix and hyper_res, with positive clauses in
% 0.13/0.35 sos and nonpositive clauses in usable.
% 0.13/0.35
% 0.13/0.35 dependent: set(knuth_bendix).
% 0.13/0.35 dependent: set(para_from).
% 0.13/0.35 dependent: set(para_into).
% 0.13/0.35 dependent: clear(para_from_right).
% 0.13/0.35 dependent: clear(para_into_right).
% 0.13/0.35 dependent: set(para_from_vars).
% 0.13/0.35 dependent: set(eq_units_both_ways).
% 0.13/0.35 dependent: set(dynamic_demod_all).
% 0.13/0.35 dependent: set(dynamic_demod).
% 0.13/0.35 dependent: set(order_eq).
% 0.13/0.35 dependent: set(back_demod).
% 0.13/0.35 dependent: set(lrpo).
% 0.13/0.35 dependent: set(hyper_res).
% 0.13/0.35 dependent: clear(order_hyper).
% 0.13/0.35
% 0.13/0.35 ------------> process usable:
% 0.13/0.35
% 0.13/0.35 ------------> process sos:
% 0.13/0.35 Following clause subsumed by 16 during input processing: 0 [copy,16,flip.1] {-} A=A.
% 0.13/0.35
% 0.13/0.35 ======= end of input processing =======
% 0.13/0.38
% 0.13/0.38 Model 1 (0.00 seconds, 0 Inserts)
% 0.13/0.38
% 0.13/0.38 Stopped by limit on number of solutions
% 0.13/0.38
% 0.13/0.38
% 0.13/0.38 -------------- Softie stats --------------
% 0.13/0.38
% 0.13/0.38 UPDATE_STOP: 300
% 0.13/0.38 SFINDER_TIME_LIMIT: 2
% 0.13/0.38 SHORT_CLAUSE_CUTOFF: 4
% 0.13/0.38 number of clauses in intial UL: 2
% 0.13/0.38 number of clauses initially in problem: 15
% 0.13/0.38 percentage of clauses intially in UL: 13
% 0.13/0.38 percentage of distinct symbols occuring in initial UL: 57
% 0.13/0.38 percent of all initial clauses that are short: 100
% 0.13/0.38 absolute distinct symbol count: 7
% 0.13/0.38 distinct predicate count: 2
% 0.13/0.38 distinct function count: 3
% 0.13/0.38 distinct constant count: 2
% 0.13/0.38
% 0.13/0.38 ---------- no more Softie stats ----------
% 0.13/0.38
% 0.13/0.38
% 0.13/0.38
% 0.13/0.38 Model 2 (0.00 seconds, 0 Inserts)
% 0.13/0.38
% 0.13/0.38 Stopped by limit on number of solutions
% 0.13/0.38
% 0.13/0.38 =========== start of search ===========
% 1.25/1.42
% 1.25/1.42 -------- PROOF --------
% 1.25/1.42 % SZS status Unsatisfiable
% 1.25/1.42 % SZS output start Refutation
% 1.25/1.42
% 1.25/1.42 Model 3 (0.00 seconds, 0 Inserts)
% 1.25/1.42
% 1.25/1.42 Stopped by limit on number of solutions
% 1.25/1.42
% 1.25/1.42 Model 4 (0.00 seconds, 0 Inserts)
% 1.25/1.42
% 1.25/1.42 Stopped by limit on number of solutions
% 1.25/1.42
% 1.25/1.42 Model 5 (0.00 seconds, 0 Inserts)
% 1.25/1.42
% 1.25/1.42 Stopped by limit on number of solutions
% 1.25/1.42
% 1.25/1.42 Stopped by limit on insertions
% 1.25/1.42
% 1.25/1.42 Model 6 [ 2 1 3093 ] (0.00 seconds, 250000 Inserts)
% 1.25/1.42
% 1.25/1.42 Stopped by limit on insertions
% 1.25/1.42
% 1.25/1.42 Model 7 [ 1 0 347 ] (0.00 seconds, 250000 Inserts)
% 1.25/1.42
% 1.25/1.42 Stopped by limit on insertions
% 1.25/1.42
% 1.25/1.42 Model 8 [ 2 1 367 ] (0.00 seconds, 250000 Inserts)
% 1.25/1.42
% 1.25/1.42 Stopped by limit on insertions
% 1.25/1.42
% 1.25/1.42 Model 9 [ 1 1 632 ] (0.00 seconds, 250000 Inserts)
% 1.25/1.42
% 1.25/1.42 Stopped by limit on insertions
% 1.25/1.42
% 1.25/1.42 Model 10 [ 4 0 1175 ] (0.00 seconds, 250000 Inserts)
% 1.25/1.42
% 1.25/1.42 Stopped by limit on insertions
% 1.25/1.42
% 1.25/1.42 Model 11 [ 4 1 2656 ] (0.00 seconds, 250000 Inserts)
% 1.25/1.42
% 1.25/1.42 Stopped by limit on insertions
% 1.25/1.42
% 1.25/1.42 Model 12 [ 5 1 495 ] (0.00 seconds, 250000 Inserts)
% 1.25/1.42
% 1.25/1.42 Stopped by limit on insertions
% 1.25/1.42
% 1.25/1.42 Model 13 [ 2 1 13250 ] (0.00 seconds, 250000 Inserts)
% 1.25/1.42
% 1.25/1.42 Stopped by limit on insertions
% 1.25/1.42
% 1.25/1.42 Model 14 [ 3 1 2498 ] (0.00 seconds, 250000 Inserts)
% 1.25/1.42
% 1.25/1.42 ----> UNIT CONFLICT at 1.05 sec ----> 45 [binary,44.1,2.1] {-} $F.
% 1.25/1.42
% 1.25/1.42 Length of proof is 8. Level of proof is 5.
% 1.25/1.42
% 1.25/1.42 ---------------- PROOF ----------------
% 1.25/1.42 % SZS status Unsatisfiable
% 1.25/1.42 % SZS output start Refutation
% 1.25/1.42
% 1.25/1.42 1 [] {+} -output(A,B,C,D)| -output(E,F,G,H)|output(nand(A,E),nand(B,F),nand(C,G),nand(D,H)).
% 1.25/1.42 2 [] {+} -output(n0,n1,n1,n1).
% 1.25/1.42 3 [] {-} nand(A,B)=not(and(A,B)).
% 1.25/1.42 4 [copy,3,flip.1] {+} not(and(A,B))=nand(A,B).
% 1.25/1.42 6 [] {+} and(A,n0)=n0.
% 1.25/1.42 8 [] {+} and(A,n1)=A.
% 1.25/1.42 11,10 [] {+} not(n0)=n1.
% 1.25/1.42 12 [] {+} not(n1)=n0.
% 1.25/1.42 14 [] {+} output(n0,n0,n1,n1).
% 1.25/1.42 15 [] {+} output(n0,n1,n0,n1).
% 1.25/1.42 18,17 [para_from,6.1.1,4.1.1.1,demod,11,flip.1] {+} nand(A,n0)=n1.
% 1.25/1.42 20,19 [para_from,8.1.1,4.1.1.1] {+} not(A)=nand(A,n1).
% 1.25/1.42 22,21 [back_demod,12,demod,20] {+} nand(n1,n1)=n0.
% 1.25/1.42 24,23 [back_demod,10,demod,20] {+} nand(n0,n1)=n1.
% 1.25/1.42 27 [hyper,14,1,14,demod,18,18,22,22] {+} output(n1,n1,n0,n0).
% 1.25/1.42 32 [hyper,15,1,15,demod,18,22,18,22] {+} output(n1,n0,n1,n0).
% 1.25/1.42 44 [hyper,27,1,32,demod,22,24,18,18] {-} output(n0,n1,n1,n1).
% 1.25/1.42 45 [binary,44.1,2.1] {-} $F.
% 1.25/1.42
% 1.25/1.42 % SZS output end Refutation
% 1.25/1.42 ------------ end of proof -------------
% 1.25/1.42
% 1.25/1.42
% 1.25/1.42 Search stopped by max_proofs option.
% 1.25/1.42
% 1.25/1.42
% 1.25/1.42 Search stopped by max_proofs option.
% 1.25/1.42
% 1.25/1.42 ============ end of search ============
% 1.25/1.42
% 1.25/1.42 ----------- soft-scott stats ----------
% 1.25/1.42
% 1.25/1.42 true clauses given 1 (7.1%)
% 1.25/1.42 false clauses given 13
% 1.25/1.42
% 1.25/1.42 FALSE TRUE
% 1.25/1.42 5 1 2
% 1.25/1.42 9 0 1
% 1.25/1.42 21 3 9
% 1.25/1.42 tot: 4 12 (75.0% true)
% 1.25/1.42
% 1.25/1.42
% 1.25/1.42 Model 14 [ 3 1 2498 ] (0.00 seconds, 250000 Inserts)
% 1.25/1.42
% 1.25/1.42 That finishes the proof of the theorem.
% 1.25/1.42
% 1.25/1.42 Process 30115 finished Thu Jun 9 12:54:09 2022
%------------------------------------------------------------------------------