%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : LCL044-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n018.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:27:33 EDT 2022
% Result : Unsatisfiable 1.13s 1.35s
% Output : Refutation 1.13s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : LCL044-1 : TPTP v8.1.0. Released v1.0.0.
% 0.11/0.13 % Command : sos-script %s
% 0.12/0.34 % Computer : n018.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 07:40:19 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 n018.cluster.edu,
% 0.12/0.36 Sun Jul 3 07:40:19 2022
% 0.12/0.36 The command was "./sos". The process ID is 15308.
% 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.39
% 0.12/0.39 Model 1 (0.00 seconds, 0 Inserts)
% 0.12/0.39
% 0.12/0.39 Stopped by limit on number of solutions
% 0.12/0.39
% 0.12/0.39
% 0.12/0.39 -------------- Softie stats --------------
% 0.12/0.39
% 0.12/0.39 UPDATE_STOP: 300
% 0.12/0.39 SFINDER_TIME_LIMIT: 2
% 0.12/0.39 SHORT_CLAUSE_CUTOFF: 4
% 0.12/0.40 number of clauses in intial UL: 2
% 0.12/0.40 number of clauses initially in problem: 7
% 0.12/0.40 percentage of clauses intially in UL: 28
% 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: 4
% 0.12/0.40 distinct predicate count: 1
% 0.12/0.40 distinct function count: 2
% 0.12/0.40 distinct constant count: 1
% 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 ===========
% 1.13/1.35
% 1.13/1.35 -------- PROOF --------
% 1.13/1.35 % SZS status Unsatisfiable
% 1.13/1.35 % SZS output start Refutation
% 1.13/1.35
% 1.13/1.35 Model 3 (0.00 seconds, 0 Inserts)
% 1.13/1.35
% 1.13/1.35 Stopped by limit on number of solutions
% 1.13/1.35
% 1.13/1.35 Model 4 (0.00 seconds, 0 Inserts)
% 1.13/1.35
% 1.13/1.35 Stopped by limit on number of solutions
% 1.13/1.35
% 1.13/1.35 Model 5 [ 1 1 30 ] (0.00 seconds, 28598 Inserts)
% 1.13/1.35
% 1.13/1.35 Model 6 [ 1 1 29 ] (0.00 seconds, 67044 Inserts)
% 1.13/1.35
% 1.13/1.35 Model 7 [ 1 1 2006 ] (0.00 seconds, 139526 Inserts)
% 1.13/1.35
% 1.13/1.35 Model 8 [ 2 7 28445 ] (0.00 seconds, 32362 Inserts)
% 1.13/1.35
% 1.13/1.35 Model 9 [ 2 1 354 ] (0.00 seconds, 227102 Inserts)
% 1.13/1.35
% 1.13/1.35 ----> UNIT CONFLICT at 0.97 sec ----> 837 [binary,836.1,2.1] {-} $F.
% 1.13/1.35
% 1.13/1.35 Length of proof is 6. Level of proof is 4.
% 1.13/1.35
% 1.13/1.35 ---------------- PROOF ----------------
% 1.13/1.35 % SZS status Unsatisfiable
% 1.13/1.35 % SZS output start Refutation
% 1.13/1.35
% 1.13/1.35 1 [] {+} -is_a_theorem(implies(A,B))| -is_a_theorem(A)|is_a_theorem(B).
% 1.13/1.35 2 [] {+} -is_a_theorem(implies(a,not(not(a)))).
% 1.13/1.35 3 [] {+} is_a_theorem(implies(A,implies(not(A),B))).
% 1.13/1.35 4 [] {+} is_a_theorem(implies(A,implies(B,A))).
% 1.13/1.35 5 [] {+} is_a_theorem(implies(implies(A,implies(B,C)),implies(B,implies(A,C)))).
% 1.13/1.35 6 [] {+} is_a_theorem(implies(implies(A,B),implies(implies(C,A),implies(C,B)))).
% 1.13/1.35 7 [] {-} is_a_theorem(implies(implies(A,B),implies(implies(not(A),B),B))).
% 1.13/1.35 15 [hyper,7,1,4] {-} is_a_theorem(implies(implies(not(A),implies(B,A)),implies(B,A))).
% 1.13/1.36 20 [hyper,15,1,3] {+} is_a_theorem(implies(not(not(A)),A)).
% 1.13/1.36 32 [hyper,5,1,3] {+} is_a_theorem(implies(not(A),implies(A,B))).
% 1.13/1.36 95 [hyper,32,1,6] {-} is_a_theorem(implies(implies(A,not(B)),implies(A,implies(B,C)))).
% 1.13/1.36 804 [hyper,95,1,20] {-} is_a_theorem(implies(not(not(not(A))),implies(A,B))).
% 1.13/1.36 836 [hyper,804,1,15] {-} is_a_theorem(implies(A,not(not(A)))).
% 1.13/1.36 837 [binary,836.1,2.1] {-} $F.
% 1.13/1.36
% 1.13/1.36 % SZS output end Refutation
% 1.13/1.36 ------------ end of proof -------------
% 1.13/1.36
% 1.13/1.36
% 1.13/1.36 Search stopped by max_proofs option.
% 1.13/1.36
% 1.13/1.36
% 1.13/1.36 Search stopped by max_proofs option.
% 1.13/1.36
% 1.13/1.36 ============ end of search ============
% 1.13/1.36
% 1.13/1.36 ----------- soft-scott stats ----------
% 1.13/1.36
% 1.13/1.36 true clauses given 24 (32.9%)
% 1.13/1.36 false clauses given 49
% 1.13/1.36
% 1.13/1.36 FALSE TRUE
% 1.13/1.36 9 1 6
% 1.13/1.36 10 0 22
% 1.13/1.36 11 34 22
% 1.13/1.36 12 39 42
% 1.13/1.36 13 75 33
% 1.13/1.36 14 82 32
% 1.13/1.36 15 59 34
% 1.13/1.36 16 40 33
% 1.13/1.36 17 37 15
% 1.13/1.36 18 29 16
% 1.13/1.36 19 16 12
% 1.13/1.36 20 4 10
% 1.13/1.36 21 3 10
% 1.13/1.36 22 3 7
% 1.13/1.36 23 1 8
% 1.13/1.36 24 2 4
% 1.13/1.36 25 0 2
% 1.13/1.36 26 0 3
% 1.13/1.36 27 0 3
% 1.13/1.36 tot: 425 314 (42.5% true)
% 1.13/1.36
% 1.13/1.36
% 1.13/1.36 Model 9 [ 2 1 354 ] (0.00 seconds, 227102 Inserts)
% 1.13/1.36
% 1.13/1.36 That finishes the proof of the theorem.
% 1.13/1.36
% 1.13/1.36 Process 15308 finished Sun Jul 3 07:40:20 2022
%------------------------------------------------------------------------------