TSTP Solution File: HWV005-2 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : HWV005-2 : TPTP v8.1.0. Bugfixed v2.7.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n009.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 19:12:31 EDT 2022
% Result : Unsatisfiable 1.01s 1.21s
% Output : Refutation 1.01s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : HWV005-2 : TPTP v8.1.0. Bugfixed v2.7.0.
% 0.04/0.13 % Command : sos-script %s
% 0.13/0.34 % Computer : n009.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Fri Jun 17 07:57:22 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.20/0.37 ----- Otter 3.2, August 2001 -----
% 0.20/0.37 The process was started by sandbox2 on n009.cluster.edu,
% 0.20/0.37 Fri Jun 17 07:57:23 2022
% 0.20/0.37 The command was "./sos". The process ID is 9928.
% 0.20/0.37
% 0.20/0.37 set(prolog_style_variables).
% 0.20/0.37 set(auto).
% 0.20/0.37 dependent: set(auto1).
% 0.20/0.37 dependent: set(process_input).
% 0.20/0.37 dependent: clear(print_kept).
% 0.20/0.37 dependent: clear(print_new_demod).
% 0.20/0.37 dependent: clear(print_back_demod).
% 0.20/0.37 dependent: clear(print_back_sub).
% 0.20/0.37 dependent: set(control_memory).
% 0.20/0.37 dependent: assign(max_mem, 12000).
% 0.20/0.37 dependent: assign(pick_given_ratio, 4).
% 0.20/0.37 dependent: assign(stats_level, 1).
% 0.20/0.37 dependent: assign(pick_semantic_ratio, 3).
% 0.20/0.37 dependent: assign(sos_limit, 5000).
% 0.20/0.37 dependent: assign(max_weight, 60).
% 0.20/0.37 clear(print_given).
% 0.20/0.37
% 0.20/0.37 list(usable).
% 0.20/0.37
% 0.20/0.37 SCAN INPUT: prop=0, horn=0, equality=0, symmetry=0, max_lits=4.
% 0.20/0.37
% 0.20/0.37 This is a non-Horn set without equality. The strategy
% 0.20/0.37 will be ordered hyper_res, ur_res, unit deletion, and
% 0.20/0.37 factoring, with satellites in sos and nuclei in usable.
% 0.20/0.37
% 0.20/0.37 dependent: set(hyper_res).
% 0.20/0.37 dependent: set(factor).
% 0.20/0.37 dependent: set(unit_deletion).
% 0.20/0.37
% 0.20/0.37 ------------> process usable:
% 0.20/0.37
% 0.20/0.37 ------------> process sos:
% 0.20/0.37
% 0.20/0.37 ======= end of input processing =======
% 0.20/0.40
% 0.20/0.40 Model 1 (0.00 seconds, 0 Inserts)
% 0.20/0.40
% 0.20/0.40 Stopped by limit on number of solutions
% 0.20/0.40
% 0.20/0.40
% 0.20/0.40 -------------- Softie stats --------------
% 0.20/0.40
% 0.20/0.40 UPDATE_STOP: 300
% 0.20/0.40 SFINDER_TIME_LIMIT: 2
% 0.20/0.40 SHORT_CLAUSE_CUTOFF: 4
% 0.20/0.40 number of clauses in intial UL: 43
% 0.20/0.40 number of clauses initially in problem: 48
% 0.20/0.40 percentage of clauses intially in UL: 89
% 0.20/0.40 percentage of distinct symbols occuring in initial UL: 100
% 0.20/0.40 percent of all initial clauses that are short: 100
% 0.20/0.40 absolute distinct symbol count: 21
% 0.20/0.40 distinct predicate count: 11
% 0.20/0.40 distinct function count: 9
% 0.20/0.40 distinct constant count: 1
% 0.20/0.40
% 0.20/0.40 ---------- no more Softie stats ----------
% 0.20/0.40
% 0.20/0.40
% 0.20/0.40
% 0.20/0.40 Model 2 (0.00 seconds, 0 Inserts)
% 0.20/0.40
% 0.20/0.40 Stopped by limit on number of solutions
% 0.20/0.40
% 0.20/0.40 =========== start of search ===========
% 1.01/1.21
% 1.01/1.21 -------- PROOF --------
% 1.01/1.21 % SZS status Unsatisfiable
% 1.01/1.21 % SZS output start Refutation
% 1.01/1.21
% 1.01/1.21 Stopped by limit on insertions
% 1.01/1.21
% 1.01/1.21 Model 3 [ 1 1 260 ] (0.00 seconds, 250000 Inserts)
% 1.01/1.21
% 1.01/1.21 Stopped by limit on insertions
% 1.01/1.21
% 1.01/1.21 Model 4 [ 2 1 338 ] (0.00 seconds, 250000 Inserts)
% 1.01/1.21
% 1.01/1.21 Stopped by limit on insertions
% 1.01/1.21
% 1.01/1.21 Model 5 [ 2 0 262 ] (0.00 seconds, 250000 Inserts)
% 1.01/1.21
% 1.01/1.21 Stopped by limit on insertions
% 1.01/1.21
% 1.01/1.21 Model 6 [ 3 1 787 ] (0.00 seconds, 250000 Inserts)
% 1.01/1.21
% 1.01/1.21 Stopped by limit on insertions
% 1.01/1.21
% 1.01/1.21 Model 7 [ 5 0 102 ] (0.00 seconds, 250000 Inserts)
% 1.01/1.21
% 1.01/1.21 Stopped by limit on insertions
% 1.01/1.21
% 1.01/1.21 Model 8 [ 4 0 430 ] (0.00 seconds, 250000 Inserts)
% 1.01/1.21
% 1.01/1.21 Stopped by limit on insertions
% 1.01/1.21
% 1.01/1.21 Model 9 [ 5 0 1082 ] (0.00 seconds, 250000 Inserts)
% 1.01/1.21
% 1.01/1.21 Stopped by limit on insertions
% 1.01/1.21
% 1.01/1.21 Model 10 [ 4 1 790 ] (0.00 seconds, 250000 Inserts)
% 1.01/1.21
% 1.01/1.21 Stopped by limit on insertions
% 1.01/1.21
% 1.01/1.21 Model 11 [ 7 1 603 ] (0.00 seconds, 250000 Inserts)
% 1.01/1.21
% 1.01/1.21 Stopped by limit on insertions
% 1.01/1.21
% 1.01/1.21 Model 12 [ 6 1 554 ] (0.00 seconds, 250000 Inserts)
% 1.01/1.21
% 1.01/1.21 Stopped by limit on insertions
% 1.01/1.21
% 1.01/1.21 Model 13 [ 7 1 406 ] (0.00 seconds, 250000 Inserts)
% 1.01/1.21
% 1.01/1.21 Stopped by limit on insertions
% 1.01/1.21
% 1.01/1.21 Model 14 [ 9 0 1289 ] (0.00 seconds, 250000 Inserts)
% 1.01/1.21
% 1.01/1.21 Stopped by limit on insertions
% 1.01/1.21
% 1.01/1.21 Model 15 [ 7 0 662 ] (0.00 seconds, 250000 Inserts)
% 1.01/1.21
% 1.01/1.21 Stopped by limit on insertions
% 1.01/1.21
% 1.01/1.21 Model 16 [ 9 1 548 ] (0.00 seconds, 250000 Inserts)
% 1.01/1.21
% 1.01/1.21 Stopped by limit on insertions
% 1.01/1.21
% 1.01/1.21 Model 17 [ 10 1 929 ] (0.00 seconds, 250000 Inserts)
% 1.01/1.21
% 1.01/1.21 Stopped by limit on insertions
% 1.01/1.21
% 1.01/1.21 Model 18 [ 7 0 1310 ] (0.00 seconds, 250000 Inserts)
% 1.01/1.21
% 1.01/1.21 Stopped by limit on insertions
% 1.01/1.21
% 1.01/1.21 Model 19 [ 12 0 535 ] (0.00 seconds, 250000 Inserts)
% 1.01/1.21
% 1.01/1.21 -----> EMPTY CLAUSE at 0.82 sec ----> 83 [hyper,81,5,79] {-} $F.
% 1.01/1.21
% 1.01/1.21 Length of proof is 22. Level of proof is 8.
% 1.01/1.21
% 1.01/1.21 ---------------- PROOF ----------------
% 1.01/1.21 % SZS status Unsatisfiable
% 1.01/1.21 % SZS output start Refutation
% 1.01/1.21
% 1.01/1.21 1 [] {+} -connection(A,B)| -zero(A)|zero(B).
% 1.01/1.21 2 [] {+} -connection(A,B)| -one(A)|one(B).
% 1.01/1.21 3 [] {+} -connection(A,B)| -zero(B)|zero(A).
% 1.01/1.21 5 [] {+} -zero(A)| -one(A).
% 1.01/1.21 9 [] {+} -and_ok(A)| -zero(out1(A))|zero(in1(A))|zero(in2(A)).
% 1.01/1.21 13 [] {+} -logic_and(A)|and_ok(A)|abnormal(A).
% 1.01/1.21 18 [] {+} -or_ok(A)| -zero(out1(A))|zero(in1(A)).
% 1.01/1.21 21 [] {+} -logic_or(A)|or_ok(A)|abnormal(A).
% 1.01/1.21 22 [] {+} -not_ok(A)| -zero(in1(A))|one(out1(A)).
% 1.01/1.21 27 [] {+} -logic_not(A)|not_ok(A)|abnormal(A).
% 1.01/1.21 28 [] {+} -halfadder(A)|logic_and(and1(A)).
% 1.01/1.21 30 [] {+} -halfadder(A)|logic_not(not1(A)).
% 1.01/1.21 31 [] {+} -halfadder(A)|logic_or(or1(A)).
% 1.01/1.21 32 [] {+} -halfadder(A)|connection(in1(A),in1(or1(A))).
% 1.01/1.21 36 [] {+} -halfadder(A)|connection(outs(A),out1(and1(A))).
% 1.01/1.21 37 [] {+} -halfadder(A)|connection(outc(A),out1(and2(A))).
% 1.01/1.21 38 [] {+} -halfadder(A)|connection(out1(or1(A)),in1(and1(A))).
% 1.01/1.21 39 [] {+} -halfadder(A)|connection(out1(and2(A)),in1(not1(A))).
% 1.01/1.21 40 [] {+} -halfadder(A)|connection(out1(not1(A)),in2(and1(A))).
% 1.01/1.21 41 [] {+} -abnormal(and1(h)).
% 1.01/1.21 42 [] {+} -abnormal(not1(h)).
% 1.01/1.21 43 [] {+} -abnormal(or1(h)).
% 1.01/1.21 44 [] {+} halfadder(h).
% 1.01/1.21 45 [] {+} one(in1(h)).
% 1.01/1.21 47 [] {+} zero(outs(h)).
% 1.01/1.21 48 [] {+} zero(outc(h)).
% 1.01/1.21 49 [hyper,44,40] {-} connection(out1(not1(h)),in2(and1(h))).
% 1.01/1.21 50 [hyper,44,39] {+} connection(out1(and2(h)),in1(not1(h))).
% 1.01/1.21 51 [hyper,44,38] {+} connection(out1(or1(h)),in1(and1(h))).
% 1.01/1.21 52 [hyper,44,37] {-} connection(outc(h),out1(and2(h))).
% 1.01/1.21 53 [hyper,44,36] {-} connection(outs(h),out1(and1(h))).
% 1.01/1.21 57 [hyper,44,32] {+} connection(in1(h),in1(or1(h))).
% 1.01/1.21 58 [hyper,44,31] {+} logic_or(or1(h)).
% 1.01/1.21 59 [hyper,44,30] {+} logic_not(not1(h)).
% 1.01/1.21 61 [hyper,44,28] {+} logic_and(and1(h)).
% 1.01/1.21 62 [hyper,58,21,unit_del,43] {+} or_ok(or1(h)).
% 1.01/1.21 63 [hyper,59,27,unit_del,42] {+} not_ok(not1(h)).
% 1.01/1.21 65 [hyper,53,1,47] {+} zero(out1(and1(h))).
% 1.01/1.21 66 [hyper,61,13,unit_del,41] {+} and_ok(and1(h)).
% 1.01/1.21 67 [hyper,52,1,48] {+} zero(out1(and2(h))).
% 1.01/1.21 68 [hyper,50,1,67] {+} zero(in1(not1(h))).
% 1.01/1.21 70 [hyper,66,9,65] {-} zero(in1(and1(h)))|zero(in2(and1(h))).
% 1.01/1.21 71 [hyper,68,22,63] {+} one(out1(not1(h))).
% 1.01/1.21 72 [hyper,71,2,49] {+} one(in2(and1(h))).
% 1.01/1.21 75 [hyper,72,5,70] {+} zero(in1(and1(h))).
% 1.01/1.21 77 [hyper,75,3,51] {+} zero(out1(or1(h))).
% 1.01/1.21 79 [hyper,77,18,62] {+} zero(in1(or1(h))).
% 1.01/1.21 81 [hyper,57,2,45] {+} one(in1(or1(h))).
% 1.01/1.21 83 [hyper,81,5,79] {-} $F.
% 1.01/1.21
% 1.01/1.21 % SZS output end Refutation
% 1.01/1.21 ------------ end of proof -------------
% 1.01/1.21
% 1.01/1.21
% 1.01/1.21 Search stopped by max_proofs option.
% 1.01/1.21
% 1.01/1.21
% 1.01/1.21 Search stopped by max_proofs option.
% 1.01/1.21
% 1.01/1.21 ============ end of search ============
% 1.01/1.21
% 1.01/1.21 ----------- soft-scott stats ----------
% 1.01/1.21
% 1.01/1.21 true clauses given 11 (32.4%)
% 1.01/1.21 false clauses given 23
% 1.01/1.21
% 1.01/1.21 FALSE TRUE
% 1.01/1.21 3 1 0
% 1.01/1.21 6 0 1
% 1.01/1.21 tot: 1 1 (50.0% true)
% 1.01/1.21
% 1.01/1.21
% 1.01/1.21 Model 19 [ 12 0 535 ] (0.00 seconds, 250000 Inserts)
% 1.01/1.21
% 1.01/1.21 That finishes the proof of the theorem.
% 1.01/1.21
% 1.01/1.21 Process 9928 finished Fri Jun 17 07:57:23 2022
%------------------------------------------------------------------------------