TSTP Solution File: LCL201-1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : LCL201-1 : TPTP v8.1.0. Released v1.1.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:28:36 EDT 2022
% Result : Unsatisfiable 1.64s 1.91s
% Output : Refutation 1.64s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : LCL201-1 : TPTP v8.1.0. Released v1.1.0.
% 0.10/0.13 % Command : sos-script %s
% 0.13/0.32 % Computer : n029.cluster.edu
% 0.13/0.32 % Model : x86_64 x86_64
% 0.13/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.32 % Memory : 8042.1875MB
% 0.13/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.32 % CPULimit : 300
% 0.13/0.32 % WCLimit : 600
% 0.13/0.32 % DateTime : Sun Jul 3 13:59:26 EDT 2022
% 0.13/0.32 % CPUTime :
% 0.13/0.34 ----- Otter 3.2, August 2001 -----
% 0.13/0.34 The process was started by sandbox2 on n029.cluster.edu,
% 0.13/0.34 Sun Jul 3 13:59:26 2022
% 0.13/0.34 The command was "./sos". The process ID is 27814.
% 0.13/0.34
% 0.13/0.34 set(prolog_style_variables).
% 0.13/0.34 set(auto).
% 0.13/0.34 dependent: set(auto1).
% 0.13/0.34 dependent: set(process_input).
% 0.13/0.34 dependent: clear(print_kept).
% 0.13/0.34 dependent: clear(print_new_demod).
% 0.13/0.34 dependent: clear(print_back_demod).
% 0.13/0.34 dependent: clear(print_back_sub).
% 0.13/0.34 dependent: set(control_memory).
% 0.13/0.34 dependent: assign(max_mem, 12000).
% 0.13/0.34 dependent: assign(pick_given_ratio, 4).
% 0.13/0.34 dependent: assign(stats_level, 1).
% 0.13/0.34 dependent: assign(pick_semantic_ratio, 3).
% 0.13/0.34 dependent: assign(sos_limit, 5000).
% 0.13/0.34 dependent: assign(max_weight, 60).
% 0.13/0.34 clear(print_given).
% 0.13/0.34
% 0.13/0.34 list(usable).
% 0.13/0.34
% 0.13/0.34 SCAN INPUT: prop=0, horn=1, equality=0, symmetry=0, max_lits=3.
% 0.13/0.34
% 0.13/0.34 This is a Horn set without equality. The strategy will
% 0.13/0.34 be hyperresolution, with satellites in sos and nuclei
% 0.13/0.34 in usable.
% 0.13/0.34
% 0.13/0.34 dependent: set(hyper_res).
% 0.13/0.34 dependent: clear(order_hyper).
% 0.13/0.34
% 0.13/0.34 ------------> process usable:
% 0.13/0.34
% 0.13/0.34 ------------> process sos:
% 0.13/0.34
% 0.13/0.34 ======= end of input processing =======
% 0.13/0.37
% 0.13/0.37 Model 1 (0.00 seconds, 0 Inserts)
% 0.13/0.37
% 0.13/0.37 Stopped by limit on number of solutions
% 0.13/0.37
% 0.13/0.37
% 0.13/0.37 -------------- Softie stats --------------
% 0.13/0.37
% 0.13/0.37 UPDATE_STOP: 300
% 0.13/0.37 SFINDER_TIME_LIMIT: 2
% 0.13/0.37 SHORT_CLAUSE_CUTOFF: 4
% 0.13/0.37 number of clauses in intial UL: 4
% 0.13/0.37 number of clauses initially in problem: 9
% 0.13/0.37 percentage of clauses intially in UL: 44
% 0.13/0.37 percentage of distinct symbols occuring in initial UL: 100
% 0.13/0.37 percent of all initial clauses that are short: 100
% 0.13/0.37 absolute distinct symbol count: 6
% 0.13/0.37 distinct predicate count: 2
% 0.13/0.37 distinct function count: 2
% 0.13/0.37 distinct constant count: 2
% 0.13/0.37
% 0.13/0.37 ---------- no more Softie stats ----------
% 0.13/0.37
% 0.13/0.37
% 0.13/0.37
% 0.13/0.37 Model 2 (0.00 seconds, 0 Inserts)
% 0.13/0.37
% 0.13/0.37 Stopped by limit on number of solutions
% 0.13/0.37
% 0.13/0.37 =========== start of search ===========
% 1.64/1.91
% 1.64/1.91 -------- PROOF --------
% 1.64/1.91 % SZS status Unsatisfiable
% 1.64/1.91 % SZS output start Refutation
% 1.64/1.91
% 1.64/1.91 Model 3 (0.00 seconds, 0 Inserts)
% 1.64/1.91
% 1.64/1.91 Stopped by limit on number of solutions
% 1.64/1.91
% 1.64/1.91 Stopped by limit on insertions
% 1.64/1.91
% 1.64/1.91 Model 4 [ 1 7 26836 ] (0.00 seconds, 250000 Inserts)
% 1.64/1.91
% 1.64/1.91 ----> UNIT CONFLICT at 1.54 sec ----> 448 [binary,447.1,4.1] {-} $F.
% 1.64/1.91
% 1.64/1.91 Length of proof is 6. Level of proof is 6.
% 1.64/1.91
% 1.64/1.91 ---------------- PROOF ----------------
% 1.64/1.91 % SZS status Unsatisfiable
% 1.64/1.91 % SZS output start Refutation
% 1.64/1.91
% 1.64/1.91 1 [] {+} theorem(A)| -axiom(A).
% 1.64/1.91 2 [] {+} theorem(A)| -axiom(or(not(B),A))| -theorem(B).
% 1.64/1.91 3 [] {+} theorem(or(not(A),B))| -axiom(or(not(A),C))| -theorem(or(not(C),B)).
% 1.64/1.91 4 [] {+} -theorem(or(not(not(or(p,q))),or(not(p),q))).
% 1.64/1.91 6 [] {+} axiom(or(not(A),or(B,A))).
% 1.64/1.91 7 [] {-} axiom(or(not(or(A,B)),or(B,A))).
% 1.64/1.91 8 [] {+} axiom(or(not(or(A,or(B,C))),or(B,or(A,C)))).
% 1.64/1.91 12 [hyper,7,1] {-} theorem(or(not(or(A,B)),or(B,A))).
% 1.64/1.91 14 [hyper,12,3,6] {+} theorem(or(not(A),or(A,B))).
% 1.64/1.91 25 [hyper,8,2,14] {+} theorem(or(A,or(not(A),B))).
% 1.64/1.91 118 [hyper,25,3,7] {-} theorem(or(not(or(A,B)),or(not(not(or(B,A))),C))).
% 1.64/1.91 435 [hyper,118,3,6] {-} theorem(or(not(A),or(not(not(or(A,B))),C))).
% 1.64/1.91 447 [hyper,435,2,8] {-} theorem(or(not(not(or(A,B))),or(not(A),C))).
% 1.64/1.91 448 [binary,447.1,4.1] {-} $F.
% 1.64/1.91
% 1.64/1.91 % SZS output end Refutation
% 1.64/1.91 ------------ end of proof -------------
% 1.64/1.91
% 1.64/1.91
% 1.64/1.91 Search stopped by max_proofs option.
% 1.64/1.91
% 1.64/1.91
% 1.64/1.91 Search stopped by max_proofs option.
% 1.64/1.91
% 1.64/1.91 ============ end of search ============
% 1.64/1.91
% 1.64/1.91 ----------- soft-scott stats ----------
% 1.64/1.91
% 1.64/1.91 true clauses given 37 (38.9%)
% 1.64/1.91 false clauses given 58
% 1.64/1.91
% 1.64/1.91 FALSE TRUE
% 1.64/1.91 9 0 25
% 1.64/1.91 11 0 31
% 1.64/1.91 13 55 37
% 1.64/1.91 14 5 2
% 1.64/1.91 15 47 23
% 1.64/1.91 16 8 0
% 1.64/1.91 17 24 17
% 1.64/1.91 18 5 0
% 1.64/1.91 19 10 12
% 1.64/1.91 20 2 2
% 1.64/1.91 21 6 6
% 1.64/1.91 22 1 1
% 1.64/1.91 23 2 0
% 1.64/1.91 27 0 1
% 1.64/1.91 28 0 1
% 1.64/1.91 33 0 1
% 1.64/1.91 tot: 165 159 (49.1% true)
% 1.64/1.91
% 1.64/1.91
% 1.64/1.91 Model 4 [ 1 7 26836 ] (0.00 seconds, 250000 Inserts)
% 1.64/1.91
% 1.64/1.91 That finishes the proof of the theorem.
% 1.64/1.91
% 1.64/1.91 Process 27814 finished Sun Jul 3 13:59:27 2022
%------------------------------------------------------------------------------