TSTP Solution File: LCL105-1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : LCL105-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n028.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:56 EDT 2022
% Result : Unsatisfiable 139.36s 139.56s
% Output : Refutation 139.36s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : LCL105-1 : TPTP v8.1.0. Released v1.0.0.
% 0.07/0.12 % Command : sos-script %s
% 0.13/0.32 % Computer : n028.cluster.edu
% 0.13/0.32 % Model : x86_64 x86_64
% 0.13/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.32 % Memory : 8042.1875MB
% 0.13/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.32 % CPULimit : 300
% 0.13/0.32 % WCLimit : 600
% 0.13/0.32 % DateTime : Sun Jul 3 21:48:33 EDT 2022
% 0.13/0.32 % CPUTime :
% 0.13/0.33 ----- Otter 3.2, August 2001 -----
% 0.13/0.33 The process was started by sandbox on n028.cluster.edu,
% 0.13/0.33 Sun Jul 3 21:48:33 2022
% 0.13/0.33 The command was "./sos". The process ID is 32490.
% 0.13/0.33
% 0.13/0.33 set(prolog_style_variables).
% 0.13/0.33 set(auto).
% 0.13/0.33 dependent: set(auto1).
% 0.13/0.33 dependent: set(process_input).
% 0.13/0.33 dependent: clear(print_kept).
% 0.13/0.33 dependent: clear(print_new_demod).
% 0.13/0.33 dependent: clear(print_back_demod).
% 0.13/0.33 dependent: clear(print_back_sub).
% 0.13/0.33 dependent: set(control_memory).
% 0.13/0.33 dependent: assign(max_mem, 12000).
% 0.13/0.33 dependent: assign(pick_given_ratio, 4).
% 0.13/0.33 dependent: assign(stats_level, 1).
% 0.13/0.33 dependent: assign(pick_semantic_ratio, 3).
% 0.13/0.33 dependent: assign(sos_limit, 5000).
% 0.13/0.33 dependent: assign(max_weight, 60).
% 0.13/0.33 clear(print_given).
% 0.13/0.33
% 0.13/0.33 list(usable).
% 0.13/0.33
% 0.13/0.33 SCAN INPUT: prop=0, horn=1, equality=0, symmetry=0, max_lits=3.
% 0.13/0.33
% 0.13/0.33 This is a Horn set without equality. The strategy will
% 0.13/0.33 be hyperresolution, with satellites in sos and nuclei
% 0.13/0.33 in usable.
% 0.13/0.33
% 0.13/0.33 dependent: set(hyper_res).
% 0.13/0.33 dependent: clear(order_hyper).
% 0.13/0.33
% 0.13/0.33 ------------> process usable:
% 0.13/0.33
% 0.13/0.33 ------------> process sos:
% 0.13/0.33
% 0.13/0.33 ======= end of input processing =======
% 0.13/0.36
% 0.13/0.36 Model 1 (0.00 seconds, 0 Inserts)
% 0.13/0.36
% 0.13/0.36 Stopped by limit on number of solutions
% 0.13/0.36
% 0.13/0.36
% 0.13/0.36 -------------- Softie stats --------------
% 0.13/0.36
% 0.13/0.36 UPDATE_STOP: 300
% 0.13/0.36 SFINDER_TIME_LIMIT: 2
% 0.13/0.36 SHORT_CLAUSE_CUTOFF: 4
% 0.13/0.36 number of clauses in intial UL: 2
% 0.13/0.36 number of clauses initially in problem: 5
% 0.13/0.36 percentage of clauses intially in UL: 40
% 0.13/0.36 percentage of distinct symbols occuring in initial UL: 100
% 0.13/0.36 percent of all initial clauses that are short: 100
% 0.13/0.36 absolute distinct symbol count: 6
% 0.13/0.36 distinct predicate count: 1
% 0.13/0.36 distinct function count: 1
% 0.13/0.36 distinct constant count: 4
% 0.13/0.36
% 0.13/0.36 ---------- no more Softie stats ----------
% 0.13/0.36
% 0.13/0.36
% 0.13/0.36
% 0.13/0.36 =========== start of search ===========
% 1.29/1.50
% 1.29/1.50
% 1.29/1.50 Changing weight limit from 60 to 44.
% 1.29/1.50
% 1.29/1.50 Model 2 (0.00 seconds, 0 Inserts)
% 1.29/1.50
% 1.29/1.50 Stopped by limit on number of solutions
% 1.29/1.50
% 1.29/1.50 Model 3 (0.00 seconds, 0 Inserts)
% 1.29/1.50
% 1.29/1.50 Stopped by limit on number of solutions
% 1.29/1.50
% 1.29/1.50 Resetting weight limit to 44 after 90 givens.
% 1.29/1.50
% 55.46/55.64
% 55.46/55.64
% 55.46/55.64 Changing weight limit from 44 to 40.
% 55.46/55.64
% 55.46/55.64 Modelling stopped after 300 given clauses and 0.00 seconds
% 55.46/55.64
% 55.46/55.64
% 55.46/55.64 Resetting weight limit to 40 after 405 givens.
% 55.46/55.64
% 59.48/59.72
% 59.48/59.72
% 59.48/59.72 Changing weight limit from 40 to 36.
% 59.48/59.72
% 59.48/59.72 Resetting weight limit to 36 after 420 givens.
% 59.48/59.72
% 62.19/62.41
% 62.19/62.41
% 62.19/62.41 Changing weight limit from 36 to 32.
% 62.19/62.41
% 62.19/62.41 Resetting weight limit to 32 after 430 givens.
% 62.19/62.41
% 65.09/65.33
% 65.09/65.33
% 65.09/65.33 Changing weight limit from 32 to 28.
% 65.09/65.33
% 65.09/65.33 Resetting weight limit to 28 after 470 givens.
% 65.09/65.33
% 72.17/72.38
% 72.17/72.38
% 72.17/72.38 Changing weight limit from 28 to 24.
% 72.17/72.38
% 72.17/72.38 Resetting weight limit to 24 after 630 givens.
% 72.17/72.38
% 139.36/139.56
% 139.36/139.56 -- HEY sandbox, WE HAVE A PROOF!! --
% 139.36/139.56
% 139.36/139.56 ----> UNIT CONFLICT at 137.09 sec ----> 448119 [binary,448118.1,2.1] {-} $F.
% 139.36/139.56
% 139.36/139.56 Length of proof is 36. Level of proof is 13.
% 139.36/139.56
% 139.36/139.56 ---------------- PROOF ----------------
% 139.36/139.56 % SZS status Unsatisfiable
% 139.36/139.56 % SZS output start Refutation
% 139.36/139.56
% 139.36/139.56 1 [] {+} -is_a_theorem(equivalent(A,B))| -is_a_theorem(A)|is_a_theorem(B).
% 139.36/139.56 2 [] {+} -is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(a,b),equivalent(a,c)),equivalent(b,c)),e),e)).
% 139.36/139.56 3 [] {-} is_a_theorem(equivalent(A,equivalent(equivalent(B,C),equivalent(equivalent(C,B),A)))).
% 139.36/139.56 4 [] {-} is_a_theorem(equivalent(equivalent(A,B),equivalent(equivalent(C,A),equivalent(C,B)))).
% 139.36/139.56 5 [] {-} is_a_theorem(equivalent(equivalent(equivalent(A,B),equivalent(equivalent(B,A),C)),C)).
% 139.36/139.56 7 [hyper,4,1,4] {-} is_a_theorem(equivalent(equivalent(A,equivalent(B,C)),equivalent(A,equivalent(equivalent(D,B),equivalent(D,C))))).
% 139.36/139.56 9 [hyper,4,1,3] {-} is_a_theorem(equivalent(equivalent(A,B),equivalent(A,equivalent(equivalent(C,D),equivalent(equivalent(D,C),B))))).
% 139.36/139.56 10 [hyper,5,1,4] {-} is_a_theorem(equivalent(equivalent(A,equivalent(equivalent(B,C),equivalent(equivalent(C,B),D))),equivalent(A,D))).
% 139.36/139.56 43 [hyper,7,1,3] {-} is_a_theorem(equivalent(A,equivalent(equivalent(B,equivalent(C,D)),equivalent(B,equivalent(equivalent(D,C),A))))).
% 139.36/139.56 85 [hyper,10,1,4] {-} is_a_theorem(equivalent(equivalent(A,equivalent(B,equivalent(equivalent(C,D),equivalent(equivalent(D,C),E)))),equivalent(A,equivalent(B,E)))).
% 139.36/139.56 87 [hyper,10,1,7] {-} is_a_theorem(equivalent(equivalent(equivalent(A,B),equivalent(A,C)),equivalent(B,C))).
% 139.36/139.56 90 [hyper,87,1,10] {-} is_a_theorem(equivalent(equivalent(equivalent(A,equivalent(B,C)),equivalent(A,equivalent(equivalent(C,B),D))),D)).
% 139.36/139.56 93 [hyper,87,1,7] {-} is_a_theorem(equivalent(equivalent(equivalent(A,B),equivalent(A,C)),equivalent(equivalent(D,B),equivalent(D,C)))).
% 139.36/139.56 95 [hyper,87,1,4] {-} is_a_theorem(equivalent(equivalent(A,equivalent(equivalent(B,C),equivalent(B,D))),equivalent(A,equivalent(C,D)))).
% 139.36/139.56 338 [hyper,43,1,87] {-} is_a_theorem(equivalent(A,equivalent(B,equivalent(equivalent(C,D),equivalent(equivalent(B,equivalent(D,C)),A))))).
% 139.36/139.56 427 [hyper,90,1,87] {-} is_a_theorem(equivalent(equivalent(A,equivalent(equivalent(B,C),equivalent(equivalent(A,equivalent(C,B)),D))),D)).
% 139.36/139.56 459 [hyper,93,1,90] {-} is_a_theorem(equivalent(equivalent(A,equivalent(B,equivalent(equivalent(C,D),equivalent(equivalent(B,equivalent(D,C)),E)))),equivalent(A,E))).
% 139.36/139.56 509 [hyper,95,1,95] {-} is_a_theorem(equivalent(equivalent(equivalent(A,B),equivalent(equivalent(C,A),equivalent(C,D))),equivalent(B,D))).
% 139.36/139.56 527 [hyper,95,1,87] {-} is_a_theorem(equivalent(equivalent(equivalent(A,equivalent(B,C)),equivalent(A,equivalent(B,D))),equivalent(C,D))).
% 139.36/139.56 531 [hyper,95,1,9] {-} is_a_theorem(equivalent(equivalent(equivalent(equivalent(A,B),C),D),equivalent(C,equivalent(equivalent(B,A),D)))).
% 139.36/139.56 532 [hyper,95,1,7] {-} is_a_theorem(equivalent(equivalent(equivalent(equivalent(A,B),C),equivalent(B,D)),equivalent(C,equivalent(A,D)))).
% 139.36/139.56 962 [hyper,427,1,93] {-} is_a_theorem(equivalent(equivalent(A,equivalent(equivalent(B,C),equivalent(equivalent(D,equivalent(C,B)),equivalent(D,E)))),equivalent(A,E))).
% 139.36/139.56 1125 [hyper,509,1,95] {-} is_a_theorem(equivalent(equivalent(equivalent(A,equivalent(B,C)),equivalent(equivalent(D,A),equivalent(D,equivalent(B,E)))),equivalent(C,E))).
% 139.36/139.56 1254 [hyper,527,1,95] {-} is_a_theorem(equivalent(equivalent(equivalent(A,equivalent(B,equivalent(C,D))),equivalent(A,equivalent(B,equivalent(C,E)))),equivalent(D,E))).
% 139.36/139.56 1338 [hyper,531,1,7] {-} is_a_theorem(equivalent(equivalent(equivalent(equivalent(A,B),C),D),equivalent(equivalent(E,C),equivalent(E,equivalent(equivalent(B,A),D))))).
% 139.36/139.56 1343 [hyper,531,1,527] {-} is_a_theorem(equivalent(equivalent(A,equivalent(B,C)),equivalent(equivalent(equivalent(B,D),A),equivalent(D,C)))).
% 139.36/139.56 1354 [hyper,531,1,90] {-} is_a_theorem(equivalent(equivalent(A,equivalent(equivalent(B,C),D)),equivalent(equivalent(equivalent(C,B),A),D))).
% 139.36/139.56 1384 [hyper,532,1,338] {-} is_a_theorem(equivalent(A,equivalent(B,equivalent(equivalent(C,D),equivalent(equivalent(E,equivalent(D,C)),equivalent(equivalent(B,E),A)))))).
% 139.36/139.56 2810 [hyper,1354,1,4] {-} is_a_theorem(equivalent(equivalent(A,equivalent(B,equivalent(equivalent(C,D),E))),equivalent(A,equivalent(equivalent(equivalent(D,C),B),E)))).
% 139.36/139.56 5495 [hyper,85,1,1343] {-} is_a_theorem(equivalent(equivalent(A,equivalent(B,equivalent(equivalent(C,D),E))),equivalent(equivalent(equivalent(B,equivalent(D,C)),A),E))).
% 139.36/139.56 48918 [hyper,1384,1,459] {+} is_a_theorem(equivalent(A,equivalent(equivalent(B,B),A))).
% 139.36/139.56 50601 [hyper,48918,1,962] {-} is_a_theorem(equivalent(equivalent(equivalent(A,equivalent(B,B)),equivalent(A,C)),C)).
% 139.36/139.56 50621 [hyper,48918,1,532] {-} is_a_theorem(equivalent(A,equivalent(B,equivalent(equivalent(B,equivalent(C,C)),A)))).
% 139.36/139.56 51464 [hyper,50601,1,1254] {-} is_a_theorem(equivalent(equivalent(A,equivalent(equivalent(A,equivalent(B,B)),C)),C)).
% 139.36/139.56 52430 [hyper,50621,1,532] {-} is_a_theorem(equivalent(A,equivalent(B,equivalent(equivalent(C,equivalent(D,D)),equivalent(equivalent(B,C),A))))).
% 139.36/139.56 53379 [hyper,51464,1,1125] {-} is_a_theorem(equivalent(equivalent(equivalent(A,B),equivalent(A,equivalent(equivalent(B,equivalent(C,C)),D))),D)).
% 139.36/139.56 78654 [hyper,52430,1,532] {-} is_a_theorem(equivalent(A,equivalent(B,equivalent(equivalent(C,equivalent(D,D)),equivalent(equivalent(E,C),equivalent(equivalent(B,E),A)))))).
% 139.36/139.56 80768 [hyper,53379,1,1338] {-} is_a_theorem(equivalent(equivalent(A,equivalent(B,equivalent(equivalent(C,equivalent(D,D)),E))),equivalent(A,equivalent(equivalent(C,B),E)))).
% 139.36/139.56 443159 [hyper,80768,1,78654] {-} is_a_theorem(equivalent(A,equivalent(equivalent(B,C),equivalent(equivalent(D,B),equivalent(equivalent(C,D),A))))).
% 139.36/139.56 444309 [hyper,443159,1,2810] {-} is_a_theorem(equivalent(A,equivalent(equivalent(equivalent(B,C),equivalent(B,D)),equivalent(equivalent(D,C),A)))).
% 139.36/139.56 448118 [hyper,444309,1,5495] {-} is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(A,B),equivalent(A,C)),equivalent(B,C)),D),D)).
% 139.36/139.56 448119 [binary,448118.1,2.1] {-} $F.
% 139.36/139.56
% 139.36/139.56 % SZS output end Refutation
% 139.36/139.56 ------------ end of proof -------------
% 139.36/139.56
% 139.36/139.56
% 139.36/139.56 Search stopped by max_proofs option.
% 139.36/139.56
% 139.36/139.56
% 139.36/139.56 Search stopped by max_proofs option.
% 139.36/139.56
% 139.36/139.56 ============ end of search ============
% 139.36/139.56
% 139.36/139.56 ----------- soft-scott stats ----------
% 139.36/139.56
% 139.36/139.56 true clauses given 716 (21.9%)
% 139.36/139.56 false clauses given 2549
% 139.36/139.56
% 139.36/139.56 FALSE TRUE
% 139.36/139.56 16 5 0
% 139.36/139.56 20 2495 1137
% 139.36/139.56 24 0 1363
% 139.36/139.56 tot: 2500 2500 (50.0% true)
% 139.36/139.56
% 139.36/139.56
% 139.36/139.56 Model 3 (0.01 seconds, 0 Inserts)
% 139.36/139.56
% 139.36/139.56 That finishes the proof of the theorem.
% 139.36/139.56
% 139.36/139.56 Process 32490 finished Sun Jul 3 21:50:53 2022
%------------------------------------------------------------------------------