TSTP Solution File: LCL016-1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : LCL016-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n005.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:27:22 EDT 2022
% Result : Unsatisfiable 50.44s 50.64s
% Output : Refutation 50.44s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : LCL016-1 : TPTP v8.1.0. Released v1.0.0.
% 0.07/0.13 % Command : sos-script %s
% 0.12/0.34 % Computer : n005.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Mon Jul 4 19:10:07 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.12/0.36 ----- Otter 3.2, August 2001 -----
% 0.12/0.36 The process was started by sandbox on n005.cluster.edu,
% 0.12/0.36 Mon Jul 4 19:10:07 2022
% 0.12/0.36 The command was "./sos". The process ID is 21932.
% 0.12/0.36
% 0.12/0.36 set(prolog_style_variables).
% 0.12/0.36 set(auto).
% 0.12/0.36 dependent: set(auto1).
% 0.12/0.36 dependent: set(process_input).
% 0.12/0.36 dependent: clear(print_kept).
% 0.12/0.36 dependent: clear(print_new_demod).
% 0.12/0.36 dependent: clear(print_back_demod).
% 0.12/0.36 dependent: clear(print_back_sub).
% 0.12/0.36 dependent: set(control_memory).
% 0.12/0.36 dependent: assign(max_mem, 12000).
% 0.12/0.36 dependent: assign(pick_given_ratio, 4).
% 0.12/0.36 dependent: assign(stats_level, 1).
% 0.12/0.36 dependent: assign(pick_semantic_ratio, 3).
% 0.12/0.36 dependent: assign(sos_limit, 5000).
% 0.12/0.36 dependent: assign(max_weight, 60).
% 0.12/0.36 clear(print_given).
% 0.12/0.36
% 0.12/0.36 list(usable).
% 0.12/0.36
% 0.12/0.36 SCAN INPUT: prop=0, horn=1, equality=0, symmetry=0, max_lits=3.
% 0.12/0.36
% 0.12/0.36 This is a Horn set without equality. The strategy will
% 0.12/0.36 be hyperresolution, with satellites in sos and nuclei
% 0.12/0.36 in usable.
% 0.12/0.36
% 0.12/0.36 dependent: set(hyper_res).
% 0.12/0.36 dependent: clear(order_hyper).
% 0.12/0.36
% 0.12/0.36 ------------> process usable:
% 0.12/0.36
% 0.12/0.36 ------------> process sos:
% 0.12/0.36
% 0.12/0.36 ======= end of input processing =======
% 0.12/0.39
% 0.12/0.39 Model 1 (0.00 seconds, 0 Inserts)
% 0.12/0.39
% 0.12/0.39 Stopped by limit on number of solutions
% 0.12/0.39
% 0.12/0.39
% 0.12/0.39 -------------- Softie stats --------------
% 0.12/0.39
% 0.12/0.39 UPDATE_STOP: 300
% 0.12/0.39 SFINDER_TIME_LIMIT: 2
% 0.12/0.39 SHORT_CLAUSE_CUTOFF: 4
% 0.12/0.39 number of clauses in intial UL: 2
% 0.12/0.39 number of clauses initially in problem: 3
% 0.12/0.39 percentage of clauses intially in UL: 66
% 0.12/0.39 percentage of distinct symbols occuring in initial UL: 100
% 0.12/0.39 percent of all initial clauses that are short: 100
% 0.12/0.39 absolute distinct symbol count: 5
% 0.12/0.39 distinct predicate count: 1
% 0.12/0.39 distinct function count: 1
% 0.12/0.39 distinct constant count: 3
% 0.12/0.39
% 0.12/0.39 ---------- no more Softie stats ----------
% 0.12/0.39
% 0.12/0.39
% 0.12/0.39
% 0.12/0.39 =========== start of search ===========
% 32.86/33.11
% 32.86/33.11
% 32.86/33.11 Changing weight limit from 60 to 44.
% 32.86/33.11
% 32.86/33.11 Model 2 (0.00 seconds, 0 Inserts)
% 32.86/33.11
% 32.86/33.11 Stopped by limit on number of solutions
% 32.86/33.11
% 32.86/33.11 Model 3 [ 1 0 503 ] (0.00 seconds, 223393 Inserts)
% 32.86/33.11
% 32.86/33.11 Model 4 [ 2 382 219399 ] (0.00 seconds, 221151 Inserts)
% 32.86/33.11
% 32.86/33.11 Model 5 [ 4 384 223645 ] (0.00 seconds, 226564 Inserts)
% 32.86/33.11
% 32.86/33.11 Model 6 [ 5 0 238 ] (0.00 seconds, 220159 Inserts)
% 32.86/33.11
% 32.86/33.11 Model 7 [ 5 407 223570 ] (0.00 seconds, 226435 Inserts)
% 32.86/33.11
% 32.86/33.11 Resetting weight limit to 44 after 90 givens.
% 32.86/33.11
% 39.07/39.30
% 39.07/39.30
% 39.07/39.30 Changing weight limit from 44 to 36.
% 39.07/39.30
% 39.07/39.30 Model 8 [ 5 0 841 ] (0.00 seconds, 222796 Inserts)
% 39.07/39.30
% 39.07/39.30 Resetting weight limit to 36 after 95 givens.
% 39.07/39.30
% 39.28/39.48
% 39.28/39.48
% 39.28/39.48 Changing weight limit from 36 to 32.
% 39.28/39.48
% 39.28/39.48 Resetting weight limit to 32 after 100 givens.
% 39.28/39.48
% 39.37/39.57
% 39.37/39.57
% 39.37/39.57 Changing weight limit from 32 to 28.
% 39.37/39.57
% 39.37/39.57 Resetting weight limit to 28 after 110 givens.
% 39.37/39.57
% 39.43/39.63
% 39.43/39.63
% 39.43/39.63 Changing weight limit from 28 to 24.
% 39.43/39.63
% 39.43/39.63 Resetting weight limit to 24 after 115 givens.
% 39.43/39.63
% 39.50/39.73
% 39.50/39.73
% 39.50/39.73 Changing weight limit from 24 to 20.
% 39.50/39.73
% 39.50/39.73 Resetting weight limit to 20 after 125 givens.
% 39.50/39.73
% 50.44/50.64
% 50.44/50.64 -- HEY sandbox, WE HAVE A PROOF!! --
% 50.44/50.64
% 50.44/50.64 Model 9 [ 7 1 575 ] (0.00 seconds, 223886 Inserts)
% 50.44/50.64
% 50.44/50.64 Modelling stopped after 300 given clauses and 0.00 seconds
% 50.44/50.64
% 50.44/50.64
% 50.44/50.64 ----> UNIT CONFLICT at 50.16 sec ----> 97403 [binary,97402.1,2.1] {-} $F.
% 50.44/50.64
% 50.44/50.64 Length of proof is 55. Level of proof is 24.
% 50.44/50.64
% 50.44/50.64 ---------------- PROOF ----------------
% 50.44/50.64 % SZS status Unsatisfiable
% 50.44/50.64 % SZS output start Refutation
% 50.44/50.64
% 50.44/50.64 1 [] {+} -is_a_theorem(equivalent(A,B))| -is_a_theorem(A)|is_a_theorem(B).
% 50.44/50.64 2 [] {+} -is_a_theorem(equivalent(equivalent(a,b),equivalent(c,equivalent(equivalent(b,c),a)))).
% 50.44/50.64 3 [] {-} is_a_theorem(equivalent(equivalent(A,B),equivalent(C,equivalent(equivalent(C,B),A)))).
% 50.44/50.64 4 [hyper,3,1,3] {-} is_a_theorem(equivalent(A,equivalent(equivalent(A,equivalent(B,equivalent(equivalent(B,C),D))),equivalent(D,C)))).
% 50.44/50.64 5 [hyper,4,1,4] {-} is_a_theorem(equivalent(equivalent(equivalent(A,equivalent(equivalent(A,equivalent(B,equivalent(equivalent(B,C),D))),equivalent(D,C))),equivalent(E,equivalent(equivalent(E,F),G))),equivalent(G,F))).
% 50.44/50.64 6 [hyper,4,1,3] {-} is_a_theorem(equivalent(A,equivalent(equivalent(A,equivalent(equivalent(B,equivalent(C,equivalent(equivalent(C,D),E))),equivalent(E,D))),B))).
% 50.44/50.64 7 [hyper,4,1,3] {-} is_a_theorem(equivalent(equivalent(equivalent(equivalent(A,B),equivalent(C,equivalent(equivalent(C,B),A))),equivalent(D,equivalent(equivalent(D,E),F))),equivalent(F,E))).
% 50.44/50.64 8 [hyper,6,1,6] {-} is_a_theorem(equivalent(equivalent(equivalent(A,equivalent(equivalent(A,equivalent(equivalent(B,equivalent(C,equivalent(equivalent(C,D),E))),equivalent(E,D))),B)),equivalent(equivalent(F,equivalent(G,equivalent(equivalent(G,H),I))),equivalent(I,H))),F)).
% 50.44/50.64 13 [hyper,7,1,7] {-} is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(A,B),C),B),A),C)).
% 50.44/50.64 14 [hyper,7,1,6] {-} is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(equivalent(A,B),equivalent(C,equivalent(equivalent(C,B),A))),equivalent(D,equivalent(equivalent(D,E),F))),equivalent(F,E)),equivalent(equivalent(G,equivalent(H,equivalent(equivalent(H,I),J))),equivalent(J,I))),G)).
% 50.44/50.64 18 [hyper,13,1,4] {-} is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(equivalent(equivalent(A,B),C),B),A),C),equivalent(D,equivalent(equivalent(D,E),F))),equivalent(F,E))).
% 50.44/50.64 19 [hyper,13,1,3] {-} is_a_theorem(equivalent(A,equivalent(equivalent(A,B),equivalent(equivalent(equivalent(equivalent(C,D),B),D),C)))).
% 50.44/50.64 32 [hyper,19,1,3] {-} is_a_theorem(equivalent(equivalent(equivalent(equivalent(A,B),equivalent(C,equivalent(equivalent(C,B),A))),D),equivalent(equivalent(equivalent(equivalent(E,F),D),F),E))).
% 50.44/50.64 95 [hyper,32,1,18] {-} is_a_theorem(equivalent(equivalent(equivalent(equivalent(A,B),equivalent(equivalent(equivalent(equivalent(equivalent(C,D),E),D),C),E)),B),A)).
% 50.44/50.64 97 [hyper,32,1,7] {-} is_a_theorem(equivalent(equivalent(equivalent(equivalent(A,B),equivalent(equivalent(C,D),equivalent(E,equivalent(equivalent(E,D),C)))),B),A)).
% 50.44/50.64 110 [hyper,95,1,13] {-} is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(equivalent(equivalent(A,B),C),B),A),C),D),D)).
% 50.44/50.64 111 [hyper,95,1,8] {-} is_a_theorem(equivalent(equivalent(A,equivalent(equivalent(A,equivalent(B,C)),equivalent(D,equivalent(E,equivalent(equivalent(E,C),B))))),D)).
% 50.44/50.64 125 [hyper,97,1,110] {-} is_a_theorem(equivalent(equivalent(equivalent(equivalent(A,B),equivalent(C,equivalent(equivalent(C,B),A))),D),D)).
% 50.44/50.64 138 [hyper,97,1,5] {-} is_a_theorem(equivalent(equivalent(equivalent(equivalent(A,equivalent(equivalent(A,B),C)),D),equivalent(C,B)),D)).
% 50.44/50.64 141 [hyper,125,1,13] {+} is_a_theorem(equivalent(A,equivalent(equivalent(A,B),B))).
% 50.44/50.64 152 [hyper,141,1,3] {-} is_a_theorem(equivalent(A,equivalent(equivalent(A,equivalent(equivalent(B,C),C)),B))).
% 50.44/50.64 170 [hyper,152,1,141] {-} is_a_theorem(equivalent(equivalent(equivalent(A,equivalent(equivalent(A,equivalent(equivalent(B,C),C)),B)),D),D)).
% 50.44/50.64 180 [hyper,152,1,3] {-} is_a_theorem(equivalent(A,equivalent(equivalent(A,equivalent(equivalent(B,equivalent(equivalent(C,D),D)),C)),B))).
% 50.44/50.64 219 [hyper,170,1,95] {-} is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(A,B),B),C),A),C)).
% 50.44/50.64 223 [hyper,170,1,13] {-} is_a_theorem(equivalent(equivalent(equivalent(A,A),equivalent(equivalent(B,C),C)),B)).
% 50.44/50.64 232 [hyper,219,1,13] {+} is_a_theorem(equivalent(A,A)).
% 50.44/50.64 237 [hyper,219,1,110] {-} is_a_theorem(equivalent(equivalent(equivalent(A,B),A),B)).
% 50.44/50.64 238 [hyper,219,1,18] {-} is_a_theorem(equivalent(A,equivalent(equivalent(A,B),equivalent(equivalent(C,B),C)))).
% 50.44/50.64 239 [hyper,232,1,141] {+} is_a_theorem(equivalent(equivalent(equivalent(A,A),B),B)).
% 50.44/50.64 256 [hyper,237,1,141] {-} is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(A,B),A),B),C),C)).
% 50.44/50.64 281 [hyper,238,1,239] {-} is_a_theorem(equivalent(equivalent(equivalent(A,A),B),equivalent(equivalent(C,B),C))).
% 50.44/50.64 331 [hyper,14,1,223] {-} is_a_theorem(equivalent(equivalent(A,equivalent(equivalent(A,B),C)),equivalent(C,B))).
% 50.44/50.64 408 [hyper,281,1,256] {-} is_a_theorem(equivalent(equivalent(A,equivalent(equivalent(equivalent(B,C),B),C)),A)).
% 50.44/50.64 480 [hyper,331,1,95] {+} is_a_theorem(equivalent(equivalent(A,equivalent(B,A)),B)).
% 50.44/50.64 508 [hyper,480,1,3] {-} is_a_theorem(equivalent(A,equivalent(equivalent(A,B),equivalent(C,equivalent(B,C))))).
% 50.44/50.64 632 [hyper,408,1,238] {-} is_a_theorem(equivalent(A,equivalent(equivalent(B,A),B))).
% 50.44/50.64 642 [hyper,408,1,19] {-} is_a_theorem(equivalent(A,equivalent(equivalent(equivalent(equivalent(B,C),A),C),B))).
% 50.44/50.64 668 [hyper,632,1,3] {-} is_a_theorem(equivalent(A,equivalent(equivalent(A,equivalent(equivalent(B,C),B)),C))).
% 50.44/50.64 1156 [hyper,508,1,408] {+} is_a_theorem(equivalent(A,equivalent(B,equivalent(A,B)))).
% 50.44/50.64 1341 [hyper,1156,1,3] {-} is_a_theorem(equivalent(A,equivalent(equivalent(A,equivalent(B,equivalent(C,B))),C))).
% 50.44/50.64 5078 [hyper,180,1,408] {-} is_a_theorem(equivalent(equivalent(equivalent(A,equivalent(equivalent(B,C),C)),B),A)).
% 50.44/50.64 5126 [hyper,5078,1,138] {-} is_a_theorem(equivalent(equivalent(A,equivalent(equivalent(A,B),equivalent(C,B))),C)).
% 50.44/50.64 5339 [hyper,5126,1,219] {-} is_a_theorem(equivalent(equivalent(equivalent(equivalent(A,B),B),C),equivalent(A,C))).
% 50.44/50.64 5343 [hyper,5126,1,95] {+} is_a_theorem(equivalent(equivalent(A,B),equivalent(B,A))).
% 50.44/50.64 5379 [hyper,5343,1,5126] {-} is_a_theorem(equivalent(A,equivalent(B,equivalent(equivalent(B,C),equivalent(A,C))))).
% 50.44/50.64 5387 [hyper,5343,1,1341] {-} is_a_theorem(equivalent(equivalent(equivalent(A,equivalent(B,equivalent(C,B))),C),A)).
% 50.44/50.64 5391 [hyper,5343,1,668] {-} is_a_theorem(equivalent(equivalent(equivalent(A,equivalent(equivalent(B,C),B)),C),A)).
% 50.44/50.64 7347 [hyper,5339,1,7] {-} is_a_theorem(equivalent(equivalent(equivalent(equivalent(A,B),C),equivalent(A,C)),B)).
% 50.44/50.64 7595 [hyper,5379,1,111] {-} is_a_theorem(equivalent(equivalent(A,equivalent(B,C)),equivalent(equivalent(A,C),B))).
% 50.44/50.64 8592 [hyper,5387,1,110] {-} is_a_theorem(equivalent(equivalent(equivalent(equivalent(A,equivalent(B,A)),C),B),C)).
% 50.44/50.64 8886 [hyper,5391,1,138] {-} is_a_theorem(equivalent(equivalent(A,equivalent(equivalent(A,B),equivalent(B,C))),C)).
% 50.44/50.64 12190 [hyper,7347,1,138] {-} is_a_theorem(equivalent(A,equivalent(equivalent(equivalent(A,equivalent(B,C)),C),B))).
% 50.44/50.64 12394 [hyper,7595,1,642] {-} is_a_theorem(equivalent(equivalent(A,B),equivalent(equivalent(equivalent(B,C),A),C))).
% 50.44/50.64 16513 [hyper,8886,1,8592] {-} is_a_theorem(equivalent(equivalent(equivalent(A,equivalent(B,A)),C),equivalent(C,B))).
% 50.44/50.64 24856 [hyper,12190,1,7595] {-} is_a_theorem(equivalent(equivalent(A,B),equivalent(equivalent(A,equivalent(B,C)),C))).
% 50.44/50.64 31206 [hyper,12394,1,7595] {-} is_a_theorem(equivalent(equivalent(equivalent(A,B),C),equivalent(equivalent(B,C),A))).
% 50.44/50.64 50586 [hyper,24856,1,16513] {-} is_a_theorem(equivalent(equivalent(equivalent(A,equivalent(equivalent(B,A),C)),C),B)).
% 50.44/50.64 97402 [hyper,50586,1,31206] {-} is_a_theorem(equivalent(equivalent(A,B),equivalent(C,equivalent(equivalent(B,C),A)))).
% 50.44/50.64 97403 [binary,97402.1,2.1] {-} $F.
% 50.44/50.64
% 50.44/50.64 % SZS output end Refutation
% 50.44/50.64 ------------ end of proof -------------
% 50.44/50.64
% 50.44/50.64
% 50.44/50.64 Search stopped by max_proofs option.
% 50.44/50.64
% 50.44/50.64
% 50.44/50.64 Search stopped by max_proofs option.
% 50.44/50.64
% 50.44/50.64 ============ end of search ============
% 50.44/50.64
% 50.44/50.64 ----------- soft-scott stats ----------
% 50.44/50.64
% 50.44/50.64 true clauses given 13 (2.2%)
% 50.44/50.64 false clauses given 574
% 50.44/50.64
% 50.44/50.64 FALSE TRUE
% 50.44/50.64 12 87 55
% 50.44/50.64 16 2485 594
% 50.44/50.64 20 330 1499
% 50.44/50.64 tot: 2902 2148 (42.5% true)
% 50.44/50.64
% 50.44/50.64
% 50.44/50.64 Model 9 [ 7 1 575 ] (0.00 seconds, 223886 Inserts)
% 50.44/50.64
% 50.44/50.64 That finishes the proof of the theorem.
% 50.44/50.64
% 50.44/50.64 Process 21932 finished Mon Jul 4 19:10:57 2022
%------------------------------------------------------------------------------