TSTP Solution File: LCL215-1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : LCL215-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:45 EDT 2022
% Result : Unsatisfiable 2.40s 2.59s
% Output : Refutation 2.40s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : LCL215-1 : TPTP v8.1.0. Released v1.1.0.
% 0.08/0.14 % Command : sos-script %s
% 0.14/0.36 % Computer : n026.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 600
% 0.14/0.36 % DateTime : Mon Jul 4 18:58:22 EDT 2022
% 0.14/0.36 % CPUTime :
% 0.14/0.38 ----- Otter 3.2, August 2001 -----
% 0.14/0.38 The process was started by sandbox on n026.cluster.edu,
% 0.14/0.38 Mon Jul 4 18:58:22 2022
% 0.14/0.38 The command was "./sos". The process ID is 2826.
% 0.14/0.38
% 0.14/0.38 set(prolog_style_variables).
% 0.14/0.38 set(auto).
% 0.14/0.38 dependent: set(auto1).
% 0.14/0.38 dependent: set(process_input).
% 0.14/0.38 dependent: clear(print_kept).
% 0.14/0.38 dependent: clear(print_new_demod).
% 0.14/0.38 dependent: clear(print_back_demod).
% 0.14/0.38 dependent: clear(print_back_sub).
% 0.14/0.38 dependent: set(control_memory).
% 0.14/0.38 dependent: assign(max_mem, 12000).
% 0.14/0.38 dependent: assign(pick_given_ratio, 4).
% 0.14/0.38 dependent: assign(stats_level, 1).
% 0.14/0.38 dependent: assign(pick_semantic_ratio, 3).
% 0.14/0.38 dependent: assign(sos_limit, 5000).
% 0.14/0.38 dependent: assign(max_weight, 60).
% 0.14/0.38 clear(print_given).
% 0.14/0.38
% 0.14/0.38 list(usable).
% 0.14/0.38
% 0.14/0.38 SCAN INPUT: prop=0, horn=1, equality=0, symmetry=0, max_lits=3.
% 0.14/0.38
% 0.14/0.38 This is a Horn set without equality. The strategy will
% 0.14/0.38 be hyperresolution, with satellites in sos and nuclei
% 0.14/0.38 in usable.
% 0.14/0.38
% 0.14/0.38 dependent: set(hyper_res).
% 0.14/0.38 dependent: clear(order_hyper).
% 0.14/0.38
% 0.14/0.38 ------------> process usable:
% 0.14/0.38
% 0.14/0.38 ------------> process sos:
% 0.14/0.38
% 0.14/0.38 ======= end of input processing =======
% 0.22/0.42
% 0.22/0.42 Model 1 (0.00 seconds, 0 Inserts)
% 0.22/0.42
% 0.22/0.42 Stopped by limit on number of solutions
% 0.22/0.42
% 0.22/0.42
% 0.22/0.42 -------------- Softie stats --------------
% 0.22/0.42
% 0.22/0.42 UPDATE_STOP: 300
% 0.22/0.42 SFINDER_TIME_LIMIT: 2
% 0.22/0.42 SHORT_CLAUSE_CUTOFF: 4
% 0.22/0.42 number of clauses in intial UL: 4
% 0.22/0.42 number of clauses initially in problem: 9
% 0.22/0.42 percentage of clauses intially in UL: 44
% 0.22/0.42 percentage of distinct symbols occuring in initial UL: 100
% 0.22/0.42 percent of all initial clauses that are short: 100
% 0.22/0.42 absolute distinct symbol count: 6
% 0.22/0.42 distinct predicate count: 2
% 0.22/0.42 distinct function count: 2
% 0.22/0.42 distinct constant count: 2
% 0.22/0.42
% 0.22/0.42 ---------- no more Softie stats ----------
% 0.22/0.42
% 0.22/0.42
% 0.22/0.42
% 0.22/0.42 Model 2 (0.00 seconds, 0 Inserts)
% 0.22/0.42
% 0.22/0.42 Stopped by limit on number of solutions
% 0.22/0.42
% 0.22/0.42 =========== start of search ===========
% 2.40/2.59
% 2.40/2.59 -------- PROOF --------
% 2.40/2.59 % SZS status Unsatisfiable
% 2.40/2.59 % SZS output start Refutation
% 2.40/2.59
% 2.40/2.59 Model 3 (0.00 seconds, 0 Inserts)
% 2.40/2.59
% 2.40/2.59 Stopped by limit on number of solutions
% 2.40/2.59
% 2.40/2.59 Stopped by limit on insertions
% 2.40/2.59
% 2.40/2.59 Model 4 [ 1 1 102 ] (0.00 seconds, 250000 Inserts)
% 2.40/2.59
% 2.40/2.59 Stopped by limit on insertions
% 2.40/2.59
% 2.40/2.59 Model 5 [ 1 1 11154 ] (0.00 seconds, 250000 Inserts)
% 2.40/2.59
% 2.40/2.59 Stopped by limit on insertions
% 2.40/2.59
% 2.40/2.59 Model 6 [ 2 23 228397 ] (0.00 seconds, 250000 Inserts)
% 2.40/2.59
% 2.40/2.59 Model 7 (0.00 seconds, 250000 Inserts)
% 2.40/2.59
% 2.40/2.59 Stopped by limit on number of solutions
% 2.40/2.59
% 2.40/2.59 Modelling stopped after 300 given clauses and 0.00 seconds
% 2.40/2.59
% 2.40/2.59
% 2.40/2.59 ----> UNIT CONFLICT at 2.18 sec ----> 3581 [binary,3580.1,4.1] {-} $F.
% 2.40/2.59
% 2.40/2.59 Length of proof is 6. Level of proof is 6.
% 2.40/2.59
% 2.40/2.59 ---------------- PROOF ----------------
% 2.40/2.59 % SZS status Unsatisfiable
% 2.40/2.59 % SZS output start Refutation
% 2.40/2.59
% 2.40/2.59 1 [] {+} theorem(A)| -axiom(A).
% 2.40/2.59 2 [] {+} theorem(A)| -axiom(or(not(B),A))| -theorem(B).
% 2.40/2.59 3 [] {+} theorem(or(not(A),B))| -axiom(or(not(A),C))| -theorem(or(not(C),B)).
% 2.40/2.59 4 [] {+} -theorem(or(not(or(not(p),q)),or(not(or(p,q)),q))).
% 2.40/2.59 5 [] {+} axiom(or(not(or(A,A)),A)).
% 2.40/2.59 7 [] {-} axiom(or(not(or(A,B)),or(B,A))).
% 2.40/2.59 8 [] {-} axiom(or(not(or(A,or(B,C))),or(B,or(A,C)))).
% 2.40/2.59 9 [] {+} axiom(or(not(or(not(A),B)),or(not(or(C,A)),or(C,B)))).
% 2.40/2.59 10 [hyper,5,1] {+} theorem(or(not(or(A,A)),A)).
% 2.40/2.59 52 [hyper,9,2,10] {-} theorem(or(not(or(A,or(B,B))),or(A,B))).
% 2.40/2.59 132 [hyper,52,3,9] {-} theorem(or(not(or(not(A),B)),or(not(or(B,A)),B))).
% 2.40/2.59 929 [hyper,132,2,8] {-} theorem(or(not(or(A,B)),or(not(or(not(B),A)),A))).
% 2.40/2.59 2020 [hyper,929,3,7] {-} theorem(or(not(or(A,B)),or(not(or(not(A),B)),B))).
% 2.40/2.59 3580 [hyper,2020,2,8] {-} theorem(or(not(or(not(A),B)),or(not(or(A,B)),B))).
% 2.40/2.59 3581 [binary,3580.1,4.1] {-} $F.
% 2.40/2.59
% 2.40/2.59 % SZS output end Refutation
% 2.40/2.59 ------------ end of proof -------------
% 2.40/2.59
% 2.40/2.59
% 2.40/2.59 Search stopped by max_proofs option.
% 2.40/2.59
% 2.40/2.59
% 2.40/2.59 Search stopped by max_proofs option.
% 2.40/2.59
% 2.40/2.59 ============ end of search ============
% 2.40/2.59
% 2.40/2.59 ----------- soft-scott stats ----------
% 2.40/2.59
% 2.40/2.59 true clauses given 189 (23.7%)
% 2.40/2.59 false clauses given 610
% 2.40/2.59
% 2.40/2.59 FALSE TRUE
% 2.40/2.59 11 0 114
% 2.40/2.59 12 0 1
% 2.40/2.59 13 114 200
% 2.40/2.59 14 6 7
% 2.40/2.59 15 583 75
% 2.40/2.59 16 9 14
% 2.40/2.59 17 391 69
% 2.40/2.59 18 32 16
% 2.40/2.59 19 276 16
% 2.40/2.59 20 50 10
% 2.40/2.59 21 151 14
% 2.40/2.59 22 34 4
% 2.40/2.59 23 111 3
% 2.40/2.59 24 18 3
% 2.40/2.59 25 63 1
% 2.40/2.59 26 31 1
% 2.40/2.59 27 26 1
% 2.40/2.59 28 26 3
% 2.40/2.59 29 17 0
% 2.40/2.59 30 5 0
% 2.40/2.59 31 17 0
% 2.40/2.59 32 6 0
% 2.40/2.59 33 18 1
% 2.40/2.59 34 2 2
% 2.40/2.59 35 6 2
% 2.40/2.59 36 6 0
% 2.40/2.59 37 13 0
% 2.40/2.59 38 3 0
% 2.40/2.59 39 4 0
% 2.40/2.59 40 1 0
% 2.40/2.59 41 3 0
% 2.40/2.59 42 1 0
% 2.40/2.59 43 1 0
% 2.40/2.59 45 3 0
% 2.40/2.59 46 2 0
% 2.40/2.59 47 3 0
% 2.40/2.59 49 3 0
% 2.40/2.59 57 2 0
% 2.40/2.59 tot: 2037 557 (21.5% true)
% 2.40/2.59
% 2.40/2.59
% 2.40/2.59 Model 7 (0.00 seconds, 250000 Inserts)
% 2.40/2.59
% 2.40/2.59 That finishes the proof of the theorem.
% 2.40/2.59
% 2.40/2.59 Process 2826 finished Mon Jul 4 18:58:24 2022
%------------------------------------------------------------------------------