TSTP Solution File: LCL072-1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : LCL072-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n025.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:43 EDT 2022
% Result : Unsatisfiable 2.34s 2.54s
% Output : Refutation 2.34s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : LCL072-1 : TPTP v8.1.0. Released v1.0.0.
% 0.07/0.13 % Command : sos-script %s
% 0.12/0.34 % Computer : n025.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 10:26:24 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.12/0.36 ----- Otter 3.2, August 2001 -----
% 0.12/0.36 The process was started by sandbox on n025.cluster.edu,
% 0.12/0.36 Sat Jul 2 10:26:24 2022
% 0.12/0.36 The command was "./sos". The process ID is 16192.
% 0.12/0.36
% 0.12/0.36 set(prolog_style_variables).
% 0.12/0.36 set(auto).
% 0.12/0.36 dependent: set(auto1).
% 0.12/0.36 dependent: set(process_input).
% 0.12/0.36 dependent: clear(print_kept).
% 0.12/0.36 dependent: clear(print_new_demod).
% 0.12/0.36 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.12/0.38
% 0.12/0.38 Model 1 (0.00 seconds, 0 Inserts)
% 0.12/0.38
% 0.12/0.38 Stopped by limit on number of solutions
% 0.12/0.38
% 0.12/0.38
% 0.12/0.38 -------------- Softie stats --------------
% 0.12/0.38
% 0.12/0.38 UPDATE_STOP: 300
% 0.12/0.38 SFINDER_TIME_LIMIT: 2
% 0.12/0.38 SHORT_CLAUSE_CUTOFF: 4
% 0.12/0.38 number of clauses in intial UL: 2
% 0.12/0.38 number of clauses initially in problem: 5
% 0.12/0.38 percentage of clauses intially in UL: 40
% 0.12/0.38 percentage of distinct symbols occuring in initial UL: 100
% 0.12/0.38 percent of all initial clauses that are short: 100
% 0.12/0.38 absolute distinct symbol count: 5
% 0.12/0.38 distinct predicate count: 1
% 0.12/0.38 distinct function count: 2
% 0.12/0.38 distinct constant count: 2
% 0.12/0.38
% 0.12/0.38 ---------- no more Softie stats ----------
% 0.12/0.38
% 0.12/0.38
% 0.12/0.38
% 0.12/0.38 =========== start of search ===========
% 2.34/2.54
% 2.34/2.54 -------- PROOF --------
% 2.34/2.54 % SZS status Unsatisfiable
% 2.34/2.54 % SZS output start Refutation
% 2.34/2.54
% 2.34/2.54 Model 2 (0.00 seconds, 0 Inserts)
% 2.34/2.54
% 2.34/2.54 Stopped by limit on number of solutions
% 2.34/2.54
% 2.34/2.54 Model 3 (0.00 seconds, 0 Inserts)
% 2.34/2.54
% 2.34/2.54 Stopped by limit on number of solutions
% 2.34/2.54
% 2.34/2.54 Model 4 (0.00 seconds, 0 Inserts)
% 2.34/2.54
% 2.34/2.54 Stopped by limit on number of solutions
% 2.34/2.54
% 2.34/2.54 Stopped by limit on insertions
% 2.34/2.54
% 2.34/2.54 Model 5 [ 1 1 44 ] (0.00 seconds, 250000 Inserts)
% 2.34/2.54
% 2.34/2.54 ----> UNIT CONFLICT at 2.15 sec ----> 1865 [binary,1864.1,2.1] {-} $F.
% 2.34/2.54
% 2.34/2.54 Length of proof is 19. Level of proof is 12.
% 2.34/2.54
% 2.34/2.54 ---------------- PROOF ----------------
% 2.34/2.54 % SZS status Unsatisfiable
% 2.34/2.54 % SZS output start Refutation
% 2.34/2.54
% 2.34/2.54 1 [] {+} -is_a_theorem(implies(A,B))| -is_a_theorem(A)|is_a_theorem(B).
% 2.34/2.54 2 [] {+} -is_a_theorem(implies(a,implies(not(a),b))).
% 2.34/2.54 3 [] {-} is_a_theorem(implies(implies(implies(A,B),C),implies(B,C))).
% 2.34/2.54 4 [] {-} is_a_theorem(implies(implies(implies(A,B),C),implies(not(A),C))).
% 2.34/2.54 5 [] {-} is_a_theorem(implies(implies(A,implies(not(B),C)),implies(A,implies(implies(D,C),implies(implies(B,D),C))))).
% 2.34/2.54 6 [hyper,3,1,3] {+} is_a_theorem(implies(A,implies(B,A))).
% 2.34/2.54 7 [hyper,6,1,6] {+} is_a_theorem(implies(A,implies(B,implies(C,B)))).
% 2.34/2.54 12 [hyper,4,1,6] {-} is_a_theorem(implies(not(A),implies(B,implies(A,C)))).
% 2.34/2.54 21 [hyper,5,1,7] {-} is_a_theorem(implies(A,implies(implies(B,implies(C,not(D))),implies(implies(D,B),implies(C,not(D)))))).
% 2.34/2.54 22 [hyper,5,1,4] {-} is_a_theorem(implies(implies(implies(A,B),C),implies(implies(D,C),implies(implies(A,D),C)))).
% 2.34/2.54 23 [hyper,5,1,3] {-} is_a_theorem(implies(implies(implies(A,not(B)),C),implies(implies(D,C),implies(implies(B,D),C)))).
% 2.34/2.54 121 [hyper,21,1,21] {-} is_a_theorem(implies(implies(A,implies(B,not(C))),implies(implies(C,A),implies(B,not(C))))).
% 2.34/2.54 138 [hyper,22,1,3] {-} is_a_theorem(implies(implies(A,implies(B,C)),implies(implies(implies(D,B),A),implies(B,C)))).
% 2.34/2.54 200 [hyper,121,1,6] {-} is_a_theorem(implies(implies(A,not(A)),implies(B,not(A)))).
% 2.34/2.54 389 [hyper,138,1,200] {-} is_a_theorem(implies(implies(implies(A,B),implies(C,not(C))),implies(B,not(C)))).
% 2.34/2.54 408 [hyper,138,1,12] {-} is_a_theorem(implies(implies(implies(A,B),not(C)),implies(B,implies(C,D)))).
% 2.34/2.54 677 [hyper,389,1,389] {+} is_a_theorem(implies(implies(A,not(A)),not(A))).
% 2.34/2.54 694 [hyper,389,1,200] {+} is_a_theorem(implies(not(A),not(A))).
% 2.34/2.54 710 [hyper,677,1,408] {+} is_a_theorem(implies(not(A),implies(A,B))).
% 2.34/2.54 715 [hyper,677,1,23] {-} is_a_theorem(implies(implies(A,not(B)),implies(implies(B,A),not(B)))).
% 2.34/2.54 723 [hyper,710,1,121] {-} is_a_theorem(implies(implies(A,not(B)),implies(B,not(A)))).
% 2.34/2.54 830 [hyper,723,1,694] {+} is_a_theorem(implies(A,not(not(A)))).
% 2.34/2.54 1844 [hyper,715,1,830] {+} is_a_theorem(implies(implies(not(A),A),not(not(A)))).
% 2.34/2.54 1864 [hyper,1844,1,408] {-} is_a_theorem(implies(A,implies(not(A),B))).
% 2.34/2.54 1865 [binary,1864.1,2.1] {-} $F.
% 2.34/2.54
% 2.34/2.54 % SZS output end Refutation
% 2.34/2.54 ------------ end of proof -------------
% 2.34/2.54
% 2.34/2.54
% 2.34/2.54 Search stopped by max_proofs option.
% 2.34/2.54
% 2.34/2.54
% 2.34/2.54 Search stopped by max_proofs option.
% 2.34/2.54
% 2.34/2.54 ============ end of search ============
% 2.34/2.54
% 2.34/2.54 ----------- soft-scott stats ----------
% 2.34/2.54
% 2.34/2.54 true clauses given 33 (21.6%)
% 2.34/2.54 false clauses given 120
% 2.34/2.54
% 2.34/2.54 FALSE TRUE
% 2.34/2.54 10 0 21
% 2.34/2.54 11 0 9
% 2.34/2.54 12 24 44
% 2.34/2.54 13 54 21
% 2.34/2.54 14 68 60
% 2.34/2.54 15 92 32
% 2.34/2.54 16 104 53
% 2.34/2.54 17 130 26
% 2.34/2.54 18 114 39
% 2.34/2.54 19 96 19
% 2.34/2.55 20 98 24
% 2.34/2.55 21 67 8
% 2.34/2.55 22 66 20
% 2.34/2.55 23 39 6
% 2.34/2.55 24 68 1
% 2.34/2.55 25 23 1
% 2.34/2.55 26 47 3
% 2.34/2.55 27 14 0
% 2.34/2.55 28 32 1
% 2.34/2.55 29 11 0
% 2.34/2.55 30 21 6
% 2.34/2.55 31 8 0
% 2.34/2.55 32 18 0
% 2.34/2.55 33 4 0
% 2.34/2.55 34 11 1
% 2.34/2.55 36 11 0
% 2.34/2.55 38 8 0
% 2.34/2.55 39 1 0
% 2.34/2.55 40 8 0
% 2.34/2.55 41 1 0
% 2.34/2.55 42 6 0
% 2.34/2.55 43 1 0
% 2.34/2.55 44 1 0
% 2.34/2.55 46 3 0
% 2.34/2.55 48 2 0
% 2.34/2.55 50 2 0
% 2.34/2.55 52 1 0
% 2.34/2.55 54 2 0
% 2.34/2.55 58 3 0
% 2.34/2.55 59 1 0
% 2.34/2.55 tot: 1260 395 (23.9% true)
% 2.34/2.55
% 2.34/2.55
% 2.34/2.55 Model 5 [ 1 1 44 ] (0.00 seconds, 250000 Inserts)
% 2.34/2.55
% 2.34/2.55 That finishes the proof of the theorem.
% 2.34/2.55
% 2.34/2.55 Process 16192 finished Sat Jul 2 10:26:27 2022
%------------------------------------------------------------------------------