TSTP Solution File: LCL004-1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : LCL004-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n011.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:18 EDT 2022
% Result : Unsatisfiable 7.46s 7.64s
% Output : Refutation 7.46s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : LCL004-1 : TPTP v8.1.0. Released v1.0.0.
% 0.07/0.14 % Command : sos-script %s
% 0.14/0.35 % Computer : n011.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 600
% 0.14/0.35 % DateTime : Sun Jul 3 11:08:20 EDT 2022
% 0.14/0.35 % CPUTime :
% 0.14/0.37 ----- Otter 3.2, August 2001 -----
% 0.14/0.37 The process was started by sandbox2 on n011.cluster.edu,
% 0.14/0.37 Sun Jul 3 11:08:20 2022
% 0.14/0.37 The command was "./sos". The process ID is 29566.
% 0.14/0.37
% 0.14/0.37 set(prolog_style_variables).
% 0.14/0.37 set(auto).
% 0.14/0.37 dependent: set(auto1).
% 0.14/0.37 dependent: set(process_input).
% 0.14/0.37 dependent: clear(print_kept).
% 0.14/0.37 dependent: clear(print_new_demod).
% 0.14/0.37 dependent: clear(print_back_demod).
% 0.14/0.37 dependent: clear(print_back_sub).
% 0.14/0.37 dependent: set(control_memory).
% 0.14/0.37 dependent: assign(max_mem, 12000).
% 0.14/0.37 dependent: assign(pick_given_ratio, 4).
% 0.14/0.37 dependent: assign(stats_level, 1).
% 0.14/0.37 dependent: assign(pick_semantic_ratio, 3).
% 0.14/0.37 dependent: assign(sos_limit, 5000).
% 0.14/0.37 dependent: assign(max_weight, 60).
% 0.14/0.37 clear(print_given).
% 0.14/0.37
% 0.14/0.37 list(usable).
% 0.14/0.37
% 0.14/0.37 SCAN INPUT: prop=0, horn=1, equality=0, symmetry=0, max_lits=3.
% 0.14/0.37
% 0.14/0.37 This is a Horn set without equality. The strategy will
% 0.14/0.37 be hyperresolution, with satellites in sos and nuclei
% 0.14/0.37 in usable.
% 0.14/0.37
% 0.14/0.37 dependent: set(hyper_res).
% 0.14/0.37 dependent: clear(order_hyper).
% 0.14/0.37
% 0.14/0.37 ------------> process usable:
% 0.14/0.37
% 0.14/0.37 ------------> process sos:
% 0.14/0.37
% 0.14/0.37 ======= end of input processing =======
% 0.14/0.39
% 0.14/0.39 Model 1 (0.00 seconds, 0 Inserts)
% 0.14/0.39
% 0.14/0.39 Stopped by limit on number of solutions
% 0.14/0.39
% 0.14/0.39
% 0.14/0.39 -------------- Softie stats --------------
% 0.14/0.39
% 0.14/0.39 UPDATE_STOP: 300
% 0.14/0.39 SFINDER_TIME_LIMIT: 2
% 0.14/0.39 SHORT_CLAUSE_CUTOFF: 4
% 0.14/0.39 number of clauses in intial UL: 2
% 0.14/0.39 number of clauses initially in problem: 3
% 0.14/0.39 percentage of clauses intially in UL: 66
% 0.14/0.39 percentage of distinct symbols occuring in initial UL: 100
% 0.14/0.39 percent of all initial clauses that are short: 100
% 0.14/0.39 absolute distinct symbol count: 5
% 0.14/0.39 distinct predicate count: 1
% 0.14/0.39 distinct function count: 2
% 0.14/0.39 distinct constant count: 2
% 0.14/0.39
% 0.14/0.39 ---------- no more Softie stats ----------
% 0.14/0.39
% 0.14/0.39
% 0.14/0.39
% 0.14/0.39 =========== start of search ===========
% 7.46/7.64
% 7.46/7.64 -------- PROOF --------
% 7.46/7.64 % SZS status Unsatisfiable
% 7.46/7.64 % SZS output start Refutation
% 7.46/7.64
% 7.46/7.64 Model 2 (0.00 seconds, 0 Inserts)
% 7.46/7.64
% 7.46/7.64 Stopped by limit on number of solutions
% 7.46/7.64
% 7.46/7.64 Model 3 (0.00 seconds, 0 Inserts)
% 7.46/7.64
% 7.46/7.64 Stopped by limit on number of solutions
% 7.46/7.64
% 7.46/7.64 ----> UNIT CONFLICT at 7.23 sec ----> 3775 [binary,3774.1,2.1] {+} $F.
% 7.46/7.64
% 7.46/7.64 Length of proof is 34. Level of proof is 33.
% 7.46/7.64
% 7.46/7.64 ---------------- PROOF ----------------
% 7.46/7.64 % SZS status Unsatisfiable
% 7.46/7.64 % SZS output start Refutation
% 7.46/7.64
% 7.46/7.64 1 [] {+} -is_a_theorem(or(not(A),B))| -is_a_theorem(A)|is_a_theorem(B).
% 7.46/7.64 2 [] {+} -is_a_theorem(or(not(a),or(b,a))).
% 7.46/7.64 3 [] {-} is_a_theorem(or(not(or(not(or(not(A),B)),or(C,or(D,E)))),or(not(or(not(D),A)),or(C,or(E,A))))).
% 7.46/7.64 4 [hyper,3,1,3] {-} is_a_theorem(or(not(or(not(A),or(not(B),C))),or(not(or(not(D),B)),or(or(E,B),or(not(B),C))))).
% 7.46/7.64 6 [hyper,4,1,3] {-} is_a_theorem(or(not(or(not(or(A,B)),C)),or(not(or(not(D),B)),or(or(not(B),E),C)))).
% 7.46/7.64 10 [hyper,6,1,3] {-} is_a_theorem(or(not(or(not(or(not(A),B)),or(C,A))),or(not(or(not(D),A)),or(E,or(C,A))))).
% 7.46/7.64 13 [hyper,10,1,10] {-} is_a_theorem(or(not(or(not(A),or(not(B),or(C,B)))),or(D,or(not(or(not(E),B)),or(not(B),or(C,B)))))).
% 7.46/7.64 64 [hyper,13,1,3] {-} is_a_theorem(or(not(or(not(not(or(not(A),B))),C)),or(D,or(or(not(B),or(E,B)),C)))).
% 7.46/7.64 78 [hyper,64,1,13] {-} is_a_theorem(or(A,or(not(or(not(B),C)),or(not(C),or(or(not(D),or(E,D)),C))))).
% 7.46/7.64 85 [hyper,78,1,78] {-} is_a_theorem(or(not(or(not(A),B)),or(not(B),or(or(not(C),or(D,C)),B)))).
% 7.46/7.64 94 [hyper,85,1,3] {-} is_a_theorem(or(not(or(not(or(not(A),or(B,A))),C)),or(not(D),or(D,C)))).
% 7.46/7.64 109 [hyper,94,1,13] {-} is_a_theorem(or(A,or(not(or(not(B),C)),or(not(C),or(C,C))))).
% 7.46/7.64 146 [hyper,109,1,109] {-} is_a_theorem(or(not(or(not(A),B)),or(not(B),or(B,B)))).
% 7.46/7.64 156 [hyper,146,1,3] {-} is_a_theorem(or(not(or(not(A),B)),or(not(A),or(A,B)))).
% 7.46/7.64 168 [hyper,156,1,3] {-} is_a_theorem(or(not(or(not(A),A)),or(not(A),or(B,A)))).
% 7.46/7.64 183 [hyper,168,1,13] {-} is_a_theorem(or(A,or(not(or(not(B),C)),or(not(C),or(D,C))))).
% 7.46/7.64 243 [hyper,183,1,183] {-} is_a_theorem(or(not(or(not(A),B)),or(not(B),or(C,B)))).
% 7.46/7.64 255 [hyper,243,1,10] {-} is_a_theorem(or(not(or(not(A),or(B,C))),or(D,or(not(C),or(B,C))))).
% 7.46/7.64 256 [hyper,243,1,3] {-} is_a_theorem(or(not(or(not(A),B)),or(not(C),or(C,B)))).
% 7.46/7.64 275 [hyper,256,1,3] {-} is_a_theorem(or(not(or(not(A),B)),or(not(A),or(C,B)))).
% 7.46/7.64 401 [hyper,275,1,243] {-} is_a_theorem(or(not(or(not(A),B)),or(C,or(not(B),or(D,B))))).
% 7.46/7.64 573 [hyper,401,1,3] {-} is_a_theorem(or(not(or(not(not(A)),B)),or(C,or(or(D,A),B)))).
% 7.46/7.64 670 [hyper,573,1,3] {-} is_a_theorem(or(not(or(not(or(A,B)),not(B))),or(C,or(D,not(B))))).
% 7.46/7.64 1912 [hyper,255,1,670] {-} is_a_theorem(or(A,or(not(or(B,not(C))),or(D,or(B,not(C)))))).
% 7.46/7.64 2116 [hyper,1912,1,1912] {-} is_a_theorem(or(not(or(A,not(B))),or(C,or(A,not(B))))).
% 7.46/7.64 2170 [hyper,2116,1,3] {-} is_a_theorem(or(not(or(not(not(A)),A)),or(B,or(not(C),A)))).
% 7.46/7.64 2193 [hyper,2170,1,255] {-} is_a_theorem(or(A,or(not(or(not(B),C)),or(D,or(not(B),C))))).
% 7.46/7.64 2587 [hyper,2193,1,2193] {-} is_a_theorem(or(not(or(not(A),B)),or(C,or(not(A),B)))).
% 7.46/7.64 2624 [hyper,2587,1,3] {-} is_a_theorem(or(not(or(not(not(A)),A)),or(B,or(C,A)))).
% 7.46/7.64 2672 [hyper,2624,1,255] {-} is_a_theorem(or(A,or(not(or(B,C)),or(D,or(B,C))))).
% 7.46/7.64 2779 [hyper,2672,1,2672] {-} is_a_theorem(or(not(or(A,B)),or(C,or(A,B)))).
% 7.46/7.64 2789 [hyper,2779,1,275] {-} is_a_theorem(or(not(or(A,B)),or(C,or(D,or(A,B))))).
% 7.46/7.64 2865 [hyper,2789,1,3] {-} is_a_theorem(or(not(or(not(A),B)),or(C,or(or(not(B),D),B)))).
% 7.46/7.64 3115 [hyper,2865,1,3] {-} is_a_theorem(or(not(or(not(or(not(A),B)),C)),or(D,or(A,C)))).
% 7.46/7.64 3148 [hyper,3115,1,243] {-} is_a_theorem(or(A,or(B,or(not(C),or(D,C))))).
% 7.46/7.64 3764 [hyper,3148,1,3148] {-} is_a_theorem(or(A,or(not(B),or(C,B)))).
% 7.46/7.64 3774 [hyper,3764,1,3764] {-} is_a_theorem(or(not(A),or(B,A))).
% 7.46/7.64 3775 [binary,3774.1,2.1] {+} $F.
% 7.46/7.64
% 7.46/7.64 % SZS output end Refutation
% 7.46/7.64 ------------ end of proof -------------
% 7.46/7.64
% 7.46/7.64
% 7.46/7.64 Search stopped by max_proofs option.
% 7.46/7.64
% 7.46/7.64
% 7.46/7.64 Search stopped by max_proofs option.
% 7.46/7.64
% 7.46/7.64 ============ end of search ============
% 7.46/7.64
% 7.46/7.64 ----------- soft-scott stats ----------
% 7.46/7.64
% 7.46/7.64 true clauses given 4 (2.5%)
% 7.46/7.64 false clauses given 154
% 7.46/7.64
% 7.46/7.64 FALSE TRUE
% 7.46/7.64 9 0 11
% 7.46/7.64 11 5 25
% 7.46/7.64 13 12 38
% 7.46/7.64 15 16 35
% 7.46/7.64 16 1 0
% 7.46/7.64 17 35 54
% 7.46/7.64 18 4 5
% 7.46/7.64 19 33 44
% 7.46/7.64 20 6 3
% 7.46/7.64 21 38 39
% 7.46/7.64 22 7 5
% 7.46/7.64 23 31 17
% 7.46/7.64 24 4 4
% 7.46/7.64 25 23 9
% 7.46/7.64 26 9 5
% 7.46/7.64 27 26 1
% 7.46/7.64 28 6 7
% 7.46/7.64 29 17 1
% 7.46/7.64 30 13 5
% 7.46/7.64 31 25 2
% 7.46/7.64 32 14 2
% 7.46/7.64 33 17 3
% 7.46/7.64 34 21 2
% 7.46/7.64 35 26 3
% 7.46/7.64 36 10 3
% 7.46/7.64 37 8 5
% 7.46/7.64 38 9 5
% 7.46/7.64 39 12 1
% 7.46/7.64 40 3 5
% 7.46/7.64 41 7 3
% 7.46/7.64 42 2 3
% 7.46/7.64 43 8 3
% 7.46/7.64 44 0 4
% 7.46/7.64 45 4 2
% 7.46/7.64 46 0 3
% 7.46/7.64 47 2 1
% 7.46/7.64 48 0 5
% 7.46/7.64 49 1 1
% 7.46/7.64 50 0 4
% 7.46/7.64 52 0 4
% 7.46/7.64 54 0 3
% 7.46/7.64 56 0 4
% 7.46/7.64 58 0 2
% 7.46/7.64 60 0 2
% 7.46/7.64 tot: 455 383 (45.7% true)
% 7.46/7.64
% 7.46/7.64
% 7.46/7.64 Model 3 (0.00 seconds, 0 Inserts)
% 7.46/7.64
% 7.46/7.64 That finishes the proof of the theorem.
% 7.46/7.64
% 7.46/7.64 Process 29566 finished Sun Jul 3 11:08:27 2022
%------------------------------------------------------------------------------