TSTP Solution File: LCL050-1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : LCL050-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n021.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:35 EDT 2022
% Result : Unsatisfiable 21.47s 21.66s
% Output : Refutation 21.47s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : LCL050-1 : TPTP v8.1.0. Released v1.0.0.
% 0.07/0.13 % Command : sos-script %s
% 0.13/0.34 % Computer : n021.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 03:08:16 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 sandbox on n021.cluster.edu,
% 0.13/0.36 Mon Jul 4 03:08:16 2022
% 0.13/0.36 The command was "./sos". The process ID is 2879.
% 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.38
% 0.20/0.38 Model 1 (0.00 seconds, 0 Inserts)
% 0.20/0.38
% 0.20/0.38 Stopped by limit on number of solutions
% 0.20/0.38
% 0.20/0.38
% 0.20/0.38 -------------- Softie stats --------------
% 0.20/0.38
% 0.20/0.38 UPDATE_STOP: 300
% 0.20/0.38 SFINDER_TIME_LIMIT: 2
% 0.20/0.38 SHORT_CLAUSE_CUTOFF: 4
% 0.20/0.38 number of clauses in intial UL: 2
% 0.20/0.38 number of clauses initially in problem: 5
% 0.20/0.38 percentage of clauses intially in UL: 40
% 0.20/0.38 percentage of distinct symbols occuring in initial UL: 83
% 0.20/0.38 percent of all initial clauses that are short: 100
% 0.20/0.38 absolute distinct symbol count: 6
% 0.20/0.38 distinct predicate count: 1
% 0.20/0.38 distinct function count: 2
% 0.20/0.38 distinct constant count: 3
% 0.20/0.38
% 0.20/0.38 ---------- no more Softie stats ----------
% 0.20/0.38
% 0.20/0.38
% 0.20/0.38
% 0.20/0.38 =========== start of search ===========
% 14.46/14.67
% 14.46/14.67
% 14.46/14.67 Changing weight limit from 60 to 45.
% 14.46/14.67
% 14.46/14.67 Model 2 (0.00 seconds, 0 Inserts)
% 14.46/14.67
% 14.46/14.67 Stopped by limit on number of solutions
% 14.46/14.67
% 14.46/14.67 Model 3 (0.00 seconds, 0 Inserts)
% 14.46/14.67
% 14.46/14.67 Stopped by limit on number of solutions
% 14.46/14.67
% 14.46/14.67 Stopped by limit on insertions
% 14.46/14.67
% 14.46/14.67 Model 4 [ 1 1 2086 ] (0.00 seconds, 250000 Inserts)
% 14.46/14.67
% 14.46/14.67 Stopped by limit on insertions
% 14.46/14.67
% 14.46/14.67 Model 5 [ 1 0 1298 ] (0.00 seconds, 250000 Inserts)
% 14.46/14.67
% 14.46/14.67 Model 6 (0.00 seconds, 250000 Inserts)
% 14.46/14.67
% 14.46/14.67 Stopped by limit on number of solutions
% 14.46/14.67
% 14.46/14.67 Stopped by limit on insertions
% 14.46/14.67
% 14.46/14.67 Model 7 [ 1 0 40 ] (0.00 seconds, 250000 Inserts)
% 14.46/14.67
% 14.46/14.67 Stopped by limit on insertions
% 14.46/14.67
% 14.46/14.67 Model 8 [ 1 1 740 ] (0.00 seconds, 250000 Inserts)
% 14.46/14.67
% 14.46/14.67 Stopped by limit on insertions
% 14.46/14.67
% 14.46/14.67 Stopped by limit on insertions
% 14.46/14.67
% 14.46/14.67 Model 9 [ 3 0 294 ] (0.00 seconds, 250000 Inserts)
% 14.46/14.67
% 14.46/14.67 Stopped by limit on insertions
% 14.46/14.67
% 14.46/14.67 Model 10 [ 5 1 2927 ] (0.00 seconds, 250000 Inserts)
% 14.46/14.67
% 14.46/14.67 Stopped by limit on insertions
% 14.46/14.67
% 14.46/14.67 Model 11 [ 4 1 263 ] (0.00 seconds, 250000 Inserts)
% 14.46/14.67
% 14.46/14.67 Resetting weight limit to 45 after 155 givens.
% 14.46/14.67
% 18.08/18.27
% 18.08/18.27
% 18.08/18.27 Changing weight limit from 45 to 31.
% 18.08/18.27
% 18.08/18.27 Stopped by limit on insertions
% 18.08/18.27
% 18.08/18.27 Model 12 [ 6 0 878 ] (0.00 seconds, 250000 Inserts)
% 18.08/18.27
% 18.08/18.27 Resetting weight limit to 31 after 255 givens.
% 18.08/18.27
% 18.17/18.36
% 18.17/18.36
% 18.17/18.36 Changing weight limit from 31 to 25.
% 18.17/18.36
% 18.17/18.36 Resetting weight limit to 25 after 275 givens.
% 18.17/18.36
% 18.17/18.37
% 18.17/18.37
% 18.17/18.37 Changing weight limit from 25 to 23.
% 18.17/18.37
% 18.17/18.37 Resetting weight limit to 23 after 280 givens.
% 18.17/18.37
% 18.17/18.39
% 18.17/18.39
% 18.17/18.39 Changing weight limit from 23 to 20.
% 18.17/18.39
% 18.17/18.39 Resetting weight limit to 20 after 285 givens.
% 18.17/18.39
% 18.17/18.40
% 18.17/18.40
% 18.17/18.40 Changing weight limit from 20 to 19.
% 18.17/18.40
% 18.17/18.40 Resetting weight limit to 19 after 290 givens.
% 18.17/18.40
% 18.31/18.49
% 18.31/18.49
% 18.31/18.49 Changing weight limit from 19 to 18.
% 18.31/18.49
% 18.31/18.49 Resetting weight limit to 18 after 300 givens.
% 18.31/18.49
% 18.49/18.68
% 18.49/18.68
% 18.49/18.68 Changing weight limit from 18 to 17.
% 18.49/18.68
% 18.49/18.68 Resetting weight limit to 17 after 350 givens.
% 18.49/18.68
% 21.47/21.66
% 21.47/21.66 -- HEY sandbox, WE HAVE A PROOF!! --
% 21.47/21.66
% 21.47/21.66 Stopped by limit on insertions
% 21.47/21.66
% 21.47/21.66 Model 13 [ 5 2 3266 ] (0.00 seconds, 250000 Inserts)
% 21.47/21.66
% 21.47/21.66 Modelling stopped after 300 given clauses and 0.00 seconds
% 21.47/21.66
% 21.47/21.66
% 21.47/21.66 ----> UNIT CONFLICT at 21.21 sec ----> 19774 [binary,19773.1,2.1] {+} $F.
% 21.47/21.66
% 21.47/21.66 Length of proof is 30. Level of proof is 19.
% 21.47/21.66
% 21.47/21.66 ---------------- PROOF ----------------
% 21.47/21.66 % SZS status Unsatisfiable
% 21.47/21.66 % SZS output start Refutation
% 21.47/21.66
% 21.47/21.66 1 [] {+} -is_a_theorem(implies(A,B))| -is_a_theorem(A)|is_a_theorem(B).
% 21.47/21.66 2 [] {+} -is_a_theorem(implies(implies(a,implies(b,c)),implies(b,implies(a,c)))).
% 21.47/21.66 3 [] {-} is_a_theorem(implies(implies(A,B),implies(implies(B,C),implies(A,C)))).
% 21.47/21.66 4 [] {+} is_a_theorem(implies(implies(not(A),A),A)).
% 21.47/21.66 5 [] {+} is_a_theorem(implies(A,implies(not(A),B))).
% 21.47/21.66 6 [hyper,3,1,3] {-} is_a_theorem(implies(implies(implies(implies(A,B),implies(C,B)),D),implies(implies(C,A),D))).
% 21.47/21.66 7 [hyper,4,1,3] {-} is_a_theorem(implies(implies(A,B),implies(implies(not(A),A),B))).
% 21.47/21.66 9 [hyper,5,1,3] {-} is_a_theorem(implies(implies(implies(not(A),B),C),implies(A,C))).
% 21.47/21.66 12 [hyper,7,1,7] {-} is_a_theorem(implies(implies(not(implies(A,B)),implies(A,B)),implies(implies(not(A),A),B))).
% 21.47/21.66 17 [hyper,7,1,3] {-} is_a_theorem(implies(implies(not(implies(A,B)),implies(A,B)),implies(implies(B,C),implies(A,C)))).
% 21.47/21.66 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))).
% 21.47/21.66 22 [hyper,6,1,6] {-} is_a_theorem(implies(implies(A,implies(B,C)),implies(implies(D,B),implies(A,implies(D,C))))).
% 21.47/21.66 29 [hyper,9,1,6] {-} is_a_theorem(implies(implies(A,not(B)),implies(B,implies(A,C)))).
% 21.47/21.66 34 [hyper,9,1,4] {+} is_a_theorem(implies(A,A)).
% 21.47/21.66 36 [hyper,34,1,5] {+} is_a_theorem(implies(not(implies(A,A)),B)).
% 21.47/21.66 46 [hyper,29,1,9] {-} is_a_theorem(implies(A,implies(B,implies(not(A),C)))).
% 21.47/21.66 49 [hyper,29,1,3] {-} is_a_theorem(implies(implies(implies(A,implies(B,C)),D),implies(implies(B,not(A)),D))).
% 21.47/21.66 50 [hyper,29,1,36] {+} is_a_theorem(implies(A,implies(not(implies(B,B)),C))).
% 21.47/21.66 58 [hyper,46,1,3] {-} is_a_theorem(implies(implies(implies(A,implies(not(B),C)),D),implies(B,D))).
% 21.47/21.66 95 [hyper,50,1,3] {+} is_a_theorem(implies(implies(implies(not(implies(A,A)),B),C),implies(D,C))).
% 21.47/21.66 1011 [hyper,95,1,12] {+} is_a_theorem(implies(A,implies(implies(not(B),B),B))).
% 21.47/21.66 1227 [hyper,1011,1,22] {-} is_a_theorem(implies(implies(A,implies(not(B),B)),implies(C,implies(A,B)))).
% 21.47/21.66 1928 [hyper,1227,1,58] {-} is_a_theorem(implies(A,implies(B,implies(C,A)))).
% 21.47/21.66 1930 [hyper,1227,1,49] {-} is_a_theorem(implies(implies(not(A),not(B)),implies(C,implies(B,A)))).
% 21.47/21.66 1962 [hyper,1928,1,1227] {+} is_a_theorem(implies(A,implies(B,implies(C,B)))).
% 21.47/21.66 2081 [hyper,1962,1,17] {-} is_a_theorem(implies(implies(implies(A,B),C),implies(B,C))).
% 21.47/21.66 3122 [hyper,1930,1,2081] {-} is_a_theorem(implies(not(A),implies(B,implies(A,C)))).
% 21.47/21.66 3154 [hyper,3122,1,1227] {-} is_a_theorem(implies(A,implies(not(B),implies(B,C)))).
% 21.47/21.66 3215 [hyper,3154,1,17] {+} is_a_theorem(implies(implies(implies(A,B),C),implies(not(A),C))).
% 21.47/21.66 16553 [hyper,3215,1,1227] {-} is_a_theorem(implies(A,implies(implies(implies(B,C),B),B))).
% 21.47/21.66 16655 [hyper,16553,1,21] {-} is_a_theorem(implies(implies(A,implies(A,B)),implies(A,B))).
% 21.47/21.66 16812 [hyper,16655,1,1227] {-} is_a_theorem(implies(implies(A,implies(not(B),B)),implies(A,B))).
% 21.47/21.66 18328 [hyper,16812,1,6] {-} is_a_theorem(implies(implies(not(A),B),implies(implies(B,A),A))).
% 21.47/21.66 19514 [hyper,18328,1,2081] {-} is_a_theorem(implies(A,implies(implies(A,B),B))).
% 21.47/21.66 19773 [hyper,19514,1,22] {-} is_a_theorem(implies(implies(A,implies(B,C)),implies(B,implies(A,C)))).
% 21.47/21.66 19774 [binary,19773.1,2.1] {+} $F.
% 21.47/21.66
% 21.47/21.66 % SZS output end Refutation
% 21.47/21.66 ------------ end of proof -------------
% 21.47/21.66
% 21.47/21.66
% 21.47/21.66 Search stopped by max_proofs option.
% 21.47/21.66
% 21.47/21.66
% 21.47/21.66 Search stopped by max_proofs option.
% 21.47/21.66
% 21.47/21.66 ============ end of search ============
% 21.47/21.66
% 21.47/21.66 ----------- soft-scott stats ----------
% 21.47/21.66
% 21.47/21.66 true clauses given 125 (23.0%)
% 21.47/21.66 false clauses given 418
% 21.47/21.66
% 21.47/21.66 FALSE TRUE
% 21.47/21.66 10 5 2
% 21.47/21.66 11 8 54
% 21.47/21.66 12 264 174
% 21.47/21.66 13 608 254
% 21.47/21.66 14 912 452
% 21.47/21.66 15 847 594
% 21.47/21.66 16 45 930
% 21.47/21.66 17 51 75
% 21.47/21.66 tot: 2740 2535 (48.1% true)
% 21.47/21.66
% 21.47/21.66
% 21.47/21.66 Model 13 [ 5 2 3266 ] (0.00 seconds, 250000 Inserts)
% 21.47/21.66
% 21.47/21.66 That finishes the proof of the theorem.
% 21.47/21.66
% 21.47/21.66 Process 2879 finished Mon Jul 4 03:08:37 2022
%------------------------------------------------------------------------------