TSTP Solution File: LCL166-1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : LCL166-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 : Sun Jul 17 14:28:17 EDT 2022
% Result : Unsatisfiable 57.32s 57.55s
% Output : Refutation 57.32s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : LCL166-1 : TPTP v8.1.0. Released v1.0.0.
% 0.10/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 : Sat Jul 2 13:01: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 sandbox on n008.cluster.edu,
% 0.12/0.35 Sat Jul 2 13:01:08 2022
% 0.12/0.35 The command was "./sos". The process ID is 16263.
% 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=3.
% 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.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: 2
% 0.12/0.37 number of clauses initially in problem: 3
% 0.12/0.37 percentage of clauses intially in UL: 66
% 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: 5
% 0.12/0.37 distinct predicate count: 1
% 0.12/0.37 distinct function count: 1
% 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 ===========
% 40.64/40.85
% 40.64/40.85
% 40.64/40.85 Changing weight limit from 60 to 56.
% 40.64/40.85
% 40.64/40.85 Model 2 [ 1 420 222331 ] (0.00 seconds, 225172 Inserts)
% 40.64/40.85
% 40.64/40.85 Model 3 [ 1 421 222661 ] (0.00 seconds, 225136 Inserts)
% 40.64/40.85
% 40.64/40.85 Model 4 [ 2 1 566 ] (0.00 seconds, 221591 Inserts)
% 40.64/40.85
% 40.64/40.85 Resetting weight limit to 56 after 110 givens.
% 40.64/40.85
% 41.73/41.96
% 41.73/41.96
% 41.73/41.96 Changing weight limit from 56 to 52.
% 41.73/41.96
% 41.73/41.96 Resetting weight limit to 52 after 120 givens.
% 41.73/41.96
% 42.74/42.93
% 42.74/42.93
% 42.74/42.93 Changing weight limit from 52 to 48.
% 42.74/42.93
% 42.74/42.93 Resetting weight limit to 48 after 125 givens.
% 42.74/42.93
% 43.14/43.32
% 43.14/43.32
% 43.14/43.32 Changing weight limit from 48 to 44.
% 43.14/43.32
% 43.14/43.32 Resetting weight limit to 44 after 130 givens.
% 43.14/43.32
% 44.65/44.88
% 44.65/44.88
% 44.65/44.88 Changing weight limit from 44 to 40.
% 44.65/44.88
% 44.65/44.88 Resetting weight limit to 40 after 150 givens.
% 44.65/44.88
% 46.63/46.88
% 46.63/46.88
% 46.63/46.88 Changing weight limit from 40 to 36.
% 46.63/46.88
% 46.63/46.88 Resetting weight limit to 36 after 190 givens.
% 46.63/46.88
% 47.22/47.42
% 47.22/47.42
% 47.22/47.42 Changing weight limit from 36 to 32.
% 47.22/47.42
% 47.22/47.42 Resetting weight limit to 32 after 210 givens.
% 47.22/47.42
% 47.34/47.57
% 47.34/47.57
% 47.34/47.57 Changing weight limit from 32 to 28.
% 47.34/47.57
% 47.34/47.57 Resetting weight limit to 28 after 220 givens.
% 47.34/47.57
% 56.42/56.68
% 56.42/56.68
% 56.42/56.68 Changing weight limit from 28 to 24.
% 56.42/56.68
% 56.42/56.68 Model 5 [ 3 1 201 ] (0.00 seconds, 218595 Inserts)
% 56.42/56.68
% 56.42/56.68 Resetting weight limit to 24 after 285 givens.
% 56.42/56.68
% 56.81/57.04
% 56.81/57.04
% 56.81/57.04 Changing weight limit from 24 to 20.
% 56.81/57.04
% 56.81/57.04 Resetting weight limit to 20 after 315 givens.
% 56.81/57.04
% 57.32/57.55
% 57.32/57.55 -- HEY sandbox, WE HAVE A PROOF!! --
% 57.32/57.55
% 57.32/57.55 Modelling stopped after 300 given clauses and 0.00 seconds
% 57.32/57.55
% 57.32/57.55
% 57.32/57.55 ----> UNIT CONFLICT at 57.11 sec ----> 19599 [binary,19598.1,2.1] {-} $F.
% 57.32/57.55
% 57.32/57.55 Length of proof is 39. Level of proof is 21.
% 57.32/57.55
% 57.32/57.55 ---------------- PROOF ----------------
% 57.32/57.55 % SZS status Unsatisfiable
% 57.32/57.55 % SZS output start Refutation
% 57.32/57.55
% 57.32/57.55 1 [] {+} -is_a_theorem(equivalent(A,B))| -is_a_theorem(A)|is_a_theorem(B).
% 57.32/57.55 2 [] {+} -is_a_theorem(equivalent(equivalent(equivalent(a,b),c),equivalent(b,equivalent(c,a)))).
% 57.32/57.55 3 [] {-} is_a_theorem(equivalent(A,equivalent(equivalent(B,C),equivalent(equivalent(C,A),B)))).
% 57.32/57.55 4 [hyper,3,1,3] {-} is_a_theorem(equivalent(equivalent(A,B),equivalent(equivalent(B,equivalent(C,equivalent(equivalent(D,E),equivalent(equivalent(E,C),D)))),A))).
% 57.32/57.55 5 [hyper,4,1,4] {-} is_a_theorem(equivalent(equivalent(equivalent(equivalent(A,equivalent(B,equivalent(equivalent(C,D),equivalent(equivalent(D,B),C)))),E),equivalent(F,equivalent(equivalent(G,H),equivalent(equivalent(H,F),G)))),equivalent(E,A))).
% 57.32/57.55 6 [hyper,4,1,3] {-} is_a_theorem(equivalent(equivalent(A,B),equivalent(equivalent(B,equivalent(equivalent(C,D),equivalent(equivalent(D,equivalent(E,equivalent(equivalent(F,G),equivalent(equivalent(G,E),F)))),C))),A))).
% 57.32/57.55 7 [hyper,4,1,3] {-} is_a_theorem(equivalent(equivalent(equivalent(equivalent(A,B),equivalent(equivalent(B,C),A)),equivalent(D,equivalent(equivalent(E,F),equivalent(equivalent(F,D),E)))),C)).
% 57.32/57.55 8 [hyper,7,1,4] {-} is_a_theorem(equivalent(equivalent(A,equivalent(B,equivalent(equivalent(C,D),equivalent(equivalent(D,B),C)))),equivalent(equivalent(equivalent(E,F),equivalent(equivalent(F,A),E)),equivalent(G,equivalent(equivalent(H,I),equivalent(equivalent(I,G),H)))))).
% 57.32/57.55 9 [hyper,7,1,3] {-} is_a_theorem(equivalent(equivalent(A,B),equivalent(equivalent(B,equivalent(equivalent(equivalent(equivalent(C,D),equivalent(equivalent(D,E),C)),equivalent(F,equivalent(equivalent(G,H),equivalent(equivalent(H,F),G)))),E)),A))).
% 57.32/57.55 10 [hyper,6,1,6] {-} is_a_theorem(equivalent(equivalent(equivalent(equivalent(A,equivalent(equivalent(B,C),equivalent(equivalent(C,equivalent(D,equivalent(equivalent(E,F),equivalent(equivalent(F,D),E)))),B))),G),equivalent(equivalent(H,I),equivalent(equivalent(I,equivalent(J,equivalent(equivalent(K,L),equivalent(equivalent(L,J),K)))),H))),equivalent(G,A))).
% 57.32/57.55 20 [hyper,5,1,7] {-} is_a_theorem(equivalent(equivalent(A,equivalent(equivalent(B,C),equivalent(equivalent(C,A),B))),equivalent(equivalent(equivalent(D,E),equivalent(equivalent(E,equivalent(F,equivalent(G,equivalent(equivalent(H,I),equivalent(equivalent(I,G),H))))),D)),F))).
% 57.32/57.55 53 [hyper,9,1,3] {-} is_a_theorem(equivalent(equivalent(equivalent(equivalent(A,B),equivalent(equivalent(B,C),A)),equivalent(equivalent(equivalent(equivalent(D,E),equivalent(equivalent(E,F),D)),equivalent(G,equivalent(equivalent(H,I),equivalent(equivalent(I,G),H)))),F)),C)).
% 57.32/57.55 77 [hyper,10,1,7] {-} is_a_theorem(equivalent(equivalent(equivalent(A,B),equivalent(equivalent(B,equivalent(C,equivalent(equivalent(D,E),equivalent(equivalent(E,equivalent(F,equivalent(equivalent(G,H),equivalent(equivalent(H,F),G)))),D)))),A)),C)).
% 57.32/57.55 101 [hyper,77,1,6] {-} is_a_theorem(equivalent(equivalent(equivalent(equivalent(A,equivalent(equivalent(B,C),equivalent(equivalent(C,A),B))),equivalent(D,equivalent(equivalent(E,F),equivalent(equivalent(F,D),E)))),G),G)).
% 57.32/57.55 115 [hyper,101,1,5] {-} is_a_theorem(equivalent(equivalent(equivalent(A,B),equivalent(equivalent(B,equivalent(C,equivalent(D,equivalent(equivalent(E,F),equivalent(equivalent(F,D),E))))),A)),C)).
% 57.32/57.55 117 [hyper,101,1,3] {-} is_a_theorem(equivalent(equivalent(A,B),equivalent(equivalent(B,equivalent(equivalent(C,equivalent(equivalent(D,E),equivalent(equivalent(E,C),D))),equivalent(F,equivalent(equivalent(G,H),equivalent(equivalent(H,F),G))))),A))).
% 57.32/57.55 125 [hyper,115,1,4] {-} is_a_theorem(equivalent(equivalent(A,equivalent(B,equivalent(equivalent(C,D),equivalent(equivalent(D,B),C)))),equivalent(equivalent(E,F),equivalent(equivalent(F,equivalent(A,equivalent(G,equivalent(equivalent(H,I),equivalent(equivalent(I,G),H))))),E)))).
% 57.32/57.55 126 [hyper,115,1,3] {-} is_a_theorem(equivalent(equivalent(A,B),equivalent(equivalent(B,equivalent(equivalent(equivalent(C,D),equivalent(equivalent(D,equivalent(E,equivalent(F,equivalent(equivalent(G,H),equivalent(equivalent(H,F),G))))),C)),E)),A))).
% 57.32/57.55 180 [hyper,117,1,3] {-} is_a_theorem(equivalent(equivalent(equivalent(equivalent(A,B),equivalent(equivalent(B,C),A)),equivalent(equivalent(D,equivalent(equivalent(E,F),equivalent(equivalent(F,D),E))),equivalent(G,equivalent(equivalent(H,I),equivalent(equivalent(I,G),H))))),C)).
% 57.32/57.55 209 [hyper,126,1,3] {-} is_a_theorem(equivalent(equivalent(equivalent(equivalent(A,B),equivalent(equivalent(B,C),A)),equivalent(equivalent(equivalent(D,E),equivalent(equivalent(E,equivalent(F,equivalent(G,equivalent(equivalent(H,I),equivalent(equivalent(I,G),H))))),D)),F)),C)).
% 57.32/57.55 274 [hyper,20,1,115] {-} is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(A,B),equivalent(equivalent(B,C),A)),D),C),equivalent(D,equivalent(E,equivalent(equivalent(F,G),equivalent(equivalent(G,E),F)))))).
% 57.32/57.55 294 [hyper,274,1,115] {-} is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(A,B),C),equivalent(B,equivalent(D,equivalent(equivalent(E,F),equivalent(equivalent(F,D),E))))),equivalent(C,A)),equivalent(G,equivalent(equivalent(H,I),equivalent(equivalent(I,G),H))))).
% 57.32/57.55 693 [hyper,209,1,7] {-} is_a_theorem(equivalent(equivalent(A,equivalent(equivalent(A,B),equivalent(C,equivalent(equivalent(D,E),equivalent(equivalent(E,C),D))))),equivalent(B,equivalent(F,equivalent(equivalent(G,H),equivalent(equivalent(H,F),G)))))).
% 57.32/57.55 770 [hyper,693,1,8] {-} is_a_theorem(equivalent(equivalent(equivalent(equivalent(A,equivalent(equivalent(B,C),equivalent(equivalent(C,A),B))),D),D),equivalent(E,equivalent(equivalent(F,G),equivalent(equivalent(G,E),F))))).
% 57.32/57.55 778 [hyper,770,1,125] {-} is_a_theorem(equivalent(equivalent(A,B),equivalent(equivalent(B,equivalent(equivalent(equivalent(equivalent(C,equivalent(equivalent(D,E),equivalent(equivalent(E,C),D))),F),F),equivalent(G,equivalent(equivalent(H,I),equivalent(equivalent(I,G),H))))),A))).
% 57.32/57.55 926 [hyper,294,1,274] {-} is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(A,B),equivalent(equivalent(B,equivalent(C,D)),A)),C),D),equivalent(E,equivalent(equivalent(F,G),equivalent(equivalent(G,E),F))))).
% 57.32/57.55 1200 [hyper,778,1,115] {-} is_a_theorem(equivalent(equivalent(equivalent(A,equivalent(equivalent(B,C),equivalent(equivalent(C,A),B))),D),D)).
% 57.32/57.55 1248 [hyper,1200,1,209] {-} is_a_theorem(equivalent(equivalent(equivalent(equivalent(A,B),C),equivalent(B,equivalent(D,equivalent(equivalent(E,F),equivalent(equivalent(F,D),E))))),equivalent(C,A))).
% 57.32/57.55 1289 [hyper,1248,1,53] {-} is_a_theorem(equivalent(equivalent(equivalent(A,equivalent(equivalent(B,C),equivalent(equivalent(C,A),B))),D),equivalent(equivalent(E,F),equivalent(equivalent(F,D),E)))).
% 57.32/57.55 1314 [hyper,1248,1,693] {-} is_a_theorem(equivalent(equivalent(equivalent(equivalent(A,B),B),equivalent(C,equivalent(equivalent(D,E),equivalent(equivalent(E,C),D)))),A)).
% 57.32/57.55 1329 [hyper,1248,1,4] {-} is_a_theorem(equivalent(equivalent(equivalent(equivalent(A,B),equivalent(equivalent(B,equivalent(C,D)),A)),C),D)).
% 57.32/57.55 1390 [hyper,1329,1,180] {-} is_a_theorem(equivalent(equivalent(A,equivalent(equivalent(equivalent(equivalent(B,C),equivalent(equivalent(C,D),B)),equivalent(E,A)),D)),E)).
% 57.32/57.55 1461 [hyper,1314,1,926] {-} is_a_theorem(equivalent(equivalent(A,B),equivalent(equivalent(B,equivalent(C,C)),A))).
% 57.32/57.55 1463 [hyper,1461,1,1461] {-} is_a_theorem(equivalent(equivalent(equivalent(equivalent(A,equivalent(B,B)),C),equivalent(D,D)),equivalent(C,A))).
% 57.32/57.55 1465 [hyper,1461,1,1200] {-} is_a_theorem(equivalent(equivalent(equivalent(equivalent(A,B),equivalent(equivalent(B,C),A)),equivalent(D,D)),C)).
% 57.32/57.55 1759 [hyper,1463,1,1329] {-} is_a_theorem(equivalent(A,equivalent(equivalent(B,equivalent(A,equivalent(C,C))),B))).
% 57.32/57.55 1989 [hyper,1465,1,1248] {+} is_a_theorem(equivalent(equivalent(A,equivalent(B,A)),B)).
% 57.32/57.55 2034 [hyper,1989,1,1759] {+} is_a_theorem(equivalent(A,equivalent(A,equivalent(B,B)))).
% 57.32/57.55 8814 [hyper,1289,1,1989] {-} is_a_theorem(equivalent(equivalent(equivalent(A,B),equivalent(equivalent(B,C),A)),C)).
% 57.32/57.55 8843 [hyper,8814,1,2034] {-} is_a_theorem(equivalent(equivalent(equivalent(equivalent(A,B),equivalent(equivalent(B,C),A)),C),equivalent(D,D))).
% 57.32/57.55 11046 [hyper,8843,1,1248] {-} is_a_theorem(equivalent(A,equivalent(equivalent(equivalent(B,C),equivalent(equivalent(C,equivalent(D,A)),B)),D))).
% 57.32/57.55 19598 [hyper,11046,1,1390] {-} is_a_theorem(equivalent(equivalent(equivalent(A,B),C),equivalent(B,equivalent(C,A)))).
% 57.32/57.55 19599 [binary,19598.1,2.1] {-} $F.
% 57.32/57.55
% 57.32/57.55 % SZS output end Refutation
% 57.32/57.55 ------------ end of proof -------------
% 57.32/57.55
% 57.32/57.55
% 57.32/57.55 Search stopped by max_proofs option.
% 57.32/57.55
% 57.32/57.55
% 57.32/57.55 Search stopped by max_proofs option.
% 57.32/57.55
% 57.32/57.55 ============ end of search ============
% 57.32/57.55
% 57.32/57.55 ----------- soft-scott stats ----------
% 57.32/57.55
% 57.32/57.55 true clauses given 43 (9.2%)
% 57.32/57.55 false clauses given 422
% 57.32/57.55
% 57.32/57.55 FALSE TRUE
% 57.32/57.55 16 702 153
% 57.32/57.55 20 1798 551
% 57.32/57.55 tot: 2500 704 (22.0% true)
% 57.32/57.55
% 57.32/57.55
% 57.32/57.55 Model 5 [ 3 1 201 ] (0.00 seconds, 218595 Inserts)
% 57.32/57.55
% 57.32/57.55 That finishes the proof of the theorem.
% 57.32/57.55
% 57.32/57.55 Process 16263 finished Sat Jul 2 13:02:05 2022
%------------------------------------------------------------------------------