TSTP Solution File: LAT005-2 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : LAT005-2 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n004.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 : Sun Jul 17 06:45:12 EDT 2022
% Result : Unsatisfiable 0.80s 1.04s
% Output : Refutation 0.80s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : LAT005-2 : TPTP v8.1.0. Released v1.0.0.
% 0.07/0.12 % Command : sos-script %s
% 0.12/0.33 % Computer : n004.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 Jun 30 11:18:08 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 sandbox2 on n004.cluster.edu,
% 0.12/0.35 Thu Jun 30 11:18:08 2022
% 0.12/0.35 The command was "./sos". The process ID is 20116.
% 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=0, symmetry=0, max_lits=5.
% 0.12/0.35
% 0.12/0.35 This is a Horn set without equality. The strategy will
% 0.12/0.35 be hyperresolution, with satellites in sos and nuclei
% 0.12/0.35 in usable.
% 0.12/0.35
% 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
% 0.12/0.35 ======= end of input processing =======
% 0.17/0.41
% 0.17/0.41 Model 1 (0.00 seconds, 0 Inserts)
% 0.17/0.41
% 0.17/0.41 Stopped by limit on number of solutions
% 0.17/0.41
% 0.17/0.41
% 0.17/0.41 -------------- Softie stats --------------
% 0.17/0.41
% 0.17/0.41 UPDATE_STOP: 300
% 0.17/0.41 SFINDER_TIME_LIMIT: 2
% 0.17/0.41 SHORT_CLAUSE_CUTOFF: 4
% 0.17/0.41 number of clauses in intial UL: 11
% 0.17/0.41 number of clauses initially in problem: 31
% 0.17/0.41 percentage of clauses intially in UL: 35
% 0.17/0.41 percentage of distinct symbols occuring in initial UL: 35
% 0.17/0.41 percent of all initial clauses that are short: 100
% 0.17/0.41 absolute distinct symbol count: 14
% 0.17/0.41 distinct predicate count: 2
% 0.17/0.41 distinct function count: 0
% 0.17/0.41 distinct constant count: 12
% 0.17/0.41
% 0.17/0.41 ---------- no more Softie stats ----------
% 0.17/0.41
% 0.17/0.41
% 0.17/0.41
% 0.17/0.41 Model 2 (0.00 seconds, 0 Inserts)
% 0.17/0.41
% 0.17/0.41 Stopped by limit on number of solutions
% 0.17/0.41
% 0.17/0.41 =========== start of search ===========
% 0.80/1.04
% 0.80/1.04 -------- PROOF --------
% 0.80/1.04 % SZS status Unsatisfiable
% 0.80/1.04 % SZS output start Refutation
% 0.80/1.04
% 0.80/1.04 Model 3 (0.00 seconds, 0 Inserts)
% 0.80/1.04
% 0.80/1.04 Stopped by limit on number of solutions
% 0.80/1.04
% 0.80/1.04 Model 4 (0.00 seconds, 0 Inserts)
% 0.80/1.04
% 0.80/1.04 Stopped by limit on number of solutions
% 0.80/1.04
% 0.80/1.04 Model 5 (0.00 seconds, 0 Inserts)
% 0.80/1.04
% 0.80/1.04 Stopped by limit on number of solutions
% 0.80/1.04
% 0.80/1.04 Model 6 (0.00 seconds, 0 Inserts)
% 0.80/1.04
% 0.80/1.04 Stopped by limit on number of solutions
% 0.80/1.04
% 0.80/1.04 Model 7 (0.00 seconds, 0 Inserts)
% 0.80/1.04
% 0.80/1.04 Stopped by limit on number of solutions
% 0.80/1.04
% 0.80/1.04 Model 8 (0.00 seconds, 0 Inserts)
% 0.80/1.04
% 0.80/1.04 Stopped by limit on number of solutions
% 0.80/1.04
% 0.80/1.04 Model 9 (0.00 seconds, 0 Inserts)
% 0.80/1.04
% 0.80/1.04 Stopped by limit on number of solutions
% 0.80/1.04
% 0.80/1.04 Model 10 (0.00 seconds, 0 Inserts)
% 0.80/1.04
% 0.80/1.04 Stopped by limit on number of solutions
% 0.80/1.04
% 0.80/1.04 Model 11 (0.00 seconds, 0 Inserts)
% 0.80/1.04
% 0.80/1.04 Stopped by limit on number of solutions
% 0.80/1.04
% 0.80/1.04 Model 12 (0.00 seconds, 0 Inserts)
% 0.80/1.04
% 0.80/1.04 Stopped by limit on number of solutions
% 0.80/1.04
% 0.80/1.04 Model 13 [ 1 1 901 ] (0.00 seconds, 4674 Inserts)
% 0.80/1.04
% 0.80/1.04 Model 14 [ 1 1 537 ] (0.00 seconds, 4717 Inserts)
% 0.80/1.04
% 0.80/1.04 Model 15 [ 1 2 561 ] (0.00 seconds, 4159 Inserts)
% 0.80/1.04
% 0.80/1.04 Model 16 [ 1 1 174 ] (0.00 seconds, 4575 Inserts)
% 0.80/1.04
% 0.80/1.04 Model 17 [ 1 1 149 ] (0.00 seconds, 4479 Inserts)
% 0.80/1.04
% 0.80/1.04 Model 18 [ 1 2 671 ] (0.00 seconds, 4988 Inserts)
% 0.80/1.04
% 0.80/1.04 Model 19 [ 2 2 168 ] (0.00 seconds, 10714 Inserts)
% 0.80/1.04
% 0.80/1.04 Model 20 [ 2 1 104 ] (0.00 seconds, 10560 Inserts)
% 0.80/1.04
% 0.80/1.04 Model 21 [ 2 1 118 ] (0.00 seconds, 10526 Inserts)
% 0.80/1.04
% 0.80/1.04 Model 22 [ 2 2 6481 ] (0.00 seconds, 16870 Inserts)
% 0.80/1.04
% 0.80/1.04 Model 23 [ 2 1 326 ] (0.00 seconds, 10682 Inserts)
% 0.80/1.04
% 0.80/1.04 Model 24 [ 2 2 7185 ] (0.00 seconds, 17172 Inserts)
% 0.80/1.04
% 0.80/1.04 Model 25 [ 3 2 179 ] (0.00 seconds, 18816 Inserts)
% 0.80/1.04
% 0.80/1.04 Model 26 [ 3 1 210 ] (0.00 seconds, 17480 Inserts)
% 0.80/1.04
% 0.80/1.04 Model 27 [ 3 1 2164 ] (0.00 seconds, 16474 Inserts)
% 0.80/1.04
% 0.80/1.04 Model 28 [ 3 1 2446 ] (0.00 seconds, 16597 Inserts)
% 0.80/1.04
% 0.80/1.04 Model 29 [ 3 1 159 ] (0.00 seconds, 13382 Inserts)
% 0.80/1.04
% 0.80/1.04 Model 30 [ 3 1 1105 ] (0.00 seconds, 6609 Inserts)
% 0.80/1.04
% 0.80/1.04 Model 31 [ 3 1 1516 ] (0.00 seconds, 5322 Inserts)
% 0.80/1.04
% 0.80/1.04 Model 32 [ 4 1 431 ] (0.00 seconds, 11207 Inserts)
% 0.80/1.04
% 0.80/1.04 Model 33 [ 4 1 4339 ] (0.00 seconds, 14358 Inserts)
% 0.80/1.04
% 0.80/1.04 ----> UNIT CONFLICT at 0.67 sec ----> 166 [binary,165.1,11.1] {-} $F.
% 0.80/1.04
% 0.80/1.04 Length of proof is 15. Level of proof is 6.
% 0.80/1.04
% 0.80/1.04 ---------------- PROOF ----------------
% 0.80/1.04 % SZS status Unsatisfiable
% 0.80/1.04 % SZS output start Refutation
% 0.80/1.04
% 0.80/1.04 1 [] {+} -meet(A,B,C)|meet(B,A,C).
% 0.80/1.04 2 [] {+} -join(A,B,C)|join(B,A,C).
% 0.80/1.04 4 [] {+} -join(A,B,C)|meet(A,C,A).
% 0.80/1.04 5 [] {+} -meet(A,B,C)| -meet(B,D,E)| -meet(A,E,F)|meet(C,D,F).
% 0.80/1.04 6 [] {+} -meet(A,B,C)| -meet(B,D,E)| -meet(C,D,F)|meet(A,E,F).
% 0.80/1.04 10 [] {+} -meet(A,B,A)| -join(A,C,D)| -meet(C,B,E)| -join(A,E,F)|meet(B,D,F).
% 0.80/1.04 11 [] {+} -meet(a2,b2,r1).
% 0.80/1.04 16 [] {+} join(A,n0,A).
% 0.80/1.04 18 [] {+} meet(A,n0,n0).
% 0.80/1.04 19 [] {+} meet(A,A,A).
% 0.80/1.04 22 [] {+} meet(a,b,c).
% 0.80/1.04 24 [] {+} meet(c,r2,n0).
% 0.80/1.04 25 [] {+} meet(r2,b,e).
% 0.80/1.04 26 [] {+} join(a,b,c2).
% 0.80/1.04 28 [] {+} meet(c2,r1,n0).
% 0.80/1.04 29 [] {+} meet(r2,a,d).
% 0.80/1.04 30 [] {+} join(r1,e,a2).
% 0.80/1.04 31 [] {+} join(r1,d,b2).
% 0.80/1.04 37 [hyper,25,1] {+} meet(b,r2,e).
% 0.80/1.04 38 [hyper,28,1] {+} meet(r1,c2,n0).
% 0.80/1.04 39 [hyper,26,4] {+} meet(a,c2,a).
% 0.80/1.04 40 [hyper,26,2] {+} join(b,a,c2).
% 0.80/1.04 41 [hyper,30,4] {+} meet(r1,a2,r1).
% 0.80/1.04 42 [hyper,30,2] {+} join(e,r1,a2).
% 0.80/1.04 62 [hyper,37,6,22,24] {+} meet(a,e,n0).
% 0.80/1.04 84 [hyper,19,5,25,25] {+} meet(e,b,e).
% 0.80/1.04 91 [hyper,39,5,29,29] {+} meet(d,c2,d).
% 0.80/1.04 96 [hyper,40,4] {+} meet(b,c2,b).
% 0.80/1.04 103 [hyper,62,5,29,18] {+} meet(d,e,n0).
% 0.80/1.04 128 [hyper,96,5,84,84] {+} meet(e,c2,e).
% 0.80/1.04 144 [hyper,128,10,42,38,16] {+} meet(c2,a2,e).
% 0.80/1.04 150 [hyper,144,5,91,103] {+} meet(d,a2,n0).
% 0.80/1.04 165 [hyper,150,10,41,31,16] {-} meet(a2,b2,r1).
% 0.80/1.04 166 [binary,165.1,11.1] {-} $F.
% 0.80/1.04
% 0.80/1.04 % SZS output end Refutation
% 0.80/1.04 ------------ end of proof -------------
% 0.80/1.04
% 0.80/1.04
% 0.80/1.04 Search stopped by max_proofs option.
% 0.80/1.04
% 0.80/1.04
% 0.80/1.04 Search stopped by max_proofs option.
% 0.80/1.04
% 0.80/1.04 ============ end of search ============
% 0.80/1.04
% 0.80/1.04 ----------- soft-scott stats ----------
% 0.80/1.04
% 0.80/1.04 true clauses given 103 (76.3%)
% 0.80/1.04 false clauses given 32
% 0.80/1.04
% 0.80/1.04 FALSE TRUE
% 0.80/1.04 4 4 14
% 0.80/1.04 tot: 4 14 (77.8% true)
% 0.80/1.04
% 0.80/1.04
% 0.80/1.04 Model 33 [ 4 1 4339 ] (0.00 seconds, 14358 Inserts)
% 0.80/1.04
% 0.80/1.04 That finishes the proof of the theorem.
% 0.80/1.04
% 0.80/1.04 Process 20116 finished Thu Jun 30 11:18:08 2022
%------------------------------------------------------------------------------