TSTP Solution File: LCL019-1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : LCL019-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n027.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:23 EDT 2022
% Result : Unsatisfiable 21.83s 22.05s
% Output : Refutation 21.83s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : LCL019-1 : TPTP v8.1.0. Released v1.0.0.
% 0.06/0.13 % Command : sos-script %s
% 0.12/0.33 % Computer : n027.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 : Sun Jul 3 11:13:39 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 n027.cluster.edu,
% 0.12/0.35 Sun Jul 3 11:13:39 2022
% 0.12/0.35 The command was "./sos". The process ID is 13168.
% 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 ===========
% 4.58/4.81
% 4.58/4.81
% 4.58/4.81 Changing weight limit from 60 to 44.
% 4.58/4.81
% 4.58/4.81 Model 2 (0.00 seconds, 0 Inserts)
% 4.58/4.81
% 4.58/4.81 Stopped by limit on number of solutions
% 4.58/4.81
% 4.58/4.81 Model 3 (0.00 seconds, 0 Inserts)
% 4.58/4.81
% 4.58/4.81 Stopped by limit on number of solutions
% 4.58/4.81
% 4.58/4.81 Model 4 (0.00 seconds, 0 Inserts)
% 4.58/4.81
% 4.58/4.81 Stopped by limit on number of solutions
% 4.58/4.81
% 4.58/4.81 Model 5 (0.00 seconds, 0 Inserts)
% 4.58/4.81
% 4.58/4.81 Stopped by limit on number of solutions
% 4.58/4.81
% 4.58/4.81 Model 6 (0.00 seconds, 0 Inserts)
% 4.58/4.81
% 4.58/4.81 Stopped by limit on number of solutions
% 4.58/4.81
% 4.58/4.81 Resetting weight limit to 44 after 95 givens.
% 4.58/4.81
% 4.88/5.06
% 4.88/5.06
% 4.88/5.06 Changing weight limit from 44 to 36.
% 4.88/5.06
% 4.88/5.06 Resetting weight limit to 36 after 100 givens.
% 4.88/5.06
% 4.98/5.18
% 4.98/5.18
% 4.98/5.18 Changing weight limit from 36 to 32.
% 4.98/5.18
% 4.98/5.18 Resetting weight limit to 32 after 105 givens.
% 4.98/5.18
% 5.18/5.36
% 5.18/5.36
% 5.18/5.36 Changing weight limit from 32 to 28.
% 5.18/5.36
% 5.18/5.36 Resetting weight limit to 28 after 120 givens.
% 5.18/5.36
% 8.63/8.82
% 8.63/8.82
% 8.63/8.82 Changing weight limit from 28 to 24.
% 8.63/8.82
% 8.63/8.82 Model 7 (0.00 seconds, 0 Inserts)
% 8.63/8.82
% 8.63/8.82 Stopped by limit on number of solutions
% 8.63/8.82
% 8.63/8.82 Resetting weight limit to 24 after 315 givens.
% 8.63/8.82
% 10.32/10.50
% 10.32/10.50
% 10.32/10.50 Changing weight limit from 24 to 20.
% 10.32/10.50
% 10.32/10.50 Modelling stopped after 300 given clauses and 0.00 seconds
% 10.32/10.50
% 10.32/10.50
% 10.32/10.50 Resetting weight limit to 20 after 410 givens.
% 10.32/10.50
% 21.83/22.05
% 21.83/22.05 -- HEY sandbox, WE HAVE A PROOF!! --
% 21.83/22.05
% 21.83/22.05 ----> UNIT CONFLICT at 21.35 sec ----> 131593 [binary,131592.1,2.1] {-} $F.
% 21.83/22.05
% 21.83/22.05 Length of proof is 40. Level of proof is 23.
% 21.83/22.05
% 21.83/22.05 ---------------- PROOF ----------------
% 21.83/22.05 % SZS status Unsatisfiable
% 21.83/22.05 % SZS output start Refutation
% 21.83/22.05
% 21.83/22.05 1 [] {+} -is_a_theorem(equivalent(A,B))| -is_a_theorem(A)|is_a_theorem(B).
% 21.83/22.05 2 [] {+} -is_a_theorem(equivalent(equivalent(equivalent(a,equivalent(b,c)),b),equivalent(c,a))).
% 21.83/22.05 3 [] {-} is_a_theorem(equivalent(A,equivalent(equivalent(B,equivalent(C,A)),equivalent(C,B)))).
% 21.83/22.05 4 [hyper,3,1,3] {-} is_a_theorem(equivalent(equivalent(A,equivalent(B,equivalent(C,equivalent(equivalent(D,equivalent(E,C)),equivalent(E,D))))),equivalent(B,A))).
% 21.83/22.05 7 [hyper,4,1,3] {-} is_a_theorem(equivalent(equivalent(equivalent(equivalent(A,equivalent(B,C)),equivalent(B,A)),equivalent(C,D)),D)).
% 21.83/22.05 8 [hyper,7,1,7] {+} is_a_theorem(equivalent(A,A)).
% 21.83/22.05 9 [hyper,7,1,4] {-} is_a_theorem(equivalent(A,equivalent(equivalent(equivalent(B,equivalent(C,D)),equivalent(C,B)),equivalent(D,equivalent(A,equivalent(E,equivalent(equivalent(F,equivalent(G,E)),equivalent(G,F)))))))).
% 21.83/22.05 13 [hyper,8,1,3] {-} is_a_theorem(equivalent(equivalent(A,equivalent(B,equivalent(C,C))),equivalent(B,A))).
% 21.83/22.05 15 [hyper,13,1,7] {+} is_a_theorem(equivalent(equivalent(A,A),equivalent(B,B))).
% 21.83/22.05 17 [hyper,13,1,3] {-} is_a_theorem(equivalent(equivalent(A,equivalent(B,equivalent(equivalent(C,equivalent(D,equivalent(E,E))),equivalent(D,C)))),equivalent(B,A))).
% 21.83/22.05 19 [hyper,13,1,7] {-} is_a_theorem(equivalent(A,equivalent(equivalent(equivalent(B,equivalent(C,D)),equivalent(C,B)),equivalent(D,equivalent(A,equivalent(E,E)))))).
% 21.83/22.05 21 [hyper,13,1,3] {+} is_a_theorem(equivalent(equivalent(A,equivalent(A,B)),B)).
% 21.83/22.05 39 [hyper,21,1,13] {-} is_a_theorem(equivalent(A,equivalent(B,equivalent(B,equivalent(A,equivalent(C,C)))))).
% 21.83/22.05 42 [hyper,21,1,3] {-} is_a_theorem(equivalent(equivalent(A,equivalent(B,equivalent(equivalent(C,equivalent(C,D)),D))),equivalent(B,A))).
% 21.83/22.05 45 [hyper,15,1,3] {-} is_a_theorem(equivalent(equivalent(A,equivalent(B,equivalent(equivalent(C,C),equivalent(D,D)))),equivalent(B,A))).
% 21.83/22.05 78 [hyper,39,1,7] {-} is_a_theorem(equivalent(A,equivalent(equivalent(equivalent(B,equivalent(C,A)),equivalent(C,B)),equivalent(D,D)))).
% 21.83/22.05 143 [hyper,9,1,4] {-} is_a_theorem(equivalent(equivalent(equivalent(A,equivalent(B,C)),equivalent(B,A)),equivalent(equivalent(equivalent(D,equivalent(E,F)),equivalent(E,D)),equivalent(F,C)))).
% 21.83/22.05 297 [hyper,78,1,45] {-} is_a_theorem(equivalent(equivalent(equivalent(A,equivalent(B,C)),equivalent(B,A)),C)).
% 21.83/22.05 336 [hyper,297,1,3] {-} is_a_theorem(equivalent(equivalent(A,equivalent(B,equivalent(equivalent(equivalent(C,equivalent(D,E)),equivalent(D,C)),E))),equivalent(B,A))).
% 21.83/22.05 633 [hyper,19,1,4] {-} is_a_theorem(equivalent(equivalent(equivalent(A,equivalent(B,C)),equivalent(B,A)),equivalent(D,equivalent(D,C)))).
% 21.83/22.05 2535 [hyper,633,1,42] {-} is_a_theorem(equivalent(equivalent(A,equivalent(A,B)),equivalent(equivalent(C,equivalent(D,B)),equivalent(D,C)))).
% 21.83/22.05 3536 [hyper,2535,1,13] {+} is_a_theorem(equivalent(equivalent(A,equivalent(A,B)),equivalent(C,equivalent(C,B)))).
% 21.83/22.05 7853 [hyper,336,1,3] {-} is_a_theorem(equivalent(equivalent(A,equivalent(equivalent(equivalent(B,equivalent(C,A)),equivalent(C,B)),D)),D)).
% 21.83/22.05 8121 [hyper,7853,1,2535] {-} is_a_theorem(equivalent(A,equivalent(B,equivalent(A,equivalent(C,equivalent(C,B)))))).
% 21.83/22.05 8128 [hyper,7853,1,3] {+} is_a_theorem(equivalent(A,equivalent(B,equivalent(A,B)))).
% 21.83/22.05 8190 [hyper,8128,1,3] {-} is_a_theorem(equivalent(equivalent(A,equivalent(B,equivalent(C,equivalent(D,equivalent(C,D))))),equivalent(B,A))).
% 21.83/22.05 33162 [hyper,8190,1,8128] {-} is_a_theorem(equivalent(equivalent(A,equivalent(B,A)),B)).
% 21.83/22.05 33200 [hyper,8190,1,3536] {-} is_a_theorem(equivalent(A,equivalent(B,equivalent(B,equivalent(C,equivalent(A,C)))))).
% 21.83/22.05 33259 [hyper,8190,1,3] {-} is_a_theorem(equivalent(equivalent(equivalent(A,equivalent(B,A)),equivalent(B,C)),C)).
% 21.83/22.05 34875 [hyper,33200,1,17] {-} is_a_theorem(equivalent(equivalent(equivalent(A,B),equivalent(B,equivalent(C,C))),A)).
% 21.83/22.05 35301 [hyper,33259,1,33200] {-} is_a_theorem(equivalent(A,equivalent(B,equivalent(equivalent(C,equivalent(A,C)),B)))).
% 21.83/22.05 36638 [hyper,34875,1,143] {-} is_a_theorem(equivalent(equivalent(A,B),equivalent(equivalent(B,equivalent(A,C)),C))).
% 21.83/22.05 36710 [hyper,35301,1,7853] {-} is_a_theorem(equivalent(equivalent(A,equivalent(B,A)),equivalent(equivalent(C,equivalent(D,B)),equivalent(D,C)))).
% 21.83/22.05 48990 [hyper,36710,1,33162] {-} is_a_theorem(equivalent(equivalent(A,B),equivalent(B,A))).
% 21.83/22.05 49324 [hyper,48990,1,36638] {-} is_a_theorem(equivalent(equivalent(equivalent(A,equivalent(B,C)),C),equivalent(B,A))).
% 21.83/22.05 49466 [hyper,48990,1,8121] {-} is_a_theorem(equivalent(equivalent(A,equivalent(B,equivalent(C,equivalent(C,A)))),B)).
% 21.83/22.05 55041 [hyper,49466,1,36710] {-} is_a_theorem(equivalent(equivalent(A,equivalent(B,equivalent(C,B))),equivalent(A,C))).
% 21.83/22.05 67140 [hyper,55041,1,49324] {-} is_a_theorem(equivalent(equivalent(equivalent(equivalent(A,B),equivalent(B,C)),C),A)).
% 21.83/22.05 90819 [hyper,67140,1,49324] {-} is_a_theorem(equivalent(A,equivalent(equivalent(B,C),equivalent(C,equivalent(A,B))))).
% 21.83/22.05 105798 [hyper,90819,1,48990] {-} is_a_theorem(equivalent(equivalent(equivalent(A,B),equivalent(B,equivalent(C,A))),C)).
% 21.83/22.05 105896 [hyper,90819,1,4] {-} is_a_theorem(equivalent(equivalent(equivalent(A,B),C),equivalent(B,equivalent(A,C)))).
% 21.83/22.05 118394 [hyper,105896,1,105798] {-} is_a_theorem(equivalent(equivalent(A,equivalent(B,C)),equivalent(equivalent(C,A),B))).
% 21.83/22.05 131592 [hyper,118394,1,90819] {-} is_a_theorem(equivalent(equivalent(equivalent(A,equivalent(B,C)),B),equivalent(C,A))).
% 21.83/22.05 131593 [binary,131592.1,2.1] {-} $F.
% 21.83/22.05
% 21.83/22.05 % SZS output end Refutation
% 21.83/22.05 ------------ end of proof -------------
% 21.83/22.05
% 21.83/22.05
% 21.83/22.05 Search stopped by max_proofs option.
% 21.83/22.05
% 21.83/22.05
% 21.83/22.05 Search stopped by max_proofs option.
% 21.83/22.05
% 21.83/22.05 ============ end of search ============
% 21.83/22.05
% 21.83/22.05 ----------- soft-scott stats ----------
% 21.83/22.05
% 21.83/22.05 true clauses given 190 (14.9%)
% 21.83/22.05 false clauses given 1085
% 21.83/22.05
% 21.83/22.05 FALSE TRUE
% 21.83/22.05 12 61 23
% 21.83/22.05 16 2439 883
% 21.83/22.05 20 0 1594
% 21.83/22.05 tot: 2500 2500 (50.0% true)
% 21.83/22.05
% 21.83/22.05
% 21.83/22.05 Model 7 (0.00 seconds, 0 Inserts)
% 21.83/22.05
% 21.83/22.05 That finishes the proof of the theorem.
% 21.83/22.05
% 21.83/22.05 Process 13168 finished Sun Jul 3 11:14:01 2022
%------------------------------------------------------------------------------