TSTP Solution File: LCL210-1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : LCL210-1 : TPTP v8.1.0. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n013.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:42 EDT 2022
% Result : Unsatisfiable 0.45s 0.66s
% Output : Refutation 0.45s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : LCL210-1 : TPTP v8.1.0. Released v1.1.0.
% 0.08/0.14 % Command : sos-script %s
% 0.14/0.35 % Computer : n013.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 19:28:59 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 sandbox on n013.cluster.edu,
% 0.14/0.37 Sun Jul 3 19:28:59 2022
% 0.14/0.37 The command was "./sos". The process ID is 24683.
% 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.20/0.41
% 0.20/0.41 Model 1 (0.00 seconds, 0 Inserts)
% 0.20/0.41
% 0.20/0.41 Stopped by limit on number of solutions
% 0.20/0.41
% 0.20/0.41
% 0.20/0.41 -------------- Softie stats --------------
% 0.20/0.41
% 0.20/0.41 UPDATE_STOP: 300
% 0.20/0.41 SFINDER_TIME_LIMIT: 2
% 0.20/0.41 SHORT_CLAUSE_CUTOFF: 4
% 0.20/0.41 number of clauses in intial UL: 4
% 0.20/0.41 number of clauses initially in problem: 9
% 0.20/0.41 percentage of clauses intially in UL: 44
% 0.20/0.41 percentage of distinct symbols occuring in initial UL: 100
% 0.20/0.41 percent of all initial clauses that are short: 100
% 0.20/0.41 absolute distinct symbol count: 6
% 0.20/0.41 distinct predicate count: 2
% 0.20/0.41 distinct function count: 2
% 0.20/0.41 distinct constant count: 2
% 0.20/0.41
% 0.20/0.41 ---------- no more Softie stats ----------
% 0.20/0.41
% 0.20/0.41
% 0.20/0.41
% 0.20/0.41 Model 2 (0.00 seconds, 0 Inserts)
% 0.20/0.41
% 0.20/0.41 Stopped by limit on number of solutions
% 0.20/0.41
% 0.20/0.41 =========== start of search ===========
% 0.45/0.66
% 0.45/0.66 -------- PROOF --------
% 0.45/0.66 % SZS status Unsatisfiable
% 0.45/0.66 % SZS output start Refutation
% 0.45/0.66
% 0.45/0.66 Model 3 (0.00 seconds, 0 Inserts)
% 0.45/0.66
% 0.45/0.66 Stopped by limit on number of solutions
% 0.45/0.66
% 0.45/0.66 Model 4 (0.00 seconds, 0 Inserts)
% 0.45/0.66
% 0.45/0.66 Stopped by limit on number of solutions
% 0.45/0.66
% 0.45/0.66 Modelling stopped after 300 given clauses and 0.00 seconds
% 0.45/0.66
% 0.45/0.66
% 0.45/0.66 ----> UNIT CONFLICT at 0.25 sec ----> 2324 [binary,2323.1,4.1] {-} $F.
% 0.45/0.66
% 0.45/0.66 Length of proof is 8. Level of proof is 8.
% 0.45/0.66
% 0.45/0.66 ---------------- PROOF ----------------
% 0.45/0.66 % SZS status Unsatisfiable
% 0.45/0.66 % SZS output start Refutation
% 0.45/0.66
% 0.45/0.66 1 [] {+} theorem(A)| -axiom(A).
% 0.45/0.66 2 [] {+} theorem(A)| -axiom(or(not(B),A))| -theorem(B).
% 0.45/0.66 3 [] {+} theorem(or(not(A),B))| -axiom(or(not(A),C))| -theorem(or(not(C),B)).
% 0.45/0.66 4 [] {+} -theorem(or(not(not(p)),or(not(or(p,q)),q))).
% 0.45/0.66 5 [] {+} axiom(or(not(or(A,A)),A)).
% 0.45/0.66 6 [] {+} axiom(or(not(A),or(B,A))).
% 0.45/0.66 7 [] {-} axiom(or(not(or(A,B)),or(B,A))).
% 0.45/0.66 8 [] {-} axiom(or(not(or(A,or(B,C))),or(B,or(A,C)))).
% 0.45/0.66 9 [] {-} axiom(or(not(or(not(A),B)),or(not(or(C,A)),or(C,B)))).
% 0.45/0.66 10 [hyper,5,1] {+} theorem(or(not(or(A,A)),A)).
% 0.45/0.66 57 [hyper,9,2,10] {+} theorem(or(not(or(A,or(B,B))),or(A,B))).
% 0.45/0.66 686 [hyper,57,3,9] {-} theorem(or(not(or(not(A),B)),or(not(or(B,A)),B))).
% 0.45/0.66 1413 [hyper,686,3,7] {-} theorem(or(not(or(A,not(B))),or(not(or(A,B)),A))).
% 0.45/0.66 2301 [hyper,1413,3,6] {-} theorem(or(not(not(A)),or(not(or(B,A)),B))).
% 0.45/0.66 2309 [hyper,2301,2,8] {-} theorem(or(not(or(A,B)),or(not(not(B)),A))).
% 0.45/0.66 2314 [hyper,2309,3,7] {-} theorem(or(not(or(A,B)),or(not(not(A)),B))).
% 0.45/0.66 2323 [hyper,2314,2,8] {-} theorem(or(not(not(A)),or(not(or(A,B)),B))).
% 0.45/0.66 2324 [binary,2323.1,4.1] {-} $F.
% 0.45/0.66
% 0.45/0.66 % SZS output end Refutation
% 0.45/0.66 ------------ end of proof -------------
% 0.45/0.66
% 0.45/0.66
% 0.45/0.66 Search stopped by max_proofs option.
% 0.45/0.66
% 0.45/0.66
% 0.45/0.66 Search stopped by max_proofs option.
% 0.45/0.66
% 0.45/0.66 ============ end of search ============
% 0.45/0.66
% 0.45/0.66 ----------- soft-scott stats ----------
% 0.45/0.66
% 0.45/0.66 true clauses given 130 (26.5%)
% 0.45/0.66 false clauses given 360
% 0.45/0.66
% 0.45/0.66 FALSE TRUE
% 0.45/0.66 11 0 123
% 0.45/0.66 12 0 1
% 0.45/0.66 13 67 145
% 0.45/0.66 14 3 7
% 0.45/0.66 15 353 76
% 0.45/0.66 16 7 8
% 0.45/0.66 17 280 55
% 0.45/0.66 18 24 6
% 0.45/0.66 19 173 25
% 0.45/0.66 20 31 4
% 0.45/0.66 21 108 16
% 0.45/0.66 22 20 3
% 0.45/0.66 23 73 3
% 0.45/0.66 24 7 1
% 0.45/0.66 25 38 0
% 0.45/0.66 26 12 0
% 0.45/0.66 27 12 1
% 0.45/0.66 28 13 0
% 0.45/0.66 29 5 0
% 0.45/0.66 31 6 0
% 0.45/0.66 32 1 0
% 0.45/0.66 33 10 0
% 0.45/0.66 35 1 0
% 0.45/0.66 36 3 0
% 0.45/0.66 37 3 0
% 0.45/0.66 38 2 0
% 0.45/0.66 39 1 0
% 0.45/0.66 41 1 0
% 0.45/0.66 47 3 0
% 0.45/0.66 49 2 0
% 0.45/0.66 tot: 1259 474 (27.4% true)
% 0.45/0.66
% 0.45/0.66
% 0.45/0.66 Model 4 (0.00 seconds, 0 Inserts)
% 0.45/0.66
% 0.45/0.66 That finishes the proof of the theorem.
% 0.45/0.66
% 0.45/0.66 Process 24683 finished Sun Jul 3 19:29:00 2022
%------------------------------------------------------------------------------