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