TSTP Solution File: LCL128-1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : LCL128-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n007.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:06 EDT 2022
% Result : Unsatisfiable 6.15s 6.38s
% Output : Refutation 6.15s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : LCL128-1 : TPTP v8.1.0. Released v1.0.0.
% 0.07/0.13 % Command : sos-script %s
% 0.13/0.35 % Computer : n007.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Mon Jul 4 05:54:41 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.13/0.37 ----- Otter 3.2, August 2001 -----
% 0.13/0.37 The process was started by sandbox2 on n007.cluster.edu,
% 0.13/0.37 Mon Jul 4 05:54:41 2022
% 0.13/0.37 The command was "./sos". The process ID is 17857.
% 0.13/0.37
% 0.13/0.37 set(prolog_style_variables).
% 0.13/0.37 set(auto).
% 0.13/0.37 dependent: set(auto1).
% 0.13/0.37 dependent: set(process_input).
% 0.13/0.37 dependent: clear(print_kept).
% 0.13/0.37 dependent: clear(print_new_demod).
% 0.13/0.37 dependent: clear(print_back_demod).
% 0.13/0.37 dependent: clear(print_back_sub).
% 0.13/0.37 dependent: set(control_memory).
% 0.13/0.37 dependent: assign(max_mem, 12000).
% 0.13/0.37 dependent: assign(pick_given_ratio, 4).
% 0.13/0.37 dependent: assign(stats_level, 1).
% 0.13/0.37 dependent: assign(pick_semantic_ratio, 3).
% 0.13/0.37 dependent: assign(sos_limit, 5000).
% 0.13/0.37 dependent: assign(max_weight, 60).
% 0.13/0.37 clear(print_given).
% 0.13/0.37
% 0.13/0.37 list(usable).
% 0.13/0.37
% 0.13/0.37 SCAN INPUT: prop=0, horn=1, equality=0, symmetry=0, max_lits=3.
% 0.13/0.37
% 0.13/0.37 This is a Horn set without equality. The strategy will
% 0.13/0.37 be hyperresolution, with satellites in sos and nuclei
% 0.13/0.37 in usable.
% 0.13/0.37
% 0.13/0.37 dependent: set(hyper_res).
% 0.13/0.37 dependent: clear(order_hyper).
% 0.13/0.37
% 0.13/0.37 ------------> process usable:
% 0.13/0.37
% 0.13/0.37 ------------> process sos:
% 0.13/0.37
% 0.13/0.37 ======= end of input processing =======
% 0.13/0.39
% 0.13/0.39 Model 1 (0.00 seconds, 0 Inserts)
% 0.13/0.39
% 0.13/0.39 Stopped by limit on number of solutions
% 0.13/0.39
% 0.13/0.39
% 0.13/0.39 -------------- Softie stats --------------
% 0.13/0.39
% 0.13/0.39 UPDATE_STOP: 300
% 0.13/0.39 SFINDER_TIME_LIMIT: 2
% 0.13/0.39 SHORT_CLAUSE_CUTOFF: 4
% 0.13/0.39 number of clauses in intial UL: 2
% 0.13/0.39 number of clauses initially in problem: 3
% 0.13/0.39 percentage of clauses intially in UL: 66
% 0.13/0.39 percentage of distinct symbols occuring in initial UL: 100
% 0.13/0.39 percent of all initial clauses that are short: 100
% 0.13/0.39 absolute distinct symbol count: 6
% 0.13/0.39 distinct predicate count: 1
% 0.13/0.39 distinct function count: 1
% 0.13/0.39 distinct constant count: 4
% 0.13/0.39
% 0.13/0.39 ---------- no more Softie stats ----------
% 0.13/0.39
% 0.13/0.39
% 0.13/0.39
% 0.13/0.39 =========== start of search ===========
% 3.96/4.21
% 3.96/4.21
% 3.96/4.21 Changing weight limit from 60 to 48.
% 3.96/4.21
% 3.96/4.21 Model 2 (0.00 seconds, 0 Inserts)
% 3.96/4.21
% 3.96/4.21 Stopped by limit on number of solutions
% 3.96/4.21
% 3.96/4.21 Model 3 (0.00 seconds, 0 Inserts)
% 3.96/4.21
% 3.96/4.21 Stopped by limit on number of solutions
% 3.96/4.21
% 3.96/4.21 Model 4 (0.00 seconds, 0 Inserts)
% 3.96/4.21
% 3.96/4.21 Stopped by limit on number of solutions
% 3.96/4.21
% 3.96/4.21 Model 5 (0.00 seconds, 0 Inserts)
% 3.96/4.21
% 3.96/4.21 Stopped by limit on number of solutions
% 3.96/4.21
% 3.96/4.21 Resetting weight limit to 48 after 100 givens.
% 3.96/4.21
% 4.42/4.62
% 4.42/4.62
% 4.42/4.62 Changing weight limit from 48 to 36.
% 4.42/4.62
% 4.42/4.62 Resetting weight limit to 36 after 105 givens.
% 4.42/4.62
% 4.70/4.91
% 4.70/4.91
% 4.70/4.91 Changing weight limit from 36 to 32.
% 4.70/4.91
% 4.70/4.91 Resetting weight limit to 32 after 115 givens.
% 4.70/4.91
% 4.79/4.97
% 4.79/4.97
% 4.79/4.97 Changing weight limit from 32 to 28.
% 4.79/4.97
% 4.79/4.97 Resetting weight limit to 28 after 120 givens.
% 4.79/4.97
% 4.93/5.10
% 4.93/5.10
% 4.93/5.10 Changing weight limit from 28 to 24.
% 4.93/5.10
% 4.93/5.10 Resetting weight limit to 24 after 125 givens.
% 4.93/5.10
% 6.15/6.38
% 6.15/6.38 -------- PROOF --------
% 6.15/6.38 % SZS status Unsatisfiable
% 6.15/6.38 % SZS output start Refutation
% 6.15/6.38
% 6.15/6.38 ----> UNIT CONFLICT at 5.96 sec ----> 13359 [binary,13358.1,2.1] {-} $F.
% 6.15/6.38
% 6.15/6.38 Length of proof is 24. Level of proof is 18.
% 6.15/6.38
% 6.15/6.38 ---------------- PROOF ----------------
% 6.15/6.38 % SZS status Unsatisfiable
% 6.15/6.38 % SZS output start Refutation
% 6.15/6.38
% 6.15/6.38 1 [] {+} -is_a_theorem(equivalent(A,B))| -is_a_theorem(A)|is_a_theorem(B).
% 6.15/6.38 2 [] {+} -is_a_theorem(equivalent(a,equivalent(a,equivalent(equivalent(b,c),equivalent(equivalent(b,e),equivalent(c,e)))))).
% 6.15/6.38 3 [] {-} is_a_theorem(equivalent(A,equivalent(A,equivalent(equivalent(equivalent(B,C),equivalent(D,C)),equivalent(B,D))))).
% 6.15/6.38 4 [hyper,3,1,3] {-} is_a_theorem(equivalent(equivalent(A,equivalent(A,equivalent(equivalent(equivalent(B,C),equivalent(D,C)),equivalent(B,D)))),equivalent(equivalent(equivalent(E,F),equivalent(G,F)),equivalent(E,G)))).
% 6.15/6.38 6 [hyper,4,1,3] {-} is_a_theorem(equivalent(equivalent(equivalent(A,B),equivalent(C,B)),equivalent(A,C))).
% 6.15/6.38 7 [hyper,6,1,3] {-} is_a_theorem(equivalent(equivalent(equivalent(equivalent(A,B),equivalent(C,B)),equivalent(A,C)),equivalent(equivalent(equivalent(D,E),equivalent(F,E)),equivalent(D,F)))).
% 6.15/6.38 28 [hyper,7,1,6] {-} is_a_theorem(equivalent(equivalent(equivalent(A,B),equivalent(C,B)),equivalent(equivalent(A,D),equivalent(C,D)))).
% 6.15/6.38 33 [hyper,28,1,6] {+} is_a_theorem(equivalent(equivalent(A,B),equivalent(A,B))).
% 6.15/6.38 39 [hyper,28,1,3] {-} is_a_theorem(equivalent(equivalent(A,B),equivalent(equivalent(A,equivalent(equivalent(equivalent(C,D),equivalent(E,D)),equivalent(C,E))),B))).
% 6.15/6.38 42 [hyper,33,1,6] {+} is_a_theorem(equivalent(A,A)).
% 6.15/6.38 46 [hyper,42,1,3] {-} is_a_theorem(equivalent(equivalent(A,A),equivalent(equivalent(equivalent(B,C),equivalent(D,C)),equivalent(B,D)))).
% 6.15/6.38 60 [hyper,46,1,6] {-} is_a_theorem(equivalent(equivalent(A,B),equivalent(equivalent(A,C),equivalent(B,C)))).
% 6.15/6.38 67 [hyper,60,1,6] {-} is_a_theorem(equivalent(equivalent(equivalent(equivalent(A,B),equivalent(C,B)),D),equivalent(equivalent(A,C),D))).
% 6.15/6.38 83 [hyper,67,1,67] {-} is_a_theorem(equivalent(equivalent(equivalent(A,B),C),equivalent(equivalent(A,D),equivalent(C,equivalent(D,B))))).
% 6.15/6.38 223 [hyper,39,1,42] {-} is_a_theorem(equivalent(equivalent(A,equivalent(equivalent(equivalent(B,C),equivalent(D,C)),equivalent(B,D))),A)).
% 6.15/6.38 235 [hyper,223,1,67] {-} is_a_theorem(equivalent(equivalent(A,equivalent(equivalent(B,C),equivalent(D,C))),equivalent(A,equivalent(B,D)))).
% 6.15/6.38 243 [hyper,223,1,39] {-} is_a_theorem(equivalent(equivalent(A,equivalent(B,C)),equivalent(A,equivalent(equivalent(B,D),equivalent(C,D))))).
% 6.15/6.38 244 [hyper,235,1,235] {-} is_a_theorem(equivalent(equivalent(equivalent(A,B),equivalent(equivalent(C,D),equivalent(B,D))),equivalent(A,C))).
% 6.15/6.38 248 [hyper,235,1,67] {-} is_a_theorem(equivalent(equivalent(A,equivalent(B,C)),equivalent(equivalent(A,equivalent(D,C)),equivalent(B,D)))).
% 6.15/6.38 282 [hyper,243,1,235] {-} is_a_theorem(equivalent(equivalent(equivalent(A,equivalent(B,C)),equivalent(D,B)),equivalent(A,equivalent(D,C)))).
% 6.15/6.38 314 [hyper,244,1,243] {+} is_a_theorem(equivalent(equivalent(A,equivalent(B,B)),A)).
% 6.15/6.38 322 [hyper,314,1,83] {-} is_a_theorem(equivalent(equivalent(A,B),equivalent(A,equivalent(B,equivalent(C,C))))).
% 6.15/6.38 399 [hyper,322,1,42] {+} is_a_theorem(equivalent(A,equivalent(A,equivalent(B,B)))).
% 6.15/6.38 780 [hyper,248,1,399] {+} is_a_theorem(equivalent(equivalent(A,equivalent(B,equivalent(C,C))),equivalent(A,B))).
% 6.15/6.38 3675 [hyper,780,1,282] {-} is_a_theorem(equivalent(equivalent(equivalent(A,equivalent(B,C)),equivalent(C,B)),A)).
% 6.15/6.38 3710 [hyper,3675,1,83] {-} is_a_theorem(equivalent(equivalent(equivalent(A,equivalent(B,C)),D),equivalent(A,equivalent(D,equivalent(C,B))))).
% 6.15/6.38 13358 [hyper,3710,1,223] {-} is_a_theorem(equivalent(A,equivalent(A,equivalent(equivalent(B,C),equivalent(equivalent(B,D),equivalent(C,D)))))).
% 6.15/6.38 13359 [binary,13358.1,2.1] {-} $F.
% 6.15/6.38
% 6.15/6.38 % SZS output end Refutation
% 6.15/6.38 ------------ end of proof -------------
% 6.15/6.38
% 6.15/6.38
% 6.15/6.38 Search stopped by max_proofs option.
% 6.15/6.38
% 6.15/6.38
% 6.15/6.38 Search stopped by max_proofs option.
% 6.15/6.38
% 6.15/6.38 ============ end of search ============
% 6.15/6.38
% 6.15/6.38 ----------- soft-scott stats ----------
% 6.15/6.38
% 6.15/6.38 true clauses given 21 (8.3%)
% 6.15/6.38 false clauses given 231
% 6.15/6.38
% 6.15/6.38 FALSE TRUE
% 6.15/6.38 16 56 146
% 6.15/6.38 20 2428 601
% 6.15/6.38 24 123 477
% 6.15/6.38 tot: 2607 1224 (31.9% true)
% 6.15/6.38
% 6.15/6.38
% 6.15/6.38 Model 5 (0.00 seconds, 0 Inserts)
% 6.15/6.38
% 6.15/6.38 That finishes the proof of the theorem.
% 6.15/6.38
% 6.15/6.38 Process 17857 finished Mon Jul 4 05:54:47 2022
%------------------------------------------------------------------------------