TSTP Solution File: LCL378-1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : LCL378-1 : TPTP v8.1.0. Released v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n029.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:47 EDT 2022
% Result : Unsatisfiable 6.23s 6.46s
% Output : Refutation 6.23s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : LCL378-1 : TPTP v8.1.0. Released v2.3.0.
% 0.07/0.13 % Command : sos-script %s
% 0.13/0.34 % Computer : n029.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 : Sat Jul 2 11:18: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 n029.cluster.edu,
% 0.13/0.36 Sat Jul 2 11:18:10 2022
% 0.13/0.36 The command was "./sos". The process ID is 18355.
% 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: 100
% 0.13/0.38 percent of all initial clauses that are short: 100
% 0.13/0.38 absolute distinct symbol count: 5
% 0.13/0.38 distinct predicate count: 1
% 0.13/0.38 distinct function count: 2
% 0.13/0.38 distinct constant count: 2
% 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 ===========
% 6.23/6.46
% 6.23/6.46 -------- PROOF --------
% 6.23/6.46 % SZS status Unsatisfiable
% 6.23/6.46 % SZS output start Refutation
% 6.23/6.46
% 6.23/6.46 Model 2 (0.00 seconds, 0 Inserts)
% 6.23/6.46
% 6.23/6.46 Stopped by limit on number of solutions
% 6.23/6.46
% 6.23/6.46 Model 3 (0.00 seconds, 0 Inserts)
% 6.23/6.46
% 6.23/6.46 Stopped by limit on number of solutions
% 6.23/6.46
% 6.23/6.46 Model 4 (0.00 seconds, 0 Inserts)
% 6.23/6.46
% 6.23/6.46 Stopped by limit on number of solutions
% 6.23/6.46
% 6.23/6.46 Model 5 [ 1 0 29 ] (0.00 seconds, 183733 Inserts)
% 6.23/6.46
% 6.23/6.46 Stopped by limit on insertions
% 6.23/6.46
% 6.23/6.46 Stopped by limit on insertions
% 6.23/6.46
% 6.23/6.46 Stopped by limit on insertions
% 6.23/6.46
% 6.23/6.46 Model 6 [ 1 0 150 ] (0.00 seconds, 250000 Inserts)
% 6.23/6.46
% 6.23/6.46 ----> UNIT CONFLICT at 6.07 sec ----> 3216 [binary,3215.1,2.1] {-} $F.
% 6.23/6.46
% 6.23/6.46 Length of proof is 25. Level of proof is 15.
% 6.23/6.46
% 6.23/6.46 ---------------- PROOF ----------------
% 6.23/6.46 % SZS status Unsatisfiable
% 6.23/6.46 % SZS output start Refutation
% 6.23/6.46
% 6.23/6.46 1 [] {+} -is_a_theorem(implies(A,B))| -is_a_theorem(A)|is_a_theorem(B).
% 6.23/6.46 2 [] {+} -is_a_theorem(implies(not(x),implies(x,y))).
% 6.23/6.46 3 [] {-} is_a_theorem(implies(implies(A,B),implies(implies(B,C),implies(A,C)))).
% 6.23/6.46 4 [] {+} is_a_theorem(implies(implies(not(A),A),A)).
% 6.23/6.46 5 [] {+} is_a_theorem(implies(A,implies(not(A),B))).
% 6.23/6.46 6 [hyper,3,1,3] {-} is_a_theorem(implies(implies(implies(implies(A,B),implies(C,B)),D),implies(implies(C,A),D))).
% 6.23/6.46 7 [hyper,4,1,3] {+} is_a_theorem(implies(implies(A,B),implies(implies(not(A),A),B))).
% 6.23/6.46 9 [hyper,5,1,3] {-} is_a_theorem(implies(implies(implies(not(A),B),C),implies(A,C))).
% 6.23/6.46 15 [hyper,9,1,4] {+} is_a_theorem(implies(A,A)).
% 6.23/6.46 18 [hyper,6,1,6] {-} is_a_theorem(implies(implies(A,implies(B,C)),implies(implies(D,B),implies(A,implies(D,C))))).
% 6.23/6.46 21 [hyper,6,1,9] {-} is_a_theorem(implies(implies(A,not(B)),implies(B,implies(A,C)))).
% 6.23/6.46 24 [hyper,21,1,9] {+} is_a_theorem(implies(A,implies(B,implies(not(A),C)))).
% 6.23/6.46 26 [hyper,21,1,3] {-} is_a_theorem(implies(implies(implies(A,implies(B,C)),D),implies(implies(B,not(A)),D))).
% 6.23/6.46 55 [hyper,24,1,3] {-} is_a_theorem(implies(implies(implies(A,implies(not(B),C)),D),implies(B,D))).
% 6.23/6.46 71 [hyper,55,1,3] {-} is_a_theorem(implies(A,implies(implies(implies(not(A),B),C),implies(D,C)))).
% 6.23/6.46 85 [hyper,71,1,15] {-} is_a_theorem(implies(implies(implies(not(implies(A,A)),B),C),implies(D,C))).
% 6.23/6.46 111 [hyper,85,1,4] {+} is_a_theorem(implies(A,implies(B,B))).
% 6.23/6.46 162 [hyper,111,1,3] {-} is_a_theorem(implies(implies(implies(A,A),B),implies(C,B))).
% 6.23/6.46 198 [hyper,162,1,3] {-} is_a_theorem(implies(implies(implies(A,B),C),implies(implies(implies(D,D),B),C))).
% 6.23/6.46 203 [hyper,162,1,7] {+} is_a_theorem(implies(A,implies(implies(not(B),B),B))).
% 6.23/6.46 437 [hyper,203,1,18] {-} is_a_theorem(implies(implies(A,implies(not(B),B)),implies(C,implies(A,B)))).
% 6.23/6.46 2486 [hyper,437,1,55] {-} is_a_theorem(implies(A,implies(B,implies(C,A)))).
% 6.23/6.46 2491 [hyper,437,1,26] {-} is_a_theorem(implies(implies(not(A),not(B)),implies(C,implies(B,A)))).
% 6.23/6.46 2519 [hyper,2486,1,437] {+} is_a_theorem(implies(A,implies(B,implies(C,B)))).
% 6.23/6.46 2538 [hyper,2519,1,2519] {+} is_a_theorem(implies(A,implies(B,A))).
% 6.23/6.46 2576 [hyper,2538,1,3] {+} is_a_theorem(implies(implies(implies(A,B),C),implies(B,C))).
% 6.23/6.46 2740 [hyper,2491,1,437] {-} is_a_theorem(implies(A,implies(implies(not(B),not(C)),implies(C,B)))).
% 6.23/6.46 2841 [hyper,2740,1,2740] {-} is_a_theorem(implies(implies(not(A),not(B)),implies(B,A))).
% 6.23/6.46 2889 [hyper,2841,1,198] {-} is_a_theorem(implies(implies(implies(A,A),not(B)),implies(B,C))).
% 6.23/6.46 3215 [hyper,2576,1,2889] {-} is_a_theorem(implies(not(A),implies(A,B))).
% 6.23/6.46 3216 [binary,3215.1,2.1] {-} $F.
% 6.23/6.46
% 6.23/6.46 % SZS output end Refutation
% 6.23/6.46 ------------ end of proof -------------
% 6.23/6.46
% 6.23/6.46
% 6.23/6.46 Search stopped by max_proofs option.
% 6.23/6.46
% 6.23/6.46
% 6.23/6.46 Search stopped by max_proofs option.
% 6.23/6.46
% 6.23/6.46 ============ end of search ============
% 6.23/6.46
% 6.23/6.46 ----------- soft-scott stats ----------
% 6.23/6.46
% 6.23/6.46 true clauses given 31 (20.3%)
% 6.23/6.46 false clauses given 122
% 6.23/6.46
% 6.23/6.46 FALSE TRUE
% 6.23/6.46 11 0 6
% 6.23/6.46 12 0 11
% 6.23/6.46 13 14 28
% 6.23/6.46 14 43 60
% 6.23/6.46 15 82 82
% 6.23/6.46 16 118 106
% 6.23/6.46 17 155 116
% 6.23/6.46 18 172 122
% 6.23/6.46 19 164 141
% 6.23/6.46 20 163 146
% 6.23/6.46 21 151 134
% 6.23/6.46 22 118 75
% 6.23/6.46 23 64 43
% 6.23/6.46 24 33 51
% 6.23/6.46 25 32 45
% 6.23/6.46 26 23 27
% 6.23/6.46 27 21 26
% 6.23/6.46 28 13 20
% 6.23/6.46 29 23 29
% 6.23/6.46 30 15 14
% 6.23/6.46 31 36 21
% 6.23/6.46 32 18 21
% 6.23/6.46 33 13 7
% 6.23/6.46 34 25 18
% 6.23/6.46 35 10 7
% 6.23/6.46 36 14 8
% 6.23/6.46 37 4 8
% 6.23/6.46 38 4 5
% 6.23/6.46 39 3 5
% 6.23/6.46 40 2 5
% 6.23/6.46 41 0 1
% 6.23/6.46 42 3 3
% 6.23/6.46 43 1 1
% 6.23/6.46 44 0 1
% 6.23/6.46 45 0 1
% 6.23/6.46 46 1 1
% 6.23/6.46 48 0 1
% 6.23/6.46 49 0 1
% 6.23/6.46 52 0 1
% 6.23/6.46 53 2 0
% 6.23/6.46 56 2 0
% 6.23/6.46 57 0 1
% 6.23/6.46 59 2 1
% 6.23/6.46 60 0 1
% 6.23/6.46 tot: 1544 1401 (47.6% true)
% 6.23/6.46
% 6.23/6.46
% 6.23/6.46 Model 6 [ 1 0 150 ] (0.00 seconds, 250000 Inserts)
% 6.23/6.46
% 6.23/6.46 That finishes the proof of the theorem.
% 6.23/6.46
% 6.23/6.46 Process 18355 finished Sat Jul 2 11:18:16 2022
%------------------------------------------------------------------------------