TSTP Solution File: LCL052-1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : LCL052-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n024.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:36 EDT 2022
% Result : Unsatisfiable 8.72s 8.94s
% Output : Refutation 8.72s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.07 % Problem : LCL052-1 : TPTP v8.1.0. Released v1.0.0.
% 0.02/0.07 % Command : sos-script %s
% 0.06/0.26 % Computer : n024.cluster.edu
% 0.06/0.26 % Model : x86_64 x86_64
% 0.06/0.26 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.06/0.26 % Memory : 8042.1875MB
% 0.06/0.26 % OS : Linux 3.10.0-693.el7.x86_64
% 0.06/0.26 % CPULimit : 300
% 0.06/0.26 % WCLimit : 600
% 0.06/0.26 % DateTime : Mon Jul 4 15:50:14 EDT 2022
% 0.06/0.26 % CPUTime :
% 0.10/0.27 ----- Otter 3.2, August 2001 -----
% 0.10/0.27 The process was started by sandbox on n024.cluster.edu,
% 0.10/0.27 Mon Jul 4 15:50:14 2022
% 0.10/0.27 The command was "./sos". The process ID is 16577.
% 0.10/0.27
% 0.10/0.27 set(prolog_style_variables).
% 0.10/0.27 set(auto).
% 0.10/0.27 dependent: set(auto1).
% 0.10/0.27 dependent: set(process_input).
% 0.10/0.27 dependent: clear(print_kept).
% 0.10/0.27 dependent: clear(print_new_demod).
% 0.10/0.27 dependent: clear(print_back_demod).
% 0.10/0.27 dependent: clear(print_back_sub).
% 0.10/0.27 dependent: set(control_memory).
% 0.10/0.27 dependent: assign(max_mem, 12000).
% 0.10/0.27 dependent: assign(pick_given_ratio, 4).
% 0.10/0.27 dependent: assign(stats_level, 1).
% 0.10/0.27 dependent: assign(pick_semantic_ratio, 3).
% 0.10/0.27 dependent: assign(sos_limit, 5000).
% 0.10/0.27 dependent: assign(max_weight, 60).
% 0.10/0.27 clear(print_given).
% 0.10/0.27
% 0.10/0.27 list(usable).
% 0.10/0.27
% 0.10/0.27 SCAN INPUT: prop=0, horn=1, equality=0, symmetry=0, max_lits=3.
% 0.10/0.27
% 0.10/0.27 This is a Horn set without equality. The strategy will
% 0.10/0.27 be hyperresolution, with satellites in sos and nuclei
% 0.10/0.27 in usable.
% 0.10/0.27
% 0.10/0.27 dependent: set(hyper_res).
% 0.10/0.27 dependent: clear(order_hyper).
% 0.10/0.27
% 0.10/0.27 ------------> process usable:
% 0.10/0.27
% 0.10/0.27 ------------> process sos:
% 0.10/0.27
% 0.10/0.27 ======= end of input processing =======
% 0.10/0.29
% 0.10/0.29 Model 1 (0.00 seconds, 0 Inserts)
% 0.10/0.29
% 0.10/0.29 Stopped by limit on number of solutions
% 0.10/0.29
% 0.10/0.29
% 0.10/0.29 -------------- Softie stats --------------
% 0.10/0.29
% 0.10/0.29 UPDATE_STOP: 300
% 0.10/0.29 SFINDER_TIME_LIMIT: 2
% 0.10/0.29 SHORT_CLAUSE_CUTOFF: 4
% 0.10/0.29 number of clauses in intial UL: 2
% 0.10/0.29 number of clauses initially in problem: 5
% 0.10/0.29 percentage of clauses intially in UL: 40
% 0.10/0.29 percentage of distinct symbols occuring in initial UL: 80
% 0.10/0.29 percent of all initial clauses that are short: 100
% 0.10/0.29 absolute distinct symbol count: 5
% 0.10/0.29 distinct predicate count: 1
% 0.10/0.29 distinct function count: 2
% 0.10/0.29 distinct constant count: 2
% 0.10/0.29
% 0.10/0.29 ---------- no more Softie stats ----------
% 0.10/0.29
% 0.10/0.29
% 0.10/0.29
% 0.10/0.29 =========== start of search ===========
% 1.34/1.59
% 1.34/1.59
% 1.34/1.59 Changing weight limit from 60 to 59.
% 1.34/1.59
% 1.34/1.59 Model 2 (0.00 seconds, 0 Inserts)
% 1.34/1.59
% 1.34/1.59 Stopped by limit on number of solutions
% 1.34/1.59
% 1.34/1.59 Model 3 (0.00 seconds, 0 Inserts)
% 1.34/1.59
% 1.34/1.59 Stopped by limit on number of solutions
% 1.34/1.59
% 1.34/1.59 Model 4 (0.00 seconds, 0 Inserts)
% 1.34/1.59
% 1.34/1.59 Stopped by limit on number of solutions
% 1.34/1.59
% 1.34/1.59 Model 5 [ 1 40 184714 ] (0.00 seconds, 187491 Inserts)
% 1.34/1.59
% 1.34/1.59 Model 6 [ 1 1 41 ] (0.00 seconds, 140715 Inserts)
% 1.34/1.59
% 1.34/1.59 Resetting weight limit to 59 after 160 givens.
% 1.34/1.59
% 3.70/3.88
% 3.70/3.88
% 3.70/3.88 Changing weight limit from 59 to 39.
% 3.70/3.88
% 3.70/3.88 Resetting weight limit to 39 after 220 givens.
% 3.70/3.88
% 4.04/4.24
% 4.04/4.24
% 4.04/4.24 Changing weight limit from 39 to 34.
% 4.04/4.24
% 4.04/4.24 Resetting weight limit to 34 after 230 givens.
% 4.04/4.24
% 4.18/4.42
% 4.18/4.42
% 4.18/4.42 Changing weight limit from 34 to 31.
% 4.18/4.42
% 4.18/4.42 Resetting weight limit to 31 after 235 givens.
% 4.18/4.42
% 4.64/4.86
% 4.64/4.86
% 4.64/4.86 Changing weight limit from 31 to 29.
% 4.64/4.86
% 4.64/4.86 Resetting weight limit to 29 after 250 givens.
% 4.64/4.86
% 8.41/8.59
% 8.41/8.59
% 8.41/8.59 Changing weight limit from 29 to 27.
% 8.41/8.59
% 8.41/8.59 Model 7 [ 1 0 132 ] (0.00 seconds, 211024 Inserts)
% 8.41/8.59
% 8.41/8.59 Model 8 [ 1 1 31 ] (0.00 seconds, 116487 Inserts)
% 8.41/8.59
% 8.41/8.59 Model 9 [ 1 1 575 ] (0.00 seconds, 160692 Inserts)
% 8.41/8.59
% 8.41/8.59 Resetting weight limit to 27 after 310 givens.
% 8.41/8.59
% 8.51/8.71
% 8.51/8.71
% 8.51/8.71 Changing weight limit from 27 to 25.
% 8.51/8.71
% 8.51/8.71 Resetting weight limit to 25 after 315 givens.
% 8.51/8.71
% 8.55/8.74
% 8.55/8.74
% 8.55/8.74 Changing weight limit from 25 to 24.
% 8.55/8.74
% 8.55/8.74 Resetting weight limit to 24 after 320 givens.
% 8.55/8.74
% 8.55/8.76
% 8.55/8.76
% 8.55/8.76 Changing weight limit from 24 to 23.
% 8.55/8.76
% 8.55/8.76 Resetting weight limit to 23 after 325 givens.
% 8.55/8.76
% 8.55/8.80
% 8.55/8.80
% 8.55/8.80 Changing weight limit from 23 to 22.
% 8.55/8.80
% 8.55/8.80 Resetting weight limit to 22 after 330 givens.
% 8.55/8.80
% 8.63/8.86
% 8.63/8.86
% 8.63/8.86 Changing weight limit from 22 to 21.
% 8.63/8.86
% 8.63/8.86 Resetting weight limit to 21 after 335 givens.
% 8.63/8.86
% 8.72/8.94
% 8.72/8.94 -------- PROOF --------
% 8.72/8.94 % SZS status Unsatisfiable
% 8.72/8.94 % SZS output start Refutation
% 8.72/8.94
% 8.72/8.94 ----> UNIT CONFLICT at 8.60 sec ----> 15250 [binary,15249.1,2.1] {+} $F.
% 8.72/8.94
% 8.72/8.94 Length of proof is 27. Level of proof is 15.
% 8.72/8.94
% 8.72/8.94 ---------------- PROOF ----------------
% 8.72/8.94 % SZS status Unsatisfiable
% 8.72/8.94 % SZS output start Refutation
% 8.72/8.94
% 8.72/8.94 1 [] {+} -is_a_theorem(implies(A,B))| -is_a_theorem(A)|is_a_theorem(B).
% 8.72/8.94 2 [] {+} -is_a_theorem(implies(implies(implies(a,b),a),a)).
% 8.72/8.94 3 [] {-} is_a_theorem(implies(implies(A,B),implies(implies(B,C),implies(A,C)))).
% 8.72/8.94 4 [] {+} is_a_theorem(implies(implies(not(A),A),A)).
% 8.72/8.94 5 [] {+} is_a_theorem(implies(A,implies(not(A),B))).
% 8.72/8.94 6 [hyper,3,1,3] {-} is_a_theorem(implies(implies(implies(implies(A,B),implies(C,B)),D),implies(implies(C,A),D))).
% 8.72/8.94 7 [hyper,4,1,3] {-} is_a_theorem(implies(implies(A,B),implies(implies(not(A),A),B))).
% 8.72/8.94 9 [hyper,5,1,3] {-} is_a_theorem(implies(implies(implies(not(A),B),C),implies(A,C))).
% 8.72/8.94 12 [hyper,7,1,7] {+} is_a_theorem(implies(implies(not(implies(A,B)),implies(A,B)),implies(implies(not(A),A),B))).
% 8.72/8.94 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))).
% 8.72/8.94 28 [hyper,9,1,7] {-} is_a_theorem(implies(implies(not(implies(implies(not(A),B),C)),implies(implies(not(A),B),C)),implies(A,C))).
% 8.72/8.94 29 [hyper,9,1,6] {-} is_a_theorem(implies(implies(A,not(B)),implies(B,implies(A,C)))).
% 8.72/8.94 31 [hyper,9,1,3] {-} is_a_theorem(implies(implies(implies(A,B),C),implies(implies(implies(not(A),D),B),C))).
% 8.72/8.94 34 [hyper,9,1,4] {+} is_a_theorem(implies(A,A)).
% 8.72/8.94 40 [hyper,29,1,9] {+} is_a_theorem(implies(A,implies(B,implies(not(A),C)))).
% 8.72/8.94 43 [hyper,29,1,3] {-} is_a_theorem(implies(implies(implies(A,implies(B,C)),D),implies(implies(B,not(A)),D))).
% 8.72/8.94 57 [hyper,40,1,3] {-} is_a_theorem(implies(implies(implies(A,implies(not(B),C)),D),implies(B,D))).
% 8.72/8.94 73 [hyper,57,1,3] {-} is_a_theorem(implies(A,implies(implies(implies(not(A),B),C),implies(D,C)))).
% 8.72/8.94 85 [hyper,73,1,34] {-} is_a_theorem(implies(implies(implies(not(implies(A,A)),B),C),implies(D,C))).
% 8.72/8.94 138 [hyper,12,1,85] {+} is_a_theorem(implies(A,implies(implies(not(B),B),B))).
% 8.72/8.94 249 [hyper,138,1,3] {-} is_a_theorem(implies(implies(implies(implies(not(A),A),A),B),implies(C,B))).
% 8.72/8.94 281 [hyper,249,1,6] {+} is_a_theorem(implies(implies(A,implies(not(B),B)),implies(C,implies(A,B)))).
% 8.72/8.94 7626 [hyper,281,1,281] {-} is_a_theorem(implies(A,implies(implies(B,implies(not(C),C)),implies(B,C)))).
% 8.72/8.94 7641 [hyper,281,1,43] {-} is_a_theorem(implies(implies(not(A),not(B)),implies(C,implies(B,A)))).
% 8.72/8.94 7698 [hyper,7641,1,281] {-} is_a_theorem(implies(A,implies(implies(not(B),not(C)),implies(C,B)))).
% 8.72/8.94 7725 [hyper,7698,1,7698] {-} is_a_theorem(implies(implies(not(A),not(B)),implies(B,A))).
% 8.72/8.94 7762 [hyper,7698,1,28] {+} is_a_theorem(implies(A,implies(B,A))).
% 8.72/8.94 8055 [hyper,7762,1,3] {+} is_a_theorem(implies(implies(implies(A,B),C),implies(B,C))).
% 8.72/8.94 8085 [hyper,7725,1,31] {-} is_a_theorem(implies(implies(implies(not(not(A)),B),not(C)),implies(C,A))).
% 8.72/8.94 10247 [hyper,8055,1,8085] {+} is_a_theorem(implies(not(A),implies(A,B))).
% 8.72/8.94 14994 [hyper,7626,1,21] {-} is_a_theorem(implies(implies(not(A),B),implies(implies(B,A),A))).
% 8.72/8.94 15249 [hyper,14994,1,10247] {-} is_a_theorem(implies(implies(implies(A,B),A),A)).
% 8.72/8.94 15250 [binary,15249.1,2.1] {+} $F.
% 8.72/8.94
% 8.72/8.94 % SZS output end Refutation
% 8.72/8.94 ------------ end of proof -------------
% 8.72/8.94
% 8.72/8.94
% 8.72/8.94 Search stopped by max_proofs option.
% 8.72/8.94
% 8.72/8.94
% 8.72/8.94 Search stopped by max_proofs option.
% 8.72/8.94
% 8.72/8.94 ============ end of search ============
% 8.72/8.94
% 8.72/8.94 ----------- soft-scott stats ----------
% 8.72/8.94
% 8.72/8.94 true clauses given 105 (30.0%)
% 8.72/8.94 false clauses given 245
% 8.72/8.94
% 8.72/8.94 FALSE TRUE
% 8.72/8.94 9 0 5
% 8.72/8.94 10 0 39
% 8.72/8.94 11 2 49
% 8.72/8.94 12 3 89
% 8.72/8.94 13 71 150
% 8.72/8.94 14 125 172
% 8.72/8.94 15 220 322
% 8.72/8.94 16 336 423
% 8.72/8.94 17 352 524
% 8.72/8.94 18 421 633
% 8.72/8.94 19 508 94
% 8.72/8.94 20 425 0
% 8.72/8.94 21 37 0
% 8.72/8.94 tot: 2500 2500 (50.0% true)
% 8.72/8.94
% 8.72/8.94
% 8.72/8.94 Model 9 [ 1 1 575 ] (0.00 seconds, 160692 Inserts)
% 8.72/8.94
% 8.72/8.94 That finishes the proof of the theorem.
% 8.72/8.94
% 8.72/8.94 Process 16577 finished Mon Jul 4 15:50:23 2022
%------------------------------------------------------------------------------