TSTP Solution File: LCL125-1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : LCL125-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n029.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:05 EDT 2022
% Result : Unsatisfiable 79.03s 79.24s
% Output : Refutation 79.03s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : LCL125-1 : TPTP v8.1.0. Released v1.0.0.
% 0.07/0.13 % Command : sos-script %s
% 0.13/0.34 % Computer : n029.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Mon Jul 4 08:23:26 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.13/0.36 ----- Otter 3.2, August 2001 -----
% 0.13/0.36 The process was started by sandbox2 on n029.cluster.edu,
% 0.13/0.36 Mon Jul 4 08:23:26 2022
% 0.13/0.36 The command was "./sos". The process ID is 31448.
% 0.13/0.36
% 0.13/0.36 set(prolog_style_variables).
% 0.13/0.36 set(auto).
% 0.13/0.36 dependent: set(auto1).
% 0.13/0.36 dependent: set(process_input).
% 0.13/0.36 dependent: clear(print_kept).
% 0.13/0.36 dependent: clear(print_new_demod).
% 0.13/0.36 dependent: clear(print_back_demod).
% 0.13/0.36 dependent: clear(print_back_sub).
% 0.13/0.36 dependent: set(control_memory).
% 0.13/0.36 dependent: assign(max_mem, 12000).
% 0.13/0.36 dependent: assign(pick_given_ratio, 4).
% 0.13/0.36 dependent: assign(stats_level, 1).
% 0.13/0.36 dependent: assign(pick_semantic_ratio, 3).
% 0.13/0.36 dependent: assign(sos_limit, 5000).
% 0.13/0.36 dependent: assign(max_weight, 60).
% 0.13/0.36 clear(print_given).
% 0.13/0.36
% 0.13/0.36 list(usable).
% 0.13/0.36
% 0.13/0.36 SCAN INPUT: prop=0, horn=1, equality=0, symmetry=0, max_lits=3.
% 0.13/0.36
% 0.13/0.36 This is a Horn set without equality. The strategy will
% 0.13/0.36 be hyperresolution, with satellites in sos and nuclei
% 0.13/0.36 in usable.
% 0.13/0.36
% 0.13/0.36 dependent: set(hyper_res).
% 0.13/0.36 dependent: clear(order_hyper).
% 0.13/0.36
% 0.13/0.36 ------------> process usable:
% 0.13/0.36
% 0.13/0.36 ------------> process sos:
% 0.13/0.36
% 0.13/0.36 ======= end of input processing =======
% 0.20/0.39
% 0.20/0.39 Model 1 (0.00 seconds, 0 Inserts)
% 0.20/0.39
% 0.20/0.39 Stopped by limit on number of solutions
% 0.20/0.39
% 0.20/0.39
% 0.20/0.39 -------------- Softie stats --------------
% 0.20/0.39
% 0.20/0.39 UPDATE_STOP: 300
% 0.20/0.39 SFINDER_TIME_LIMIT: 2
% 0.20/0.39 SHORT_CLAUSE_CUTOFF: 4
% 0.20/0.39 number of clauses in intial UL: 2
% 0.20/0.39 number of clauses initially in problem: 4
% 0.20/0.39 percentage of clauses intially in UL: 50
% 0.20/0.39 percentage of distinct symbols occuring in initial UL: 100
% 0.20/0.39 percent of all initial clauses that are short: 100
% 0.20/0.39 absolute distinct symbol count: 6
% 0.20/0.39 distinct predicate count: 1
% 0.20/0.39 distinct function count: 1
% 0.20/0.39 distinct constant count: 4
% 0.20/0.39
% 0.20/0.39 ---------- no more Softie stats ----------
% 0.20/0.39
% 0.20/0.39
% 0.20/0.39
% 0.20/0.39 =========== start of search ===========
% 1.29/1.48
% 1.29/1.48
% 1.29/1.48 Changing weight limit from 60 to 36.
% 1.29/1.48
% 1.29/1.48 Model 2 (0.00 seconds, 0 Inserts)
% 1.29/1.48
% 1.29/1.48 Stopped by limit on number of solutions
% 1.29/1.48
% 1.29/1.48 Resetting weight limit to 36 after 105 givens.
% 1.29/1.48
% 13.07/13.29
% 13.07/13.29
% 13.07/13.29 Changing weight limit from 36 to 32.
% 13.07/13.29
% 13.07/13.29 Resetting weight limit to 32 after 280 givens.
% 13.07/13.29
% 15.46/15.65
% 15.46/15.65
% 15.46/15.65 Changing weight limit from 32 to 28.
% 15.46/15.65
% 15.46/15.65 Resetting weight limit to 28 after 320 givens.
% 15.46/15.65
% 19.42/19.62
% 19.42/19.62
% 19.42/19.62 Changing weight limit from 28 to 24.
% 19.42/19.62
% 19.42/19.62 Modelling stopped after 300 given clauses and 0.00 seconds
% 19.42/19.62
% 19.42/19.62
% 19.42/19.62 Resetting weight limit to 24 after 440 givens.
% 19.42/19.62
% 79.03/79.24
% 79.03/79.24 -- HEY sandbox2, WE HAVE A PROOF!! --
% 79.03/79.24
% 79.03/79.24 ----> UNIT CONFLICT at 77.69 sec ----> 325433 [binary,325432.1,2.1] {-} $F.
% 79.03/79.24
% 79.03/79.24 Length of proof is 37. Level of proof is 17.
% 79.03/79.24
% 79.03/79.24 ---------------- PROOF ----------------
% 79.03/79.24 % SZS status Unsatisfiable
% 79.03/79.24 % SZS output start Refutation
% 79.03/79.24
% 79.03/79.24 1 [] {+} -is_a_theorem(equivalent(A,B))| -is_a_theorem(A)|is_a_theorem(B).
% 79.03/79.24 2 [] {+} -is_a_theorem(equivalent(a,equivalent(a,equivalent(equivalent(b,c),equivalent(equivalent(b,e),equivalent(c,e)))))).
% 79.03/79.24 3 [] {-} is_a_theorem(equivalent(equivalent(equivalent(A,B),equivalent(C,B)),equivalent(A,C))).
% 79.03/79.24 4 [] {-} is_a_theorem(equivalent(A,equivalent(equivalent(A,equivalent(B,C)),equivalent(C,B)))).
% 79.03/79.24 5 [hyper,4,1,4] {-} is_a_theorem(equivalent(equivalent(equivalent(A,equivalent(equivalent(A,equivalent(B,C)),equivalent(C,B))),equivalent(D,E)),equivalent(E,D))).
% 79.03/79.24 6 [hyper,4,1,3] {-} is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(A,B),equivalent(C,B)),equivalent(A,C)),equivalent(D,E)),equivalent(E,D))).
% 79.03/79.24 9 [hyper,5,1,3] {-} is_a_theorem(equivalent(equivalent(equivalent(A,equivalent(B,C)),equivalent(C,B)),A)).
% 79.03/79.24 11 [hyper,9,1,4] {-} is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(A,equivalent(B,C)),equivalent(C,B)),A),equivalent(D,E)),equivalent(E,D))).
% 79.03/79.24 12 [hyper,9,1,3] {+} is_a_theorem(equivalent(A,A)).
% 79.03/79.24 15 [hyper,6,1,12] {-} is_a_theorem(equivalent(equivalent(A,B),equivalent(equivalent(A,C),equivalent(B,C)))).
% 79.03/79.24 19 [hyper,15,1,15] {-} is_a_theorem(equivalent(equivalent(equivalent(A,B),C),equivalent(equivalent(equivalent(A,D),equivalent(B,D)),C))).
% 79.03/79.24 20 [hyper,15,1,5] {-} is_a_theorem(equivalent(equivalent(equivalent(equivalent(A,equivalent(B,C)),equivalent(C,B)),D),equivalent(A,D))).
% 79.03/79.24 26 [hyper,15,1,3] {-} is_a_theorem(equivalent(equivalent(equivalent(equivalent(A,B),equivalent(C,B)),D),equivalent(equivalent(A,C),D))).
% 79.03/79.24 47 [hyper,19,1,15] {-} is_a_theorem(equivalent(equivalent(equivalent(A,B),equivalent(C,B)),equivalent(equivalent(A,D),equivalent(C,D)))).
% 79.03/79.24 49 [hyper,19,1,9] {-} is_a_theorem(equivalent(equivalent(equivalent(equivalent(A,equivalent(B,C)),D),equivalent(equivalent(C,B),D)),A)).
% 79.03/79.24 131 [hyper,26,1,26] {-} is_a_theorem(equivalent(equivalent(equivalent(A,B),C),equivalent(equivalent(A,D),equivalent(C,equivalent(D,B))))).
% 79.03/79.24 141 [hyper,26,1,19] {-} is_a_theorem(equivalent(equivalent(A,B),equivalent(equivalent(equivalent(A,C),equivalent(D,C)),equivalent(B,D)))).
% 79.03/79.24 295 [hyper,47,1,19] {-} is_a_theorem(equivalent(equivalent(equivalent(equivalent(A,B),C),equivalent(equivalent(D,B),C)),equivalent(equivalent(A,E),equivalent(D,E)))).
% 79.03/79.24 310 [hyper,49,1,47] {-} is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(A,equivalent(equivalent(B,C),D)),equivalent(C,B)),D),E),equivalent(A,E))).
% 79.03/79.24 320 [hyper,49,1,3] {-} is_a_theorem(equivalent(equivalent(equivalent(equivalent(A,equivalent(equivalent(B,C),D)),equivalent(C,B)),D),A)).
% 79.03/79.24 515 [hyper,131,1,26] {-} is_a_theorem(equivalent(equivalent(A,B),equivalent(equivalent(A,C),equivalent(equivalent(B,D),equivalent(C,D))))).
% 79.03/79.24 519 [hyper,131,1,20] {-} is_a_theorem(equivalent(A,equivalent(equivalent(A,B),equivalent(equivalent(C,D),equivalent(B,equivalent(D,C)))))).
% 79.03/79.24 520 [hyper,131,1,19] {-} is_a_theorem(equivalent(equivalent(equivalent(equivalent(A,B),C),equivalent(D,C)),equivalent(equivalent(A,E),equivalent(D,equivalent(E,B))))).
% 79.03/79.24 526 [hyper,131,1,11] {-} is_a_theorem(equivalent(equivalent(A,equivalent(B,equivalent(C,D))),equivalent(equivalent(A,equivalent(D,C)),B))).
% 79.03/79.24 539 [hyper,131,1,49] {-} is_a_theorem(equivalent(equivalent(equivalent(equivalent(A,equivalent(B,C)),D),E),equivalent(A,equivalent(E,equivalent(equivalent(C,B),D))))).
% 79.03/79.24 695 [hyper,141,1,15] {-} is_a_theorem(equivalent(equivalent(equivalent(A,B),C),equivalent(equivalent(equivalent(equivalent(A,D),equivalent(E,D)),equivalent(B,E)),C))).
% 79.03/79.24 1094 [hyper,320,1,131] {-} is_a_theorem(equivalent(equivalent(equivalent(equivalent(A,equivalent(equivalent(B,C),D)),equivalent(C,B)),E),equivalent(A,equivalent(E,D)))).
% 79.03/79.24 1576 [hyper,526,1,519] {-} is_a_theorem(equivalent(equivalent(A,equivalent(equivalent(B,equivalent(C,D)),equivalent(D,C))),equivalent(A,B))).
% 79.03/79.24 1578 [hyper,526,1,515] {-} is_a_theorem(equivalent(equivalent(equivalent(A,B),equivalent(equivalent(C,D),equivalent(B,D))),equivalent(A,C))).
% 79.03/79.24 29365 [hyper,1094,1,1094] {-} is_a_theorem(equivalent(equivalent(A,equivalent(equivalent(B,equivalent(C,D)),E)),equivalent(equivalent(A,equivalent(equivalent(D,C),E)),B))).
% 79.03/79.24 29395 [hyper,1094,1,310] {+} is_a_theorem(equivalent(A,equivalent(A,equivalent(B,B)))).
% 79.03/79.24 29692 [hyper,29395,1,1576] {-} is_a_theorem(equivalent(equivalent(A,equivalent(B,B)),A)).
% 79.03/79.24 29972 [hyper,29692,1,1578] {-} is_a_theorem(equivalent(equivalent(equivalent(A,B),equivalent(equivalent(C,C),B)),A)).
% 79.03/79.24 29994 [hyper,29692,1,695] {-} is_a_theorem(equivalent(equivalent(equivalent(equivalent(A,B),equivalent(C,B)),equivalent(equivalent(D,D),C)),A)).
% 79.03/79.24 30520 [hyper,29972,1,520] {-} is_a_theorem(equivalent(equivalent(equivalent(A,equivalent(equivalent(B,B),C)),D),equivalent(A,equivalent(D,C)))).
% 79.03/79.24 34891 [hyper,29994,1,295] {-} is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(A,equivalent(B,C)),equivalent(equivalent(D,D),B)),C),E),equivalent(A,E))).
% 79.03/79.24 40679 [hyper,30520,1,131] {-} is_a_theorem(equivalent(equivalent(equivalent(A,equivalent(equivalent(B,B),C)),D),equivalent(equivalent(A,equivalent(E,C)),equivalent(D,E)))).
% 79.03/79.24 321945 [hyper,40679,1,34891] {-} is_a_theorem(equivalent(A,equivalent(equivalent(equivalent(A,equivalent(B,C)),equivalent(D,B)),equivalent(C,D)))).
% 79.03/79.24 322852 [hyper,321945,1,29365] {-} is_a_theorem(equivalent(equivalent(A,equivalent(equivalent(B,C),equivalent(D,C))),equivalent(A,equivalent(B,D)))).
% 79.03/79.24 323136 [hyper,322852,1,1576] {-} is_a_theorem(equivalent(equivalent(equivalent(A,equivalent(B,C)),equivalent(equivalent(C,D),equivalent(B,D))),A)).
% 79.03/79.24 325432 [hyper,323136,1,539] {-} is_a_theorem(equivalent(A,equivalent(A,equivalent(equivalent(B,C),equivalent(equivalent(B,D),equivalent(C,D)))))).
% 79.03/79.24 325433 [binary,325432.1,2.1] {-} $F.
% 79.03/79.24
% 79.03/79.24 % SZS output end Refutation
% 79.03/79.24 ------------ end of proof -------------
% 79.03/79.24
% 79.03/79.24
% 79.03/79.24 Search stopped by max_proofs option.
% 79.03/79.24
% 79.03/79.24
% 79.03/79.24 Search stopped by max_proofs option.
% 79.03/79.24
% 79.03/79.24 ============ end of search ============
% 79.03/79.24
% 79.03/79.24 ----------- soft-scott stats ----------
% 79.03/79.24
% 79.03/79.24 true clauses given 614 (24.8%)
% 79.03/79.24 false clauses given 1858
% 79.03/79.24
% 79.03/79.24 FALSE TRUE
% 79.03/79.24 16 5 1
% 79.03/79.24 20 2330 2170
% 79.03/79.24 24 437 397
% 79.03/79.24 tot: 2772 2568 (48.1% true)
% 79.03/79.24
% 79.03/79.24
% 79.03/79.24 Model 2 (0.01 seconds, 0 Inserts)
% 79.03/79.24
% 79.03/79.24 That finishes the proof of the theorem.
% 79.03/79.24
% 79.03/79.24 Process 31448 finished Mon Jul 4 08:24:45 2022
%------------------------------------------------------------------------------