TSTP Solution File: LCL042-1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : LCL042-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:32 EDT 2022
% Result : Unsatisfiable 227.24s 227.41s
% Output : Refutation 227.24s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : LCL042-1 : TPTP v8.1.0. Released v1.0.0.
% 0.03/0.13 % Command : sos-script %s
% 0.12/0.34 % Computer : n028.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Mon Jul 4 21:18:35 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.12/0.35 ----- Otter 3.2, August 2001 -----
% 0.12/0.35 The process was started by sandbox on n028.cluster.edu,
% 0.12/0.35 Mon Jul 4 21:18:35 2022
% 0.12/0.35 The command was "./sos". The process ID is 21836.
% 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.19/0.39
% 0.19/0.39 Model 1 (0.00 seconds, 0 Inserts)
% 0.19/0.39
% 0.19/0.39 Stopped by limit on number of solutions
% 0.19/0.39
% 0.19/0.39
% 0.19/0.39 -------------- Softie stats --------------
% 0.19/0.39
% 0.19/0.39 UPDATE_STOP: 300
% 0.19/0.39 SFINDER_TIME_LIMIT: 2
% 0.19/0.39 SHORT_CLAUSE_CUTOFF: 4
% 0.19/0.39 number of clauses in intial UL: 2
% 0.19/0.39 number of clauses initially in problem: 7
% 0.19/0.39 percentage of clauses intially in UL: 28
% 0.19/0.39 percentage of distinct symbols occuring in initial UL: 83
% 0.19/0.39 percent of all initial clauses that are short: 100
% 0.19/0.39 absolute distinct symbol count: 6
% 0.19/0.39 distinct predicate count: 1
% 0.19/0.39 distinct function count: 2
% 0.19/0.39 distinct constant count: 3
% 0.19/0.39
% 0.19/0.39 ---------- no more Softie stats ----------
% 0.19/0.39
% 0.19/0.39
% 0.19/0.39
% 0.19/0.39 Model 2 (0.00 seconds, 0 Inserts)
% 0.19/0.39
% 0.19/0.39 Stopped by limit on number of solutions
% 0.19/0.39
% 0.19/0.39 =========== start of search ===========
% 10.81/11.01
% 10.81/11.01
% 10.81/11.01 Changing weight limit from 60 to 31.
% 10.81/11.01
% 10.81/11.01 Model 3 (0.00 seconds, 0 Inserts)
% 10.81/11.01
% 10.81/11.01 Stopped by limit on number of solutions
% 10.81/11.01
% 10.81/11.01 Model 4 (0.00 seconds, 0 Inserts)
% 10.81/11.01
% 10.81/11.01 Stopped by limit on number of solutions
% 10.81/11.01
% 10.81/11.01 Stopped by limit on insertions
% 10.81/11.01
% 10.81/11.01 Model 5 (0.00 seconds, 0 Inserts)
% 10.81/11.01
% 10.81/11.01 Stopped by limit on number of solutions
% 10.81/11.01
% 10.81/11.01 Stopped by limit on insertions
% 10.81/11.01
% 10.81/11.01 Stopped by limit on insertions
% 10.81/11.01
% 10.81/11.01 Model 6 [ 2 0 83 ] (0.00 seconds, 250000 Inserts)
% 10.81/11.01
% 10.81/11.01 Stopped by limit on insertions
% 10.81/11.01
% 10.81/11.01 Model 7 [ 4 1 6061 ] (0.00 seconds, 250000 Inserts)
% 10.81/11.01
% 10.81/11.01 Stopped by limit on insertions
% 10.81/11.01
% 10.81/11.01 Model 8 [ 1 1 9302 ] (0.00 seconds, 250000 Inserts)
% 10.81/11.01
% 10.81/11.01 Stopped by limit on insertions
% 10.81/11.01
% 10.81/11.01 Model 9 [ 3 1 1018 ] (0.00 seconds, 250000 Inserts)
% 10.81/11.01
% 10.81/11.01 Stopped by limit on insertions
% 10.81/11.01
% 10.81/11.01 Model 10 [ 3 1 5307 ] (0.00 seconds, 250000 Inserts)
% 10.81/11.01
% 10.81/11.01 Resetting weight limit to 31 after 130 givens.
% 10.81/11.01
% 11.79/12.01
% 11.79/12.01
% 11.79/12.01 Changing weight limit from 31 to 29.
% 11.79/12.01
% 11.79/12.01 Resetting weight limit to 29 after 350 givens.
% 11.79/12.01
% 11.85/12.05
% 11.85/12.05
% 11.85/12.05 Changing weight limit from 29 to 26.
% 11.85/12.05
% 11.85/12.05 Resetting weight limit to 26 after 355 givens.
% 11.85/12.05
% 11.89/12.09
% 11.89/12.09
% 11.89/12.09 Changing weight limit from 26 to 25.
% 11.89/12.09
% 11.89/12.09 Resetting weight limit to 25 after 360 givens.
% 11.89/12.09
% 12.02/12.20
% 12.02/12.20
% 12.02/12.20 Changing weight limit from 25 to 23.
% 12.02/12.20
% 12.02/12.20 Resetting weight limit to 23 after 365 givens.
% 12.02/12.20
% 12.08/12.26
% 12.08/12.26
% 12.08/12.26 Changing weight limit from 23 to 22.
% 12.08/12.26
% 12.08/12.26 Resetting weight limit to 22 after 375 givens.
% 12.08/12.26
% 12.08/12.30
% 12.08/12.30
% 12.08/12.30 Changing weight limit from 22 to 21.
% 12.08/12.30
% 12.08/12.30 Resetting weight limit to 21 after 380 givens.
% 12.08/12.30
% 12.18/12.39
% 12.18/12.39
% 12.18/12.39 Changing weight limit from 21 to 20.
% 12.18/12.39
% 12.18/12.39 Modelling stopped after 300 given clauses and 0.00 seconds
% 12.18/12.39
% 12.18/12.39
% 12.18/12.39 Resetting weight limit to 20 after 390 givens.
% 12.18/12.39
% 12.27/12.45
% 12.27/12.45
% 12.27/12.45 Changing weight limit from 20 to 19.
% 12.27/12.45
% 12.27/12.45 Resetting weight limit to 19 after 405 givens.
% 12.27/12.45
% 12.32/12.49
% 12.32/12.49
% 12.32/12.49 Changing weight limit from 19 to 18.
% 12.32/12.49
% 12.32/12.49 Resetting weight limit to 18 after 410 givens.
% 12.32/12.49
% 12.44/12.63
% 12.44/12.63
% 12.44/12.63 Changing weight limit from 18 to 17.
% 12.44/12.63
% 12.44/12.63 Resetting weight limit to 17 after 435 givens.
% 12.44/12.63
% 13.19/13.36
% 13.19/13.36
% 13.19/13.36 Changing weight limit from 17 to 16.
% 13.19/13.36
% 13.19/13.36 Resetting weight limit to 16 after 675 givens.
% 13.19/13.36
% 15.32/15.52
% 15.32/15.52
% 15.32/15.52 Changing weight limit from 16 to 15.
% 15.32/15.52
% 15.32/15.52 Resetting weight limit to 15 after 1285 givens.
% 15.32/15.52
% 227.24/227.41
% 227.24/227.41 -- HEY sandbox, WE HAVE A PROOF!! --
% 227.24/227.41
% 227.24/227.41 ----> UNIT CONFLICT at 199.22 sec ----> 405180 [binary,405179.1,2.1] {-} $F.
% 227.24/227.41
% 227.24/227.41 Length of proof is 43. Level of proof is 12.
% 227.24/227.41
% 227.24/227.41 ---------------- PROOF ----------------
% 227.24/227.41 % SZS status Unsatisfiable
% 227.24/227.41 % SZS output start Refutation
% 227.24/227.41
% 227.24/227.41 1 [] {+} -is_a_theorem(implies(A,B))| -is_a_theorem(A)|is_a_theorem(B).
% 227.24/227.41 2 [] {+} -is_a_theorem(implies(implies(a,implies(b,c)),implies(implies(a,b),implies(a,c)))).
% 227.24/227.41 3 [] {+} is_a_theorem(implies(A,implies(not(A),B))).
% 227.24/227.41 4 [] {+} is_a_theorem(implies(A,implies(B,A))).
% 227.24/227.41 5 [] {-} is_a_theorem(implies(implies(A,implies(B,C)),implies(B,implies(A,C)))).
% 227.24/227.41 6 [] {+} is_a_theorem(implies(implies(A,B),implies(implies(C,A),implies(C,B)))).
% 227.24/227.41 7 [] {-} is_a_theorem(implies(implies(A,B),implies(implies(not(A),B),B))).
% 227.24/227.41 9 [hyper,4,1,4] {+} is_a_theorem(implies(A,implies(B,implies(C,B)))).
% 227.24/227.41 15 [hyper,7,1,4] {-} is_a_theorem(implies(implies(not(A),implies(B,A)),implies(B,A))).
% 227.24/227.41 20 [hyper,15,1,3] {+} is_a_theorem(implies(not(not(A)),A)).
% 227.24/227.41 30 [hyper,5,1,7] {-} is_a_theorem(implies(implies(not(A),B),implies(implies(A,B),B))).
% 227.24/227.41 31 [hyper,5,1,4] {-} is_a_theorem(implies(A,implies(B,B))).
% 227.24/227.41 32 [hyper,5,1,3] {-} is_a_theorem(implies(not(A),implies(A,B))).
% 227.24/227.41 33 [hyper,31,1,31] {+} is_a_theorem(implies(A,A)).
% 227.24/227.41 36 [hyper,33,1,7] {+} is_a_theorem(implies(implies(not(A),A),A)).
% 227.24/227.41 37 [hyper,33,1,5] {+} is_a_theorem(implies(A,implies(implies(A,B),B))).
% 227.24/227.41 47 [hyper,6,1,6] {-} is_a_theorem(implies(implies(A,implies(B,C)),implies(A,implies(implies(D,B),implies(D,C))))).
% 227.24/227.41 48 [hyper,6,1,5] {-} is_a_theorem(implies(implies(A,B),implies(implies(B,C),implies(A,C)))).
% 227.24/227.41 51 [hyper,6,1,36] {+} is_a_theorem(implies(implies(A,implies(not(B),B)),implies(A,B))).
% 227.24/227.41 52 [hyper,6,1,32] {-} is_a_theorem(implies(implies(A,not(B)),implies(A,implies(B,C)))).
% 227.24/227.41 54 [hyper,6,1,15] {-} is_a_theorem(implies(implies(A,implies(not(B),implies(C,B))),implies(A,implies(C,B)))).
% 227.24/227.41 56 [hyper,6,1,5] {-} is_a_theorem(implies(implies(A,implies(B,implies(C,D))),implies(A,implies(C,implies(B,D))))).
% 227.24/227.41 57 [hyper,6,1,4] {-} is_a_theorem(implies(implies(A,B),implies(A,implies(C,B)))).
% 227.24/227.41 58 [hyper,6,1,3] {-} is_a_theorem(implies(implies(A,B),implies(A,implies(not(B),C)))).
% 227.24/227.41 95 [hyper,9,1,5] {+} is_a_theorem(implies(A,implies(B,implies(C,A)))).
% 227.24/227.41 109 [hyper,52,1,6] {+} is_a_theorem(implies(implies(A,implies(B,not(C))),implies(A,implies(B,implies(C,D))))).
% 227.24/227.41 211 [hyper,37,1,4] {-} is_a_theorem(implies(A,implies(B,implies(implies(B,C),C)))).
% 227.24/227.41 373 [hyper,30,1,32] {+} is_a_theorem(implies(implies(A,implies(A,B)),implies(A,B))).
% 227.24/227.41 1487 [hyper,57,1,95] {-} is_a_theorem(implies(A,implies(B,implies(C,implies(D,A))))).
% 227.24/227.41 1928 [hyper,47,1,373] {-} is_a_theorem(implies(implies(A,implies(A,B)),implies(implies(C,A),implies(C,B)))).
% 227.24/227.41 1934 [hyper,47,1,211] {-} is_a_theorem(implies(A,implies(implies(B,C),implies(B,implies(implies(C,D),D))))).
% 227.24/227.41 2108 [hyper,48,1,36] {+} is_a_theorem(implies(implies(A,B),implies(implies(not(A),A),B))).
% 227.24/227.41 2119 [hyper,48,1,20] {+} is_a_theorem(implies(implies(A,B),implies(not(not(A)),B))).
% 227.24/227.41 2939 [hyper,51,1,6] {+} is_a_theorem(implies(implies(A,implies(B,implies(not(C),C))),implies(A,implies(B,C)))).
% 227.24/227.41 3962 [hyper,56,1,6] {-} is_a_theorem(implies(implies(A,B),implies(C,implies(implies(C,A),B)))).
% 227.24/227.41 4469 [hyper,58,1,54] {-} is_a_theorem(implies(implies(not(A),B),implies(not(B),A))).
% 227.24/227.41 4808 [hyper,1487,1,4] {-} is_a_theorem(implies(A,implies(B,implies(C,implies(D,implies(E,B)))))).
% 227.24/227.41 14966 [hyper,109,1,4469] {-} is_a_theorem(implies(implies(not(not(A)),B),implies(not(B),implies(A,C)))).
% 227.24/227.41 41193 [hyper,2108,1,2119] {+} is_a_theorem(implies(implies(not(implies(A,B)),implies(A,B)),implies(not(not(A)),B))).
% 227.24/227.41 104260 [hyper,1928,1,56] {-} is_a_theorem(implies(implies(A,implies(A,B)),implies(C,implies(implies(C,A),B)))).
% 227.24/227.41 104520 [hyper,1934,1,56] {-} is_a_theorem(implies(A,implies(B,implies(implies(B,C),implies(implies(C,D),D))))).
% 227.24/227.41 144196 [hyper,2939,1,54] {-} is_a_theorem(implies(implies(not(A),implies(B,implies(not(A),A))),implies(B,A))).
% 227.24/227.41 203066 [hyper,104260,1,4808] {-} is_a_theorem(implies(A,implies(implies(A,B),implies(C,implies(D,implies(E,B)))))).
% 227.24/227.41 232638 [hyper,41193,1,104520] {-} is_a_theorem(implies(not(not(A)),implies(implies(A,B),implies(implies(B,C),C)))).
% 227.24/227.41 262823 [hyper,203066,1,144196] {-} is_a_theorem(implies(implies(not(implies(A,implies(B,C))),C),implies(A,implies(B,C)))).
% 227.24/227.41 289251 [hyper,232638,1,56] {-} is_a_theorem(implies(not(not(A)),implies(implies(B,C),implies(implies(A,B),C)))).
% 227.24/227.41 331842 [hyper,289251,1,14966] {-} is_a_theorem(implies(not(implies(implies(A,B),implies(implies(C,A),B))),implies(C,D))).
% 227.24/227.41 404249 [hyper,331842,1,262823] {-} is_a_theorem(implies(implies(A,implies(B,C)),implies(implies(B,A),implies(B,C)))).
% 227.24/227.41 404570 [hyper,404249,1,3962] {-} is_a_theorem(implies(implies(A,implies(B,C)),implies(A,implies(implies(A,B),C)))).
% 227.24/227.41 405179 [hyper,404570,1,56] {-} is_a_theorem(implies(implies(A,implies(B,C)),implies(implies(A,B),implies(A,C)))).
% 227.24/227.41 405180 [binary,405179.1,2.1] {-} $F.
% 227.24/227.41
% 227.24/227.41 % SZS output end Refutation
% 227.24/227.41 ------------ end of proof -------------
% 227.24/227.41
% 227.24/227.41
% 227.24/227.41 Search stopped by max_proofs option.
% 227.24/227.41
% 227.24/227.41
% 227.24/227.41 Search stopped by max_proofs option.
% 227.24/227.41
% 227.24/227.41 ============ end of search ============
% 227.24/227.41
% 227.24/227.41 ----------- soft-scott stats ----------
% 227.24/227.41
% 227.24/227.41 true clauses given 3654 (22.5%)
% 227.24/227.41 false clauses given 12610
% 227.24/227.41
% 227.24/227.41 FALSE TRUE
% 227.24/227.41 14 23 1
% 227.24/227.41 15 2520 1722
% 227.24/227.41 tot: 2543 1723 (40.4% true)
% 227.24/227.41
% 227.24/227.41
% 227.24/227.41 Model 10 [ 3 1 5307 ] (0.02 seconds, 250000 Inserts)
% 227.24/227.41
% 227.24/227.41 That finishes the proof of the theorem.
% 227.24/227.41
% 227.24/227.41 Process 21836 finished Mon Jul 4 21:22:22 2022
%------------------------------------------------------------------------------