TSTP Solution File: LCL015-1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : LCL015-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n020.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.59s 50.75s
% Output : Refutation 50.59s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13 % Problem : LCL015-1 : TPTP v8.1.0. Released v1.0.0.
% 0.04/0.14 % Command : sos-script %s
% 0.15/0.35 % Computer : n020.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 300
% 0.15/0.35 % WCLimit : 600
% 0.15/0.35 % DateTime : Sun Jul 3 05:14:00 EDT 2022
% 0.15/0.35 % CPUTime :
% 0.15/0.37 ----- Otter 3.2, August 2001 -----
% 0.15/0.37 The process was started by sandbox2 on n020.cluster.edu,
% 0.15/0.37 Sun Jul 3 05:14:00 2022
% 0.15/0.37 The command was "./sos". The process ID is 25626.
% 0.15/0.37
% 0.15/0.37 set(prolog_style_variables).
% 0.15/0.37 set(auto).
% 0.15/0.37 dependent: set(auto1).
% 0.15/0.37 dependent: set(process_input).
% 0.15/0.37 dependent: clear(print_kept).
% 0.15/0.37 dependent: clear(print_new_demod).
% 0.15/0.37 dependent: clear(print_back_demod).
% 0.15/0.37 dependent: clear(print_back_sub).
% 0.15/0.37 dependent: set(control_memory).
% 0.15/0.37 dependent: assign(max_mem, 12000).
% 0.15/0.37 dependent: assign(pick_given_ratio, 4).
% 0.15/0.37 dependent: assign(stats_level, 1).
% 0.15/0.37 dependent: assign(pick_semantic_ratio, 3).
% 0.15/0.37 dependent: assign(sos_limit, 5000).
% 0.15/0.37 dependent: assign(max_weight, 60).
% 0.15/0.37 clear(print_given).
% 0.15/0.37
% 0.15/0.37 list(usable).
% 0.15/0.37
% 0.15/0.37 SCAN INPUT: prop=0, horn=1, equality=0, symmetry=0, max_lits=3.
% 0.15/0.37
% 0.15/0.37 This is a Horn set without equality. The strategy will
% 0.15/0.37 be hyperresolution, with satellites in sos and nuclei
% 0.15/0.37 in usable.
% 0.15/0.37
% 0.15/0.37 dependent: set(hyper_res).
% 0.15/0.37 dependent: clear(order_hyper).
% 0.15/0.37
% 0.15/0.37 ------------> process usable:
% 0.15/0.37
% 0.15/0.37 ------------> process sos:
% 0.15/0.37
% 0.15/0.37 ======= end of input processing =======
% 0.22/0.39
% 0.22/0.39 Model 1 (0.00 seconds, 0 Inserts)
% 0.22/0.39
% 0.22/0.39 Stopped by limit on number of solutions
% 0.22/0.39
% 0.22/0.39
% 0.22/0.39 -------------- Softie stats --------------
% 0.22/0.39
% 0.22/0.39 UPDATE_STOP: 300
% 0.22/0.39 SFINDER_TIME_LIMIT: 2
% 0.22/0.39 SHORT_CLAUSE_CUTOFF: 4
% 0.22/0.39 number of clauses in intial UL: 2
% 0.22/0.39 number of clauses initially in problem: 3
% 0.22/0.39 percentage of clauses intially in UL: 66
% 0.22/0.39 percentage of distinct symbols occuring in initial UL: 100
% 0.22/0.39 percent of all initial clauses that are short: 100
% 0.22/0.39 absolute distinct symbol count: 5
% 0.22/0.39 distinct predicate count: 1
% 0.22/0.39 distinct function count: 1
% 0.22/0.39 distinct constant count: 3
% 0.22/0.39
% 0.22/0.39 ---------- no more Softie stats ----------
% 0.22/0.39
% 0.22/0.39
% 0.22/0.39
% 0.22/0.39 =========== start of search ===========
% 36.10/36.29
% 36.10/36.29
% 36.10/36.29 Changing weight limit from 60 to 52.
% 36.10/36.29
% 36.10/36.29 Model 2 (0.00 seconds, 0 Inserts)
% 36.10/36.29
% 36.10/36.29 Stopped by limit on number of solutions
% 36.10/36.29
% 36.10/36.29 Model 3 (0.00 seconds, 0 Inserts)
% 36.10/36.29
% 36.10/36.29 Stopped by limit on number of solutions
% 36.10/36.29
% 36.10/36.29 Model 4 [ 2 1 698 ] (0.00 seconds, 198369 Inserts)
% 36.10/36.29
% 36.10/36.29 Model 5 [ 3 0 251 ] (0.00 seconds, 198796 Inserts)
% 36.10/36.29
% 36.10/36.29 Model 6 [ 8 0 221 ] (0.00 seconds, 198780 Inserts)
% 36.10/36.29
% 36.10/36.29 Model 7 [ 4 1 254 ] (0.00 seconds, 198703 Inserts)
% 36.10/36.29
% 36.10/36.29 Model 8 [ 5 0 129 ] (0.00 seconds, 198678 Inserts)
% 36.10/36.29
% 36.10/36.29 Resetting weight limit to 52 after 80 givens.
% 36.10/36.29
% 36.38/36.57
% 36.38/36.57
% 36.38/36.57 Changing weight limit from 52 to 44.
% 36.38/36.57
% 36.38/36.57 Resetting weight limit to 44 after 85 givens.
% 36.38/36.57
% 36.70/36.89
% 36.70/36.89
% 36.70/36.89 Changing weight limit from 44 to 36.
% 36.70/36.89
% 36.70/36.89 Resetting weight limit to 36 after 90 givens.
% 36.70/36.89
% 36.88/37.04
% 36.88/37.04
% 36.88/37.04 Changing weight limit from 36 to 32.
% 36.88/37.04
% 36.88/37.04 Resetting weight limit to 32 after 95 givens.
% 36.88/37.04
% 36.95/37.11
% 36.95/37.11
% 36.95/37.11 Changing weight limit from 32 to 28.
% 36.95/37.11
% 36.95/37.11 Resetting weight limit to 28 after 100 givens.
% 36.95/37.11
% 37.00/37.24
% 37.00/37.24
% 37.00/37.24 Changing weight limit from 28 to 24.
% 37.00/37.24
% 37.00/37.24 Resetting weight limit to 24 after 110 givens.
% 37.00/37.24
% 37.13/37.32
% 37.13/37.32
% 37.13/37.32 Changing weight limit from 24 to 20.
% 37.13/37.32
% 37.13/37.32 Resetting weight limit to 20 after 120 givens.
% 37.13/37.32
% 50.59/50.75
% 50.59/50.75 -- HEY sandbox2, WE HAVE A PROOF!! --
% 50.59/50.75
% 50.59/50.75 Model 9 [ 7 0 433 ] (0.00 seconds, 203278 Inserts)
% 50.59/50.75
% 50.59/50.75 Modelling stopped after 300 given clauses and 0.00 seconds
% 50.59/50.75
% 50.59/50.75
% 50.59/50.75 ----> UNIT CONFLICT at 50.25 sec ----> 106248 [binary,106247.1,2.1] {-} $F.
% 50.59/50.75
% 50.59/50.75 Length of proof is 38. Level of proof is 24.
% 50.59/50.75
% 50.59/50.75 ---------------- PROOF ----------------
% 50.59/50.75 % SZS status Unsatisfiable
% 50.59/50.75 % SZS output start Refutation
% 50.59/50.75
% 50.59/50.75 1 [] {+} -is_a_theorem(equivalent(A,B))| -is_a_theorem(A)|is_a_theorem(B).
% 50.59/50.75 2 [] {+} -is_a_theorem(equivalent(equivalent(a,equivalent(b,c)),equivalent(c,equivalent(a,b)))).
% 50.59/50.75 3 [] {-} is_a_theorem(equivalent(equivalent(A,B),equivalent(C,equivalent(equivalent(B,C),A)))).
% 50.59/50.75 4 [hyper,3,1,3] {-} is_a_theorem(equivalent(A,equivalent(equivalent(equivalent(B,equivalent(equivalent(C,B),D)),A),equivalent(D,C)))).
% 50.59/50.75 5 [hyper,4,1,4] {-} is_a_theorem(equivalent(equivalent(equivalent(A,equivalent(equivalent(B,A),C)),equivalent(D,equivalent(equivalent(equivalent(E,equivalent(equivalent(F,E),G)),D),equivalent(G,F)))),equivalent(C,B))).
% 50.59/50.75 7 [hyper,4,1,3] {-} is_a_theorem(equivalent(equivalent(equivalent(A,equivalent(equivalent(B,A),C)),equivalent(equivalent(D,E),equivalent(F,equivalent(equivalent(E,F),D)))),equivalent(C,B))).
% 50.59/50.75 13 [hyper,7,1,7] {-} is_a_theorem(equivalent(equivalent(A,equivalent(equivalent(equivalent(B,equivalent(equivalent(equivalent(C,equivalent(equivalent(D,C),E)),B),equivalent(E,D))),A),F)),F)).
% 50.59/50.76 32 [hyper,5,1,3] {-} is_a_theorem(equivalent(equivalent(equivalent(A,equivalent(B,equivalent(C,A))),C),B)).
% 50.59/50.76 35 [hyper,32,1,4] {-} is_a_theorem(equivalent(equivalent(equivalent(A,equivalent(equivalent(B,A),C)),equivalent(equivalent(equivalent(D,equivalent(E,equivalent(F,D))),F),E)),equivalent(C,B))).
% 50.59/50.76 36 [hyper,32,1,3] {-} is_a_theorem(equivalent(A,equivalent(equivalent(B,A),equivalent(equivalent(C,equivalent(B,equivalent(D,C))),D)))).
% 50.59/50.76 42 [hyper,36,1,32] {-} is_a_theorem(equivalent(equivalent(A,equivalent(equivalent(equivalent(B,equivalent(C,equivalent(D,B))),D),C)),equivalent(equivalent(E,equivalent(A,equivalent(F,E))),F))).
% 50.59/50.76 84 [hyper,35,1,32] {-} is_a_theorem(equivalent(equivalent(A,equivalent(equivalent(equivalent(B,C),equivalent(D,equivalent(equivalent(C,D),B))),equivalent(E,A))),E)).
% 50.59/50.76 104 [hyper,84,1,36] {-} is_a_theorem(equivalent(A,equivalent(equivalent(B,C),equivalent(equivalent(D,equivalent(equivalent(C,D),B)),A)))).
% 50.59/50.76 112 [hyper,104,1,3] {-} is_a_theorem(equivalent(A,equivalent(equivalent(equivalent(equivalent(B,C),equivalent(equivalent(D,equivalent(equivalent(C,D),B)),E)),A),E))).
% 50.59/50.76 170 [hyper,42,1,32] {-} is_a_theorem(equivalent(equivalent(A,equivalent(equivalent(equivalent(equivalent(B,equivalent(C,equivalent(D,B))),D),C),equivalent(E,A))),E)).
% 50.59/50.76 196 [hyper,170,1,36] {-} is_a_theorem(equivalent(A,equivalent(equivalent(equivalent(B,equivalent(C,equivalent(D,B))),D),equivalent(C,A)))).
% 50.59/50.76 202 [hyper,196,1,13] {-} is_a_theorem(equivalent(equivalent(equivalent(A,equivalent(equivalent(B,A),C)),B),C)).
% 50.59/50.76 204 [hyper,196,1,7] {-} is_a_theorem(equivalent(equivalent(A,equivalent(B,equivalent(C,equivalent(B,A)))),C)).
% 50.59/50.76 252 [hyper,204,1,202] {+} is_a_theorem(equivalent(A,equivalent(equivalent(A,B),B))).
% 50.59/50.76 271 [hyper,252,1,104] {-} is_a_theorem(equivalent(equivalent(A,B),equivalent(equivalent(C,equivalent(equivalent(B,C),A)),equivalent(D,equivalent(equivalent(D,E),E))))).
% 50.59/50.76 275 [hyper,252,1,35] {+} is_a_theorem(equivalent(equivalent(equivalent(A,B),B),A)).
% 50.59/50.76 279 [hyper,252,1,3] {-} is_a_theorem(equivalent(A,equivalent(equivalent(equivalent(equivalent(B,C),C),A),B))).
% 50.59/50.76 314 [hyper,275,1,202] {-} is_a_theorem(equivalent(A,equivalent(equivalent(B,A),B))).
% 50.59/50.76 351 [hyper,314,1,3] {-} is_a_theorem(equivalent(A,equivalent(equivalent(equivalent(equivalent(B,C),B),A),C))).
% 50.59/50.76 353 [hyper,314,1,275] {-} is_a_theorem(equivalent(equivalent(A,equivalent(equivalent(equivalent(B,C),C),B)),A)).
% 50.59/50.76 941 [hyper,353,1,112] {-} is_a_theorem(equivalent(equivalent(A,equivalent(equivalent(B,A),C)),equivalent(C,B))).
% 50.59/50.76 954 [hyper,353,1,4] {+} is_a_theorem(equivalent(equivalent(A,equivalent(B,A)),B)).
% 50.59/50.76 977 [hyper,954,1,5] {-} is_a_theorem(equivalent(equivalent(equivalent(equivalent(A,equivalent(equivalent(B,A),C)),D),equivalent(C,B)),D)).
% 50.59/50.76 980 [hyper,954,1,351] {-} is_a_theorem(equivalent(equivalent(equivalent(A,B),A),B)).
% 50.59/50.76 1049 [hyper,980,1,252] {-} is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(A,B),A),B),C),C)).
% 50.59/50.76 2895 [hyper,941,1,196] {-} is_a_theorem(equivalent(equivalent(A,B),equivalent(C,equivalent(A,equivalent(B,C))))).
% 50.59/50.76 5379 [hyper,2895,1,1049] {-} is_a_theorem(equivalent(A,equivalent(equivalent(equivalent(B,C),B),equivalent(C,A)))).
% 50.59/50.76 5967 [hyper,5379,1,941] {+} is_a_theorem(equivalent(equivalent(A,B),equivalent(B,A))).
% 50.59/50.76 6124 [hyper,5967,1,2895] {-} is_a_theorem(equivalent(equivalent(A,equivalent(B,equivalent(C,A))),equivalent(B,C))).
% 50.59/50.76 6145 [hyper,5967,1,279] {-} is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(A,B),B),C),A),C)).
% 50.59/50.76 11918 [hyper,6124,1,271] {-} is_a_theorem(equivalent(equivalent(A,equivalent(equivalent(B,A),equivalent(C,B))),C)).
% 50.59/50.76 20646 [hyper,11918,1,6145] {-} is_a_theorem(equivalent(equivalent(A,equivalent(equivalent(B,C),C)),equivalent(B,A))).
% 50.59/50.76 44844 [hyper,20646,1,6124] {-} is_a_theorem(equivalent(A,equivalent(B,equivalent(equivalent(A,C),equivalent(C,B))))).
% 50.59/50.76 64533 [hyper,44844,1,941] {-} is_a_theorem(equivalent(equivalent(equivalent(A,B),equivalent(B,equivalent(C,A))),C)).
% 50.59/50.76 105464 [hyper,977,1,64533] {-} is_a_theorem(equivalent(equivalent(equivalent(A,B),C),equivalent(equivalent(C,A),B))).
% 50.59/50.76 106247 [hyper,105464,1,64533] {-} is_a_theorem(equivalent(equivalent(A,equivalent(B,C)),equivalent(C,equivalent(A,B)))).
% 50.59/50.76 106248 [binary,106247.1,2.1] {-} $F.
% 50.59/50.76
% 50.59/50.76 % SZS output end Refutation
% 50.59/50.76 ------------ end of proof -------------
% 50.59/50.76
% 50.59/50.76
% 50.59/50.76 Search stopped by max_proofs option.
% 50.59/50.76
% 50.59/50.76
% 50.59/50.76 Search stopped by max_proofs option.
% 50.59/50.76
% 50.59/50.76 ============ end of search ============
% 50.59/50.76
% 50.59/50.76 ----------- soft-scott stats ----------
% 50.59/50.76
% 50.59/50.76 true clauses given 26 (4.0%)
% 50.59/50.76 false clauses given 616
% 50.59/50.76
% 50.59/50.76 FALSE TRUE
% 50.59/50.76 12 28 36
% 50.59/50.76 16 2730 609
% 50.59/50.76 20 295 1855
% 50.59/50.76 tot: 3053 2500 (45.0% true)
% 50.59/50.76
% 50.59/50.76
% 50.59/50.76 Model 9 [ 7 0 433 ] (0.00 seconds, 203278 Inserts)
% 50.59/50.76
% 50.59/50.76 That finishes the proof of the theorem.
% 50.59/50.76
% 50.59/50.76 Process 25626 finished Sun Jul 3 05:14:50 2022
%------------------------------------------------------------------------------