TSTP Solution File: LCL372-1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : LCL372-1 : TPTP v8.1.0. Released v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n007.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:29:45 EDT 2022
% Result : Unsatisfiable 19.27s 19.47s
% Output : Refutation 19.27s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : LCL372-1 : TPTP v8.1.0. Released v2.3.0.
% 0.07/0.13 % Command : sos-script %s
% 0.13/0.34 % Computer : n007.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 : Sun Jul 3 01:19:10 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 n007.cluster.edu,
% 0.13/0.36 Sun Jul 3 01:19:10 2022
% 0.13/0.36 The command was "./sos". The process ID is 20030.
% 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.13/0.38
% 0.13/0.38 Model 1 (0.00 seconds, 0 Inserts)
% 0.13/0.38
% 0.13/0.38 Stopped by limit on number of solutions
% 0.13/0.38
% 0.13/0.38
% 0.13/0.38 -------------- Softie stats --------------
% 0.13/0.38
% 0.13/0.38 UPDATE_STOP: 300
% 0.13/0.38 SFINDER_TIME_LIMIT: 2
% 0.13/0.38 SHORT_CLAUSE_CUTOFF: 4
% 0.13/0.38 number of clauses in intial UL: 2
% 0.13/0.38 number of clauses initially in problem: 5
% 0.13/0.38 percentage of clauses intially in UL: 40
% 0.13/0.38 percentage of distinct symbols occuring in initial UL: 85
% 0.13/0.38 percent of all initial clauses that are short: 100
% 0.13/0.38 absolute distinct symbol count: 7
% 0.13/0.38 distinct predicate count: 1
% 0.13/0.38 distinct function count: 2
% 0.13/0.38 distinct constant count: 4
% 0.13/0.38
% 0.13/0.38 ---------- no more Softie stats ----------
% 0.13/0.38
% 0.13/0.38
% 0.13/0.38
% 0.13/0.38 =========== start of search ===========
% 9.76/9.97
% 9.76/9.97
% 9.76/9.97 Changing weight limit from 60 to 52.
% 9.76/9.97
% 9.76/9.97 Model 2 (0.00 seconds, 0 Inserts)
% 9.76/9.97
% 9.76/9.97 Stopped by limit on number of solutions
% 9.76/9.97
% 9.76/9.97 Model 3 (0.00 seconds, 0 Inserts)
% 9.76/9.97
% 9.76/9.97 Stopped by limit on number of solutions
% 9.76/9.97
% 9.76/9.97 Model 4 (0.00 seconds, 0 Inserts)
% 9.76/9.97
% 9.76/9.97 Stopped by limit on number of solutions
% 9.76/9.97
% 9.76/9.97 Stopped by limit on insertions
% 9.76/9.97
% 9.76/9.97 Model 5 [ 1 0 232 ] (0.00 seconds, 250000 Inserts)
% 9.76/9.97
% 9.76/9.97 Stopped by limit on insertions
% 9.76/9.97
% 9.76/9.97 Model 6 [ 1 5 24840 ] (0.00 seconds, 250000 Inserts)
% 9.76/9.97
% 9.76/9.97 Stopped by limit on insertions
% 9.76/9.97
% 9.76/9.97 Stopped by limit on insertions
% 9.76/9.97
% 9.76/9.97 Model 7 [ 1 1 2473 ] (0.00 seconds, 250000 Inserts)
% 9.76/9.97
% 9.76/9.97 Stopped by limit on insertions
% 9.76/9.97
% 9.76/9.97 Model 8 [ 1 43 141371 ] (0.00 seconds, 250000 Inserts)
% 9.76/9.97
% 9.76/9.97 Resetting weight limit to 52 after 125 givens.
% 9.76/9.97
% 18.37/18.56
% 18.37/18.56
% 18.37/18.56 Changing weight limit from 52 to 29.
% 18.37/18.56
% 18.37/18.56 Stopped by limit on insertions
% 18.37/18.56
% 18.37/18.56 Model 9 [ 1 1 1826 ] (0.00 seconds, 250000 Inserts)
% 18.37/18.56
% 18.37/18.56 Stopped by limit on insertions
% 18.37/18.56
% 18.37/18.56 Model 10 [ 7 2 11320 ] (0.00 seconds, 250000 Inserts)
% 18.37/18.56
% 18.37/18.56 Stopped by limit on insertions
% 18.37/18.56
% 18.37/18.56 Model 11 [ 2 1 1473 ] (0.00 seconds, 250000 Inserts)
% 18.37/18.56
% 18.37/18.56 Stopped by limit on insertions
% 18.37/18.56
% 18.37/18.56 Resetting weight limit to 29 after 340 givens.
% 18.37/18.56
% 18.37/18.62
% 18.37/18.62
% 18.37/18.62 Changing weight limit from 29 to 26.
% 18.37/18.62
% 18.37/18.62 Resetting weight limit to 26 after 345 givens.
% 18.37/18.62
% 18.53/18.72
% 18.53/18.72
% 18.53/18.72 Changing weight limit from 26 to 23.
% 18.53/18.72
% 18.53/18.72 Resetting weight limit to 23 after 355 givens.
% 18.53/18.72
% 18.63/18.82
% 18.63/18.82
% 18.63/18.82 Changing weight limit from 23 to 21.
% 18.63/18.82
% 18.63/18.82 Resetting weight limit to 21 after 365 givens.
% 18.63/18.82
% 18.76/18.95
% 18.76/18.95
% 18.76/18.95 Changing weight limit from 21 to 20.
% 18.76/18.95
% 18.76/18.95 Resetting weight limit to 20 after 385 givens.
% 18.76/18.95
% 18.90/19.08
% 18.90/19.08
% 18.90/19.08 Changing weight limit from 20 to 19.
% 18.90/19.08
% 18.90/19.08 Resetting weight limit to 19 after 410 givens.
% 18.90/19.08
% 18.98/19.22
% 18.98/19.22
% 18.98/19.22 Changing weight limit from 19 to 18.
% 18.98/19.22
% 18.98/19.22 Resetting weight limit to 18 after 440 givens.
% 18.98/19.22
% 19.27/19.46
% 19.27/19.46
% 19.27/19.46 Changing weight limit from 18 to 17.
% 19.27/19.46
% 19.27/19.46 Modelling stopped after 300 given clauses and 0.00 seconds
% 19.27/19.46
% 19.27/19.46
% 19.27/19.46 Resetting weight limit to 17 after 475 givens.
% 19.27/19.46
% 19.27/19.47
% 19.27/19.47 -- HEY sandbox2, WE HAVE A PROOF!! --
% 19.27/19.47
% 19.27/19.47 ----> UNIT CONFLICT at 19.03 sec ----> 21614 [binary,21613.1,2.1] {+} $F.
% 19.27/19.47
% 19.27/19.47 Length of proof is 31. Level of proof is 20.
% 19.27/19.47
% 19.27/19.47 ---------------- PROOF ----------------
% 19.27/19.47 % SZS status Unsatisfiable
% 19.27/19.47 % SZS output start Refutation
% 19.27/19.47
% 19.27/19.47 1 [] {+} -is_a_theorem(implies(A,B))| -is_a_theorem(A)|is_a_theorem(B).
% 19.27/19.47 2 [] {+} -is_a_theorem(implies(implies(implies(implies(x,y),y),z),implies(implies(implies(y,u),x),z))).
% 19.27/19.47 3 [] {-} is_a_theorem(implies(implies(A,B),implies(implies(B,C),implies(A,C)))).
% 19.27/19.47 4 [] {+} is_a_theorem(implies(implies(not(A),A),A)).
% 19.27/19.47 5 [] {+} is_a_theorem(implies(A,implies(not(A),B))).
% 19.27/19.47 6 [hyper,3,1,3] {-} is_a_theorem(implies(implies(implies(implies(A,B),implies(C,B)),D),implies(implies(C,A),D))).
% 19.27/19.47 7 [hyper,4,1,3] {-} is_a_theorem(implies(implies(A,B),implies(implies(not(A),A),B))).
% 19.27/19.47 9 [hyper,5,1,3] {-} is_a_theorem(implies(implies(implies(not(A),B),C),implies(A,C))).
% 19.27/19.47 12 [hyper,7,1,7] {+} is_a_theorem(implies(implies(not(implies(A,B)),implies(A,B)),implies(implies(not(A),A),B))).
% 19.27/19.47 17 [hyper,7,1,3] {-} is_a_theorem(implies(implies(not(implies(A,B)),implies(A,B)),implies(implies(B,C),implies(A,C)))).
% 19.27/19.47 21 [hyper,6,1,7] {+} is_a_theorem(implies(implies(not(implies(implies(implies(A,B),implies(C,B)),D)),implies(implies(implies(A,B),implies(C,B)),D)),implies(implies(C,A),D))).
% 19.27/19.47 29 [hyper,9,1,6] {-} is_a_theorem(implies(implies(A,not(B)),implies(B,implies(A,C)))).
% 19.27/19.47 34 [hyper,9,1,4] {+} is_a_theorem(implies(A,A)).
% 19.27/19.47 40 [hyper,29,1,9] {+} is_a_theorem(implies(A,implies(B,implies(not(A),C)))).
% 19.27/19.47 43 [hyper,29,1,3] {-} is_a_theorem(implies(implies(implies(A,implies(B,C)),D),implies(implies(B,not(A)),D))).
% 19.27/19.47 57 [hyper,40,1,3] {-} is_a_theorem(implies(implies(implies(A,implies(not(B),C)),D),implies(B,D))).
% 19.27/19.47 73 [hyper,57,1,3] {-} is_a_theorem(implies(A,implies(implies(implies(not(A),B),C),implies(D,C)))).
% 19.27/19.47 85 [hyper,73,1,34] {-} is_a_theorem(implies(implies(implies(not(implies(A,A)),B),C),implies(D,C))).
% 19.27/19.47 138 [hyper,12,1,85] {+} is_a_theorem(implies(A,implies(implies(not(B),B),B))).
% 19.27/19.47 249 [hyper,138,1,3] {-} is_a_theorem(implies(implies(implies(implies(not(A),A),A),B),implies(C,B))).
% 19.27/19.47 281 [hyper,249,1,6] {-} is_a_theorem(implies(implies(A,implies(not(B),B)),implies(C,implies(A,B)))).
% 19.27/19.47 745 [hyper,281,1,281] {-} is_a_theorem(implies(A,implies(implies(B,implies(not(C),C)),implies(B,C)))).
% 19.27/19.47 752 [hyper,281,1,57] {-} is_a_theorem(implies(A,implies(B,implies(C,A)))).
% 19.27/19.47 774 [hyper,752,1,281] {+} is_a_theorem(implies(A,implies(B,implies(C,B)))).
% 19.27/19.47 855 [hyper,774,1,17] {+} is_a_theorem(implies(implies(implies(A,B),C),implies(B,C))).
% 19.27/19.47 2145 [hyper,43,1,281] {-} is_a_theorem(implies(implies(not(A),not(B)),implies(C,implies(B,A)))).
% 19.27/19.47 2888 [hyper,2145,1,855] {-} is_a_theorem(implies(not(A),implies(B,implies(A,C)))).
% 19.27/19.47 2924 [hyper,2888,1,281] {-} is_a_theorem(implies(A,implies(not(B),implies(B,C)))).
% 19.27/19.47 2939 [hyper,2924,1,2924] {+} is_a_theorem(implies(not(A),implies(A,B))).
% 19.27/19.47 11820 [hyper,745,1,21] {-} is_a_theorem(implies(implies(not(A),B),implies(implies(B,A),A))).
% 19.27/19.47 12062 [hyper,11820,1,855] {+} is_a_theorem(implies(A,implies(implies(A,B),B))).
% 19.27/19.47 12171 [hyper,11820,1,2939] {+} is_a_theorem(implies(implies(implies(A,B),A),A)).
% 19.27/19.47 12331 [hyper,12062,1,12171] {-} is_a_theorem(implies(implies(implies(implies(implies(A,B),A),A),C),C)).
% 19.27/19.47 17607 [hyper,12331,1,6] {-} is_a_theorem(implies(implies(A,implies(implies(B,C),B)),implies(A,B))).
% 19.27/19.47 20321 [hyper,17607,1,6] {-} is_a_theorem(implies(implies(implies(A,B),C),implies(implies(C,A),A))).
% 19.27/19.47 21613 [hyper,20321,1,3] {-} is_a_theorem(implies(implies(implies(implies(A,B),B),C),implies(implies(implies(B,D),A),C))).
% 19.27/19.47 21614 [binary,21613.1,2.1] {+} $F.
% 19.27/19.47
% 19.27/19.47 % SZS output end Refutation
% 19.27/19.47 ------------ end of proof -------------
% 19.27/19.47
% 19.27/19.47
% 19.27/19.47 Search stopped by max_proofs option.
% 19.27/19.47
% 19.27/19.47
% 19.27/19.47 Search stopped by max_proofs option.
% 19.27/19.47
% 19.27/19.47 ============ end of search ============
% 19.27/19.47
% 19.27/19.47 ----------- soft-scott stats ----------
% 19.27/19.47
% 19.27/19.47 true clauses given 157 (32.8%)
% 19.27/19.47 false clauses given 321
% 19.27/19.47
% 19.27/19.47 FALSE TRUE
% 19.27/19.47 10 0 31
% 19.27/19.47 11 0 115
% 19.27/19.47 12 8 300
% 19.27/19.47 13 220 484
% 19.27/19.47 14 449 926
% 19.27/19.47 15 597 651
% 19.27/19.47 16 825 13
% 19.27/19.47 17 412 13
% 19.27/19.47 tot: 2511 2533 (50.2% true)
% 19.27/19.47
% 19.27/19.47
% 19.27/19.47 Model 11 [ 2 -185 1473 ] (0.00 seconds, 250000 Inserts)
% 19.27/19.47
% 19.27/19.47 That finishes the proof of the theorem.
% 19.27/19.47
% 19.27/19.47 Process 20030 finished Sun Jul 3 01:19:29 2022
%------------------------------------------------------------------------------