%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : LCL213-1 : TPTP v8.1.0. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n009.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:44 EDT 2022
% Result : Unsatisfiable 2.90s 3.08s
% Output : Refutation 2.90s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : LCL213-1 : TPTP v8.1.0. Released v1.1.0.
% 0.06/0.12 % Command : sos-script %s
% 0.12/0.32 % Computer : n009.cluster.edu
% 0.12/0.32 % Model : x86_64 x86_64
% 0.12/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.32 % Memory : 8042.1875MB
% 0.12/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.32 % CPULimit : 300
% 0.12/0.32 % WCLimit : 600
% 0.12/0.32 % DateTime : Mon Jul 4 09:13:37 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.12/0.34 ----- Otter 3.2, August 2001 -----
% 0.12/0.34 The process was started by sandbox on n009.cluster.edu,
% 0.12/0.34 Mon Jul 4 09:13:37 2022
% 0.12/0.34 The command was "./sos". The process ID is 12676.
% 0.12/0.34
% 0.12/0.34 set(prolog_style_variables).
% 0.12/0.34 set(auto).
% 0.12/0.34 dependent: set(auto1).
% 0.12/0.34 dependent: set(process_input).
% 0.12/0.34 dependent: clear(print_kept).
% 0.12/0.34 dependent: clear(print_new_demod).
% 0.12/0.34 dependent: clear(print_back_demod).
% 0.12/0.34 dependent: clear(print_back_sub).
% 0.12/0.34 dependent: set(control_memory).
% 0.12/0.34 dependent: assign(max_mem, 12000).
% 0.12/0.34 dependent: assign(pick_given_ratio, 4).
% 0.12/0.34 dependent: assign(stats_level, 1).
% 0.12/0.34 dependent: assign(pick_semantic_ratio, 3).
% 0.12/0.34 dependent: assign(sos_limit, 5000).
% 0.12/0.34 dependent: assign(max_weight, 60).
% 0.12/0.34 clear(print_given).
% 0.12/0.34
% 0.12/0.34 list(usable).
% 0.12/0.34
% 0.12/0.34 SCAN INPUT: prop=0, horn=1, equality=0, symmetry=0, max_lits=3.
% 0.12/0.34
% 0.12/0.34 This is a Horn set without equality. The strategy will
% 0.12/0.34 be hyperresolution, with satellites in sos and nuclei
% 0.12/0.34 in usable.
% 0.12/0.34
% 0.12/0.34 dependent: set(hyper_res).
% 0.12/0.34 dependent: clear(order_hyper).
% 0.12/0.34
% 0.12/0.34 ------------> process usable:
% 0.12/0.34
% 0.12/0.34 ------------> process sos:
% 0.12/0.34
% 0.12/0.34 ======= end of input processing =======
% 0.19/0.37
% 0.19/0.37 Model 1 (0.00 seconds, 0 Inserts)
% 0.19/0.37
% 0.19/0.37 Stopped by limit on number of solutions
% 0.19/0.37
% 0.19/0.37
% 0.19/0.37 -------------- Softie stats --------------
% 0.19/0.37
% 0.19/0.37 UPDATE_STOP: 300
% 0.19/0.37 SFINDER_TIME_LIMIT: 2
% 0.19/0.37 SHORT_CLAUSE_CUTOFF: 4
% 0.19/0.37 number of clauses in intial UL: 4
% 0.19/0.37 number of clauses initially in problem: 9
% 0.19/0.37 percentage of clauses intially in UL: 44
% 0.19/0.37 percentage of distinct symbols occuring in initial UL: 100
% 0.19/0.37 percent of all initial clauses that are short: 100
% 0.19/0.37 absolute distinct symbol count: 6
% 0.19/0.37 distinct predicate count: 2
% 0.19/0.37 distinct function count: 2
% 0.19/0.37 distinct constant count: 2
% 0.19/0.37
% 0.19/0.37 ---------- no more Softie stats ----------
% 0.19/0.37
% 0.19/0.37
% 0.19/0.37
% 0.19/0.37 Model 2 (0.00 seconds, 0 Inserts)
% 0.19/0.37
% 0.19/0.37 Stopped by limit on number of solutions
% 0.19/0.37
% 0.19/0.37 =========== start of search ===========
% 2.90/3.08
% 2.90/3.08 -------- PROOF --------
% 2.90/3.08 % SZS status Unsatisfiable
% 2.90/3.08 % SZS output start Refutation
% 2.90/3.08
% 2.90/3.08 Model 3 (0.00 seconds, 0 Inserts)
% 2.90/3.08
% 2.90/3.08 Stopped by limit on number of solutions
% 2.90/3.08
% 2.90/3.08 Stopped by limit on insertions
% 2.90/3.08
% 2.90/3.08 Model 4 [ 1 0 286 ] (0.00 seconds, 250000 Inserts)
% 2.90/3.08
% 2.90/3.08 Stopped by limit on insertions
% 2.90/3.08
% 2.90/3.08 Model 5 [ 1 0 1001 ] (0.00 seconds, 250000 Inserts)
% 2.90/3.08
% 2.90/3.08 ----> UNIT CONFLICT at 2.71 sec ----> 1320 [binary,1319.1,4.1] {-} $F.
% 2.90/3.08
% 2.90/3.08 Length of proof is 5. Level of proof is 5.
% 2.90/3.08
% 2.90/3.08 ---------------- PROOF ----------------
% 2.90/3.08 % SZS status Unsatisfiable
% 2.90/3.08 % SZS output start Refutation
% 2.90/3.08
% 2.90/3.08 1 [] {+} theorem(A)| -axiom(A).
% 2.90/3.08 2 [] {+} theorem(A)| -axiom(or(not(B),A))| -theorem(B).
% 2.90/3.08 3 [] {+} theorem(or(not(A),B))| -axiom(or(not(A),C))| -theorem(or(not(C),B)).
% 2.90/3.08 4 [] {+} -theorem(or(not(or(not(p),q)),or(not(or(not(not(p)),q)),q))).
% 2.90/3.08 5 [] {+} axiom(or(not(or(A,A)),A)).
% 2.90/3.08 7 [] {-} axiom(or(not(or(A,B)),or(B,A))).
% 2.90/3.08 8 [] {-} axiom(or(not(or(A,or(B,C))),or(B,or(A,C)))).
% 2.90/3.08 9 [] {+} axiom(or(not(or(not(A),B)),or(not(or(C,A)),or(C,B)))).
% 2.90/3.08 10 [hyper,5,1] {+} theorem(or(not(or(A,A)),A)).
% 2.90/3.08 52 [hyper,9,2,10] {-} theorem(or(not(or(A,or(B,B))),or(A,B))).
% 2.90/3.08 111 [hyper,52,3,9] {-} theorem(or(not(or(not(A),B)),or(not(or(B,A)),B))).
% 2.90/3.08 605 [hyper,111,2,8] {-} theorem(or(not(or(A,B)),or(not(or(not(B),A)),A))).
% 2.90/3.08 1319 [hyper,605,3,7] {-} theorem(or(not(or(A,B)),or(not(or(not(A),B)),B))).
% 2.90/3.08 1320 [binary,1319.1,4.1] {-} $F.
% 2.90/3.08
% 2.90/3.08 % SZS output end Refutation
% 2.90/3.08 ------------ end of proof -------------
% 2.90/3.08
% 2.90/3.08
% 2.90/3.08 Search stopped by max_proofs option.
% 2.90/3.08
% 2.90/3.08
% 2.90/3.08 Search stopped by max_proofs option.
% 2.90/3.08
% 2.90/3.08 ============ end of search ============
% 2.90/3.08
% 2.90/3.08 ----------- soft-scott stats ----------
% 2.90/3.08
% 2.90/3.08 true clauses given 82 (32.2%)
% 2.90/3.08 false clauses given 173
% 2.90/3.08
% 2.90/3.08 FALSE TRUE
% 2.90/3.08 9 0 18
% 2.90/3.08 11 0 113
% 2.90/3.08 13 74 118
% 2.90/3.08 14 8 3
% 2.90/3.08 15 173 38
% 2.90/3.08 16 10 6
% 2.90/3.08 17 110 37
% 2.90/3.08 18 22 3
% 2.90/3.08 19 55 30
% 2.90/3.08 20 18 3
% 2.90/3.08 21 36 17
% 2.90/3.08 22 9 2
% 2.90/3.08 23 19 4
% 2.90/3.08 24 0 5
% 2.90/3.08 25 10 0
% 2.90/3.08 26 5 2
% 2.90/3.08 27 4 1
% 2.90/3.08 28 6 0
% 2.90/3.08 29 0 5
% 2.90/3.08 30 1 0
% 2.90/3.08 31 3 2
% 2.90/3.08 32 1 0
% 2.90/3.08 33 4 1
% 2.90/3.08 34 1 0
% 2.90/3.08 35 1 1
% 2.90/3.08 36 1 1
% 2.90/3.08 37 2 2
% 2.90/3.08 46 1 0
% 2.90/3.08 47 0 1
% 2.90/3.08 57 1 0
% 2.90/3.08 tot: 575 413 (41.8% true)
% 2.90/3.08
% 2.90/3.08
% 2.90/3.08 Model 5 [ 1 0 1001 ] (0.00 seconds, 250000 Inserts)
% 2.90/3.08
% 2.90/3.08 That finishes the proof of the theorem.
% 2.90/3.08
% 2.90/3.08 Process 12676 finished Mon Jul 4 09:13:40 2022
%------------------------------------------------------------------------------