TSTP Solution File: PUZ012-1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : PUZ012-1 : TPTP v8.1.0. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n025.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 18:26:58 EDT 2022
% Result : Unsatisfiable 0.46s 0.69s
% Output : Refutation 0.46s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11 % Problem : PUZ012-1 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.10/0.12 % Command : sos-script %s
% 0.12/0.33 % Computer : n025.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 : Sun May 29 03:16:11 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.12/0.34 ----- Otter 3.2, August 2001 -----
% 0.12/0.34 The process was started by sandbox2 on n025.cluster.edu,
% 0.12/0.34 Sun May 29 03:16:11 2022
% 0.12/0.34 The command was "./sos". The process ID is 5207.
% 0.12/0.34
% 0.12/0.34 set(prolog_style_variables).
% 0.12/0.34 set(auto).
% 0.12/0.34 dependent: set(auto1).
% 0.12/0.34 dependent: set(process_input).
% 0.12/0.34 dependent: clear(print_kept).
% 0.12/0.34 dependent: clear(print_new_demod).
% 0.12/0.34 dependent: clear(print_back_demod).
% 0.12/0.34 dependent: clear(print_back_sub).
% 0.12/0.34 dependent: set(control_memory).
% 0.12/0.34 dependent: assign(max_mem, 12000).
% 0.12/0.34 dependent: assign(pick_given_ratio, 4).
% 0.12/0.34 dependent: assign(stats_level, 1).
% 0.12/0.34 dependent: assign(pick_semantic_ratio, 3).
% 0.12/0.34 dependent: assign(sos_limit, 5000).
% 0.12/0.34 dependent: assign(max_weight, 60).
% 0.12/0.34 clear(print_given).
% 0.12/0.34
% 0.12/0.34 list(usable).
% 0.12/0.34
% 0.12/0.34 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=3.
% 0.12/0.34
% 0.12/0.34 This ia a non-Horn set with equality. The strategy will be
% 0.12/0.34 Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.12/0.34 unit deletion, with positive clauses in sos and nonpositive
% 0.12/0.34 clauses in usable.
% 0.12/0.34
% 0.12/0.34 dependent: set(knuth_bendix).
% 0.12/0.34 dependent: set(para_from).
% 0.12/0.34 dependent: set(para_into).
% 0.12/0.34 dependent: clear(para_from_right).
% 0.12/0.34 dependent: clear(para_into_right).
% 0.12/0.34 dependent: set(para_from_vars).
% 0.12/0.34 dependent: set(eq_units_both_ways).
% 0.12/0.34 dependent: set(dynamic_demod_all).
% 0.12/0.34 dependent: set(dynamic_demod).
% 0.12/0.34 dependent: set(order_eq).
% 0.12/0.34 dependent: set(back_demod).
% 0.12/0.34 dependent: set(lrpo).
% 0.12/0.34 dependent: set(hyper_res).
% 0.12/0.34 dependent: set(unit_deletion).
% 0.12/0.34 dependent: set(factor).
% 0.12/0.34
% 0.12/0.34 ------------> process usable:
% 0.12/0.34
% 0.12/0.34 ------------> process sos:
% 0.12/0.34 Following clause subsumed by 19 during input processing: 0 [copy,19,flip.1] {-} equal_fruits(A,A).
% 0.12/0.34 19 back subsumes 17.
% 0.12/0.34 Following clause subsumed by 20 during input processing: 0 [copy,20,flip.1] {-} equal_boxes(A,A).
% 0.12/0.34 20 back subsumes 18.
% 0.12/0.34
% 0.12/0.34 ======= end of input processing =======
% 0.12/0.38
% 0.12/0.38 Model 1 (0.00 seconds, 0 Inserts)
% 0.12/0.38
% 0.12/0.38 Stopped by limit on number of solutions
% 0.12/0.38
% 0.12/0.38
% 0.12/0.38 -------------- Softie stats --------------
% 0.12/0.38
% 0.12/0.38 UPDATE_STOP: 300
% 0.12/0.38 SFINDER_TIME_LIMIT: 2
% 0.12/0.38 SHORT_CLAUSE_CUTOFF: 4
% 0.12/0.38 number of clauses in intial UL: 10
% 0.12/0.38 number of clauses initially in problem: 18
% 0.12/0.38 percentage of clauses intially in UL: 55
% 0.12/0.38 percentage of distinct symbols occuring in initial UL: 100
% 0.12/0.38 percent of all initial clauses that are short: 100
% 0.12/0.38 absolute distinct symbol count: 10
% 0.12/0.38 distinct predicate count: 4
% 0.12/0.38 distinct function count: 0
% 0.12/0.38 distinct constant count: 6
% 0.12/0.38
% 0.12/0.38 ---------- no more Softie stats ----------
% 0.12/0.38
% 0.12/0.38
% 0.12/0.38
% 0.12/0.38 Model 2 (0.00 seconds, 0 Inserts)
% 0.12/0.38
% 0.12/0.38 Stopped by limit on number of solutions
% 0.12/0.38
% 0.12/0.38 =========== start of search ===========
% 0.46/0.69
% 0.46/0.69 -------- PROOF --------
% 0.46/0.69 % SZS status Unsatisfiable
% 0.46/0.69 % SZS output start Refutation
% 0.46/0.69
% 0.46/0.69 Model 3 (0.00 seconds, 0 Inserts)
% 0.46/0.69
% 0.46/0.69 Stopped by limit on number of solutions
% 0.46/0.69
% 0.46/0.69 Model 4 (0.00 seconds, 0 Inserts)
% 0.46/0.69
% 0.46/0.69 Stopped by limit on number of solutions
% 0.46/0.69
% 0.46/0.69 Model 5 (0.00 seconds, 0 Inserts)
% 0.46/0.69
% 0.46/0.69 Stopped by limit on number of solutions
% 0.46/0.69
% 0.46/0.69 Model 6 (0.00 seconds, 0 Inserts)
% 0.46/0.69
% 0.46/0.69 Stopped by limit on number of solutions
% 0.46/0.69
% 0.46/0.69 Model 7 (0.00 seconds, 0 Inserts)
% 0.46/0.69
% 0.46/0.69 Stopped by limit on number of solutions
% 0.46/0.69
% 0.46/0.69 Stopped by limit on insertions
% 0.46/0.69
% 0.46/0.69 Model 8 [ 1 1 1523 ] (0.00 seconds, 250000 Inserts)
% 0.46/0.69
% 0.46/0.69 ----> UNIT CONFLICT at 0.32 sec ----> 173 [binary,171.1,9.1] {-} $F.
% 0.46/0.69
% 0.46/0.69 Length of proof is 8. Level of proof is 3.
% 0.46/0.69
% 0.46/0.69 ---------------- PROOF ----------------
% 0.46/0.69 % SZS status Unsatisfiable
% 0.46/0.69 % SZS output start Refutation
% 0.46/0.69
% 0.46/0.69 1 [] {+} -label(A,B)| -contains(A,B).
% 0.46/0.69 3 [] {+} -contains(A,B)| -contains(C,B)|equal_boxes(A,C).
% 0.46/0.69 6 [] {-} -equal_boxes(boxb,boxc).
% 0.46/0.69 7 [copy,6,flip.1] {+} -equal_boxes(boxc,boxb).
% 0.46/0.69 8 [] {-} -equal_boxes(boxa,boxc).
% 0.46/0.69 9 [copy,8,flip.1] {+} -equal_boxes(boxc,boxa).
% 0.46/0.69 16 [] {+} -contains(boxa,bananas)| -contains(boxc,oranges).
% 0.46/0.69 21 [] {-} contains(boxa,A)|contains(boxb,A)|contains(boxc,A).
% 0.46/0.69 22 [] {-} contains(A,apples)|contains(A,bananas)|contains(A,oranges).
% 0.46/0.69 23 [] {+} label(boxa,apples).
% 0.46/0.69 24 [] {+} label(boxb,oranges).
% 0.46/0.69 25 [] {+} label(boxc,bananas).
% 0.46/0.69 26 [] {+} contains(boxb,apples).
% 0.46/0.69 44 [hyper,21,1,24] {-} contains(boxa,oranges)|contains(boxc,oranges).
% 0.46/0.69 88 [hyper,22,1,23] {-} contains(boxa,bananas)|contains(boxa,oranges).
% 0.46/0.69 127 [hyper,25,1,22] {-} contains(boxc,apples)|contains(boxc,oranges).
% 0.46/0.69 133 [hyper,88,16,44,factor_simp] {+} contains(boxa,oranges).
% 0.46/0.69 166 [hyper,127,3,26,unit_del,7] {+} contains(boxc,oranges).
% 0.46/0.69 171 [hyper,166,3,133,flip.1] {-} equal_boxes(boxc,boxa).
% 0.46/0.69 173 [binary,171.1,9.1] {-} $F.
% 0.46/0.69
% 0.46/0.69 % SZS output end Refutation
% 0.46/0.69 ------------ end of proof -------------
% 0.46/0.69
% 0.46/0.69
% 0.46/0.69 Search stopped by max_proofs option.
% 0.46/0.69
% 0.46/0.69
% 0.46/0.69 Search stopped by max_proofs option.
% 0.46/0.69
% 0.46/0.69 ============ end of search ============
% 0.46/0.69
% 0.46/0.69 ----------- soft-scott stats ----------
% 0.46/0.69
% 0.46/0.69 true clauses given 2 (14.3%)
% 0.46/0.69 false clauses given 12
% 0.46/0.69
% 0.46/0.69 FALSE TRUE
% 0.46/0.69 3 1 0
% 0.46/0.69 6 1 0
% 0.46/0.69 9 7 22
% 0.46/0.69 12 0 35
% 0.46/0.69 15 13 14
% 0.46/0.69 tot: 22 71 (76.3% true)
% 0.46/0.69
% 0.46/0.69
% 0.46/0.69 Model 8 [ 1 1 1523 ] (0.00 seconds, 250000 Inserts)
% 0.46/0.69
% 0.46/0.69 That finishes the proof of the theorem.
% 0.46/0.69
% 0.46/0.69 Process 5207 finished Sun May 29 03:16:11 2022
%------------------------------------------------------------------------------