TSTP Solution File: LCL208-1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : LCL208-1 : TPTP v8.1.0. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n026.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:28:41 EDT 2022
% Result : Unsatisfiable 2.08s 2.25s
% Output : Refutation 2.08s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : LCL208-1 : TPTP v8.1.0. Released v1.1.0.
% 0.03/0.12 % Command : sos-script %s
% 0.13/0.33 % Computer : n026.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Sat Jul 2 14:44:20 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.13/0.35 ----- Otter 3.2, August 2001 -----
% 0.13/0.35 The process was started by sandbox on n026.cluster.edu,
% 0.13/0.35 Sat Jul 2 14:44:20 2022
% 0.13/0.35 The command was "./sos". The process ID is 3556.
% 0.13/0.35
% 0.13/0.35 set(prolog_style_variables).
% 0.13/0.35 set(auto).
% 0.13/0.35 dependent: set(auto1).
% 0.13/0.35 dependent: set(process_input).
% 0.13/0.35 dependent: clear(print_kept).
% 0.13/0.35 dependent: clear(print_new_demod).
% 0.13/0.35 dependent: clear(print_back_demod).
% 0.13/0.35 dependent: clear(print_back_sub).
% 0.13/0.35 dependent: set(control_memory).
% 0.13/0.35 dependent: assign(max_mem, 12000).
% 0.13/0.35 dependent: assign(pick_given_ratio, 4).
% 0.13/0.35 dependent: assign(stats_level, 1).
% 0.13/0.35 dependent: assign(pick_semantic_ratio, 3).
% 0.13/0.35 dependent: assign(sos_limit, 5000).
% 0.13/0.35 dependent: assign(max_weight, 60).
% 0.13/0.35 clear(print_given).
% 0.13/0.35
% 0.13/0.35 list(usable).
% 0.13/0.35
% 0.13/0.35 SCAN INPUT: prop=0, horn=1, equality=0, symmetry=0, max_lits=3.
% 0.13/0.35
% 0.13/0.35 This is a Horn set without equality. The strategy will
% 0.13/0.35 be hyperresolution, with satellites in sos and nuclei
% 0.13/0.35 in usable.
% 0.13/0.35
% 0.13/0.35 dependent: set(hyper_res).
% 0.13/0.35 dependent: clear(order_hyper).
% 0.13/0.35
% 0.13/0.35 ------------> process usable:
% 0.13/0.35
% 0.13/0.35 ------------> process sos:
% 0.13/0.35
% 0.13/0.35 ======= 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: 4
% 0.20/0.38 number of clauses initially in problem: 9
% 0.20/0.38 percentage of clauses intially in UL: 44
% 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: 6
% 0.20/0.38 distinct predicate count: 2
% 0.20/0.38 distinct function count: 2
% 0.20/0.38 distinct constant count: 2
% 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 Model 2 (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 =========== start of search ===========
% 2.08/2.25
% 2.08/2.25 -------- PROOF --------
% 2.08/2.25 % SZS status Unsatisfiable
% 2.08/2.25 % SZS output start Refutation
% 2.08/2.25
% 2.08/2.25 Model 3 (0.00 seconds, 0 Inserts)
% 2.08/2.25
% 2.08/2.25 Stopped by limit on number of solutions
% 2.08/2.25
% 2.08/2.25 Stopped by limit on insertions
% 2.08/2.25
% 2.08/2.25 Stopped by limit on insertions
% 2.08/2.25
% 2.08/2.25 Model 4 [ 12 0 295 ] (0.00 seconds, 250000 Inserts)
% 2.08/2.25
% 2.08/2.25 Model 5 (0.00 seconds, 250000 Inserts)
% 2.08/2.25
% 2.08/2.25 Stopped by limit on number of solutions
% 2.08/2.25
% 2.08/2.25 ----> UNIT CONFLICT at 1.89 sec ----> 1252 [binary,1251.1,4.1] {-} $F.
% 2.08/2.25
% 2.08/2.25 Length of proof is 7. Level of proof is 7.
% 2.08/2.25
% 2.08/2.25 ---------------- PROOF ----------------
% 2.08/2.25 % SZS status Unsatisfiable
% 2.08/2.25 % SZS output start Refutation
% 2.08/2.25
% 2.08/2.25 1 [] {+} theorem(A)| -axiom(A).
% 2.08/2.25 2 [] {+} theorem(A)| -axiom(or(not(B),A))| -theorem(B).
% 2.08/2.25 3 [] {+} theorem(or(not(A),B))| -axiom(or(not(A),C))| -theorem(or(not(C),B)).
% 2.08/2.25 4 [] {+} -theorem(or(not(or(p,q)),or(not(not(p)),q))).
% 2.08/2.25 5 [] {+} axiom(or(not(or(A,A)),A)).
% 2.08/2.25 6 [] {+} axiom(or(not(A),or(B,A))).
% 2.08/2.25 7 [] {-} axiom(or(not(or(A,B)),or(B,A))).
% 2.08/2.25 8 [] {+} axiom(or(not(or(A,or(B,C))),or(B,or(A,C)))).
% 2.08/2.25 9 [] {-} axiom(or(not(or(not(A),B)),or(not(or(C,A)),or(C,B)))).
% 2.08/2.25 10 [hyper,5,1] {+} theorem(or(not(or(A,A)),A)).
% 2.08/2.25 56 [hyper,9,2,10] {-} theorem(or(not(or(A,or(B,B))),or(A,B))).
% 2.08/2.25 103 [hyper,56,3,9] {-} theorem(or(not(or(not(A),B)),or(not(or(B,A)),B))).
% 2.08/2.25 545 [hyper,103,3,7] {-} theorem(or(not(or(A,not(B))),or(not(or(A,B)),A))).
% 2.08/2.25 1238 [hyper,545,3,6] {-} theorem(or(not(not(A)),or(not(or(B,A)),B))).
% 2.08/2.25 1246 [hyper,1238,2,8] {-} theorem(or(not(or(A,B)),or(not(not(B)),A))).
% 2.08/2.25 1251 [hyper,1246,3,7] {-} theorem(or(not(or(A,B)),or(not(not(A)),B))).
% 2.08/2.25 1252 [binary,1251.1,4.1] {-} $F.
% 2.08/2.25
% 2.08/2.25 % SZS output end Refutation
% 2.08/2.25 ------------ end of proof -------------
% 2.08/2.25
% 2.08/2.25
% 2.08/2.25 Search stopped by max_proofs option.
% 2.08/2.25
% 2.08/2.25
% 2.08/2.25 Search stopped by max_proofs option.
% 2.08/2.25
% 2.08/2.25 ============ end of search ============
% 2.08/2.25
% 2.08/2.25 ----------- soft-scott stats ----------
% 2.08/2.25
% 2.08/2.25 true clauses given 71 (27.3%)
% 2.08/2.25 false clauses given 189
% 2.08/2.25
% 2.08/2.25 FALSE TRUE
% 2.08/2.25 9 0 19
% 2.08/2.25 11 0 87
% 2.08/2.25 12 0 2
% 2.08/2.25 13 138 48
% 2.08/2.25 14 1 4
% 2.08/2.25 15 195 26
% 2.08/2.25 16 7 3
% 2.08/2.25 17 144 14
% 2.08/2.25 18 12 1
% 2.08/2.25 19 74 8
% 2.08/2.25 20 11 1
% 2.08/2.25 21 48 9
% 2.08/2.25 22 9 1
% 2.08/2.25 23 22 1
% 2.08/2.25 24 1 1
% 2.08/2.25 25 7 0
% 2.08/2.25 26 4 0
% 2.08/2.25 27 2 0
% 2.08/2.25 28 2 1
% 2.08/2.25 29 2 0
% 2.08/2.25 31 3 0
% 2.08/2.25 33 3 0
% 2.08/2.25 37 1 0
% 2.08/2.25 tot: 686 226 (24.8% true)
% 2.08/2.25
% 2.08/2.25
% 2.08/2.25 Model 5 (0.00 seconds, 250000 Inserts)
% 2.08/2.25
% 2.08/2.25 That finishes the proof of the theorem.
% 2.08/2.25
% 2.08/2.25 Process 3556 finished Sat Jul 2 14:44:22 2022
%------------------------------------------------------------------------------