TSTP Solution File: LCL056-1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : LCL056-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n027.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:38 EDT 2022
% Result : Unsatisfiable 1.91s 2.11s
% Output : Refutation 1.91s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : LCL056-1 : TPTP v8.1.0. Released v1.0.0.
% 0.04/0.13 % Command : sos-script %s
% 0.12/0.34 % Computer : n027.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 : Sat Jul 2 12:01:38 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 n027.cluster.edu,
% 0.12/0.35 Sat Jul 2 12:01:38 2022
% 0.12/0.35 The command was "./sos". The process ID is 9529.
% 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.36 dependent: clear(print_back_sub).
% 0.12/0.36 dependent: set(control_memory).
% 0.12/0.36 dependent: assign(max_mem, 12000).
% 0.12/0.36 dependent: assign(pick_given_ratio, 4).
% 0.12/0.36 dependent: assign(stats_level, 1).
% 0.12/0.36 dependent: assign(pick_semantic_ratio, 3).
% 0.12/0.36 dependent: assign(sos_limit, 5000).
% 0.12/0.36 dependent: assign(max_weight, 60).
% 0.12/0.36 clear(print_given).
% 0.12/0.36
% 0.12/0.36 list(usable).
% 0.12/0.36
% 0.12/0.36 SCAN INPUT: prop=0, horn=1, equality=0, symmetry=0, max_lits=3.
% 0.12/0.36
% 0.12/0.36 This is a Horn set without equality. The strategy will
% 0.12/0.36 be hyperresolution, with satellites in sos and nuclei
% 0.12/0.36 in usable.
% 0.12/0.36
% 0.12/0.36 dependent: set(hyper_res).
% 0.12/0.36 dependent: clear(order_hyper).
% 0.12/0.36
% 0.12/0.36 ------------> process usable:
% 0.12/0.36
% 0.12/0.36 ------------> process sos:
% 0.12/0.36
% 0.12/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: 100
% 0.20/0.38 percent of all initial clauses that are short: 100
% 0.20/0.38 absolute distinct symbol count: 4
% 0.20/0.38 distinct predicate count: 1
% 0.20/0.38 distinct function count: 2
% 0.20/0.38 distinct constant count: 1
% 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 ===========
% 0.87/1.08
% 0.87/1.08
% 0.87/1.08 Changing weight limit from 60 to 49.
% 0.87/1.08
% 0.87/1.08 Model 2 (0.00 seconds, 0 Inserts)
% 0.87/1.08
% 0.87/1.08 Stopped by limit on number of solutions
% 0.87/1.08
% 0.87/1.08 Model 3 (0.00 seconds, 0 Inserts)
% 0.87/1.08
% 0.87/1.08 Stopped by limit on number of solutions
% 0.87/1.08
% 0.87/1.08 Model 4 (0.00 seconds, 0 Inserts)
% 0.87/1.08
% 0.87/1.08 Stopped by limit on number of solutions
% 0.87/1.08
% 0.87/1.08 Model 5 [ 1 1 299 ] (0.00 seconds, 215424 Inserts)
% 0.87/1.08
% 0.87/1.08 Resetting weight limit to 49 after 140 givens.
% 0.87/1.08
% 1.91/2.11
% 1.91/2.11 -------- PROOF --------
% 1.91/2.11 % SZS status Unsatisfiable
% 1.91/2.11 % SZS output start Refutation
% 1.91/2.11
% 1.91/2.11 ----> UNIT CONFLICT at 1.71 sec ----> 5964 [binary,5963.1,2.1] {-} $F.
% 1.91/2.11
% 1.91/2.11 Length of proof is 25. Level of proof is 16.
% 1.91/2.11
% 1.91/2.11 ---------------- PROOF ----------------
% 1.91/2.11 % SZS status Unsatisfiable
% 1.91/2.11 % SZS output start Refutation
% 1.91/2.11
% 1.91/2.11 1 [] {+} -is_a_theorem(implies(A,B))| -is_a_theorem(A)|is_a_theorem(B).
% 1.91/2.11 2 [] {+} -is_a_theorem(implies(not(not(a)),a)).
% 1.91/2.11 3 [] {-} is_a_theorem(implies(implies(A,B),implies(implies(B,C),implies(A,C)))).
% 1.91/2.11 4 [] {+} is_a_theorem(implies(implies(not(A),A),A)).
% 1.91/2.11 5 [] {+} is_a_theorem(implies(A,implies(not(A),B))).
% 1.91/2.11 6 [hyper,3,1,3] {-} is_a_theorem(implies(implies(implies(implies(A,B),implies(C,B)),D),implies(implies(C,A),D))).
% 1.91/2.11 7 [hyper,4,1,3] {-} is_a_theorem(implies(implies(A,B),implies(implies(not(A),A),B))).
% 1.91/2.11 9 [hyper,5,1,3] {-} is_a_theorem(implies(implies(implies(not(A),B),C),implies(A,C))).
% 1.91/2.11 12 [hyper,7,1,7] {+} is_a_theorem(implies(implies(not(implies(A,B)),implies(A,B)),implies(implies(not(A),A),B))).
% 1.91/2.11 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))).
% 1.91/2.11 29 [hyper,9,1,6] {-} is_a_theorem(implies(implies(A,not(B)),implies(B,implies(A,C)))).
% 1.91/2.11 31 [hyper,9,1,3] {-} is_a_theorem(implies(implies(implies(A,B),C),implies(implies(implies(not(A),D),B),C))).
% 1.91/2.11 34 [hyper,9,1,4] {+} is_a_theorem(implies(A,A)).
% 1.91/2.11 40 [hyper,29,1,9] {+} is_a_theorem(implies(A,implies(B,implies(not(A),C)))).
% 1.91/2.11 43 [hyper,29,1,3] {-} is_a_theorem(implies(implies(implies(A,implies(B,C)),D),implies(implies(B,not(A)),D))).
% 1.91/2.11 57 [hyper,40,1,3] {-} is_a_theorem(implies(implies(implies(A,implies(not(B),C)),D),implies(B,D))).
% 1.91/2.11 73 [hyper,57,1,3] {-} is_a_theorem(implies(A,implies(implies(implies(not(A),B),C),implies(D,C)))).
% 1.91/2.11 85 [hyper,73,1,34] {-} is_a_theorem(implies(implies(implies(not(implies(A,A)),B),C),implies(D,C))).
% 1.91/2.11 138 [hyper,12,1,85] {+} is_a_theorem(implies(A,implies(implies(not(B),B),B))).
% 1.91/2.11 249 [hyper,138,1,3] {-} is_a_theorem(implies(implies(implies(implies(not(A),A),A),B),implies(C,B))).
% 1.91/2.11 281 [hyper,249,1,6] {+} is_a_theorem(implies(implies(A,implies(not(B),B)),implies(C,implies(A,B)))).
% 1.91/2.11 4479 [hyper,281,1,43] {-} is_a_theorem(implies(implies(not(A),not(B)),implies(C,implies(B,A)))).
% 1.91/2.11 4524 [hyper,4479,1,281] {-} is_a_theorem(implies(A,implies(implies(not(B),not(C)),implies(C,B)))).
% 1.91/2.11 4619 [hyper,4524,1,4524] {-} is_a_theorem(implies(implies(not(A),not(B)),implies(B,A))).
% 1.91/2.11 4644 [hyper,4524,1,28] {+} is_a_theorem(implies(A,implies(B,A))).
% 1.91/2.11 4660 [hyper,4619,1,281] {-} is_a_theorem(implies(A,implies(implies(not(B),not(not(B))),B))).
% 1.91/2.11 4725 [hyper,4644,1,3] {+} is_a_theorem(implies(implies(implies(A,B),C),implies(B,C))).
% 1.91/2.11 4742 [hyper,4660,1,4660] {-} is_a_theorem(implies(implies(not(A),not(not(A))),A)).
% 1.91/2.11 4798 [hyper,4742,1,31] {-} is_a_theorem(implies(implies(implies(not(not(A)),B),not(not(A))),A)).
% 1.91/2.11 5963 [hyper,4725,1,4798] {-} is_a_theorem(implies(not(not(A)),A)).
% 1.91/2.11 5964 [binary,5963.1,2.1] {-} $F.
% 1.91/2.11
% 1.91/2.11 % SZS output end Refutation
% 1.91/2.11 ------------ end of proof -------------
% 1.91/2.11
% 1.91/2.11
% 1.91/2.11 Search stopped by max_proofs option.
% 1.91/2.11
% 1.91/2.11
% 1.91/2.11 Search stopped by max_proofs option.
% 1.91/2.11
% 1.91/2.11 ============ end of search ============
% 1.91/2.11
% 1.91/2.11 ----------- soft-scott stats ----------
% 1.91/2.11
% 1.91/2.11 true clauses given 45 (22.0%)
% 1.91/2.11 false clauses given 160
% 1.91/2.11
% 1.91/2.11 FALSE TRUE
% 1.91/2.11 11 0 2
% 1.91/2.11 12 0 6
% 1.91/2.11 13 26 9
% 1.91/2.11 14 85 21
% 1.91/2.11 15 178 16
% 1.91/2.11 16 249 29
% 1.91/2.11 17 350 18
% 1.95/2.11 18 402 16
% 1.95/2.11 19 434 15
% 1.95/2.11 20 497 30
% 1.95/2.11 21 279 22
% 1.95/2.11 22 0 4
% 1.95/2.11 23 0 6
% 1.95/2.11 24 0 11
% 1.95/2.11 25 0 10
% 1.95/2.11 26 0 2
% 1.95/2.11 27 0 5
% 1.95/2.11 28 0 2
% 1.95/2.11 29 0 6
% 1.95/2.11 30 0 1
% 1.95/2.11 31 0 5
% 1.95/2.11 32 0 1
% 1.95/2.11 33 0 1
% 1.95/2.11 35 0 2
% 1.95/2.11 37 0 1
% 1.95/2.11 39 0 1
% 1.95/2.11 40 0 1
% 1.95/2.11 49 0 1
% 1.95/2.11 tot: 2500 244 (8.9% true)
% 1.95/2.11
% 1.95/2.11
% 1.95/2.11 Model 5 [ 1 1 299 ] (0.00 seconds, 215424 Inserts)
% 1.95/2.11
% 1.95/2.11 That finishes the proof of the theorem.
% 1.95/2.11
% 1.95/2.11 Process 9529 finished Sat Jul 2 12:01:40 2022
%------------------------------------------------------------------------------