%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : LCL189-1 : TPTP v8.1.0. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n005.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:29 EDT 2022
% Result : Unsatisfiable 2.36s 2.54s
% Output : Refutation 2.36s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : LCL189-1 : TPTP v8.1.0. Released v1.1.0.
% 0.04/0.13 % Command : sos-script %s
% 0.12/0.33 % Computer : n005.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Sun Jul 3 00:14:37 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.12/0.35 ----- Otter 3.2, August 2001 -----
% 0.12/0.35 The process was started by sandbox on n005.cluster.edu,
% 0.12/0.35 Sun Jul 3 00:14:37 2022
% 0.12/0.35 The command was "./sos". The process ID is 16966.
% 0.12/0.35
% 0.12/0.35 set(prolog_style_variables).
% 0.12/0.35 set(auto).
% 0.12/0.35 dependent: set(auto1).
% 0.12/0.35 dependent: set(process_input).
% 0.12/0.35 dependent: clear(print_kept).
% 0.12/0.35 dependent: clear(print_new_demod).
% 0.12/0.35 dependent: clear(print_back_demod).
% 0.12/0.35 dependent: clear(print_back_sub).
% 0.12/0.35 dependent: set(control_memory).
% 0.12/0.35 dependent: assign(max_mem, 12000).
% 0.12/0.35 dependent: assign(pick_given_ratio, 4).
% 0.12/0.35 dependent: assign(stats_level, 1).
% 0.12/0.35 dependent: assign(pick_semantic_ratio, 3).
% 0.12/0.35 dependent: assign(sos_limit, 5000).
% 0.12/0.35 dependent: assign(max_weight, 60).
% 0.12/0.35 clear(print_given).
% 0.12/0.35
% 0.12/0.35 list(usable).
% 0.12/0.35
% 0.12/0.35 SCAN INPUT: prop=0, horn=1, equality=0, symmetry=0, max_lits=3.
% 0.12/0.35
% 0.12/0.35 This is a Horn set without equality. The strategy will
% 0.12/0.35 be hyperresolution, with satellites in sos and nuclei
% 0.12/0.35 in usable.
% 0.12/0.35
% 0.12/0.35 dependent: set(hyper_res).
% 0.12/0.35 dependent: clear(order_hyper).
% 0.12/0.35
% 0.12/0.35 ------------> process usable:
% 0.12/0.35
% 0.12/0.35 ------------> process sos:
% 0.12/0.35
% 0.12/0.35 ======= end of input processing =======
% 0.19/0.38
% 0.19/0.38 Model 1 (0.00 seconds, 0 Inserts)
% 0.19/0.38
% 0.19/0.38 Stopped by limit on number of solutions
% 0.19/0.38
% 0.19/0.38
% 0.19/0.38 -------------- Softie stats --------------
% 0.19/0.38
% 0.19/0.38 UPDATE_STOP: 300
% 0.19/0.38 SFINDER_TIME_LIMIT: 2
% 0.19/0.38 SHORT_CLAUSE_CUTOFF: 4
% 0.19/0.38 number of clauses in intial UL: 4
% 0.19/0.38 number of clauses initially in problem: 9
% 0.19/0.38 percentage of clauses intially in UL: 44
% 0.19/0.38 percentage of distinct symbols occuring in initial UL: 100
% 0.19/0.38 percent of all initial clauses that are short: 100
% 0.19/0.38 absolute distinct symbol count: 6
% 0.19/0.38 distinct predicate count: 2
% 0.19/0.38 distinct function count: 2
% 0.19/0.38 distinct constant count: 2
% 0.19/0.38
% 0.19/0.38 ---------- no more Softie stats ----------
% 0.19/0.38
% 0.19/0.38
% 0.19/0.38
% 0.19/0.38 Model 2 (0.00 seconds, 0 Inserts)
% 0.19/0.38
% 0.19/0.38 Stopped by limit on number of solutions
% 0.19/0.38
% 0.19/0.38 =========== start of search ===========
% 2.36/2.54
% 2.36/2.54 -------- PROOF --------
% 2.36/2.54 % SZS status Unsatisfiable
% 2.36/2.54 % SZS output start Refutation
% 2.36/2.54
% 2.36/2.54 Model 3 (0.00 seconds, 0 Inserts)
% 2.36/2.54
% 2.36/2.54 Stopped by limit on number of solutions
% 2.36/2.54
% 2.36/2.54 Stopped by limit on insertions
% 2.36/2.54
% 2.36/2.54 Model 4 [ 1 1 3792 ] (0.00 seconds, 250000 Inserts)
% 2.36/2.54
% 2.36/2.54 Stopped by limit on insertions
% 2.36/2.54
% 2.36/2.54 Model 5 [ 1 1 1009 ] (0.00 seconds, 250000 Inserts)
% 2.36/2.54
% 2.36/2.54 Stopped by limit on insertions
% 2.36/2.54
% 2.36/2.54 Model 6 [ 1 4 43863 ] (0.00 seconds, 250000 Inserts)
% 2.36/2.54
% 2.36/2.54 ----> UNIT CONFLICT at 2.17 sec ----> 40 [binary,39.1,4.1] {-} $F.
% 2.36/2.54
% 2.36/2.54 Length of proof is 3. Level of proof is 3.
% 2.36/2.54
% 2.36/2.54 ---------------- PROOF ----------------
% 2.36/2.54 % SZS status Unsatisfiable
% 2.36/2.54 % SZS output start Refutation
% 2.36/2.54
% 2.36/2.54 1 [] {+} theorem(A)| -axiom(A).
% 2.36/2.54 2 [] {+} theorem(A)| -axiom(or(not(B),A))| -theorem(B).
% 2.36/2.54 3 [] {+} theorem(or(not(A),B))| -axiom(or(not(A),C))| -theorem(or(not(C),B)).
% 2.36/2.54 4 [] {+} -theorem(or(not(p),or(not(or(not(p),q)),q))).
% 2.36/2.54 5 [] {+} axiom(or(not(or(A,A)),A)).
% 2.36/2.54 6 [] {+} axiom(or(not(A),or(B,A))).
% 2.36/2.54 8 [] {-} axiom(or(not(or(A,or(B,C))),or(B,or(A,C)))).
% 2.36/2.54 10 [hyper,5,1] {+} theorem(or(not(or(A,A)),A)).
% 2.36/2.54 18 [hyper,10,3,6] {+} theorem(or(not(A),A)).
% 2.36/2.54 39 [hyper,18,2,8] {-} theorem(or(A,or(not(or(A,B)),B))).
% 2.36/2.54 40 [binary,39.1,4.1] {-} $F.
% 2.36/2.54
% 2.36/2.54 % SZS output end Refutation
% 2.36/2.54 ------------ end of proof -------------
% 2.36/2.54
% 2.36/2.54
% 2.36/2.54 Search stopped by max_proofs option.
% 2.36/2.54
% 2.36/2.54
% 2.36/2.54 Search stopped by max_proofs option.
% 2.36/2.54
% 2.36/2.54 ============ end of search ============
% 2.36/2.54
% 2.36/2.54 ----------- soft-scott stats ----------
% 2.36/2.54
% 2.36/2.54 true clauses given 1 (11.1%)
% 2.36/2.54 false clauses given 8
% 2.36/2.54
% 2.36/2.54 FALSE TRUE
% 2.36/2.54 7 2 1
% 2.36/2.54 9 4 3
% 2.36/2.54 11 3 0
% 2.36/2.54 12 1 0
% 2.36/2.54 13 5 0
% 2.36/2.54 14 0 1
% 2.36/2.54 15 1 1
% 2.36/2.54 16 1 0
% 2.36/2.54 22 1 0
% 2.36/2.54 tot: 18 6 (25.0% true)
% 2.36/2.54
% 2.36/2.54
% 2.36/2.54 Model 6 [ 1 4 43863 ] (0.00 seconds, 250000 Inserts)
% 2.36/2.54
% 2.36/2.54 That finishes the proof of the theorem.
% 2.36/2.54
% 2.36/2.54 Process 16966 finished Sun Jul 3 00:14:39 2022
%------------------------------------------------------------------------------