%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : LCL362-1 : TPTP v8.1.0. Released v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n028.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:29:42 EDT 2022
% Result : Unsatisfiable 3.49s 3.75s
% Output : Refutation 3.49s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : LCL362-1 : TPTP v8.1.0. Released v2.3.0.
% 0.07/0.13 % Command : sos-script %s
% 0.12/0.33 % Computer : n028.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 : Mon Jul 4 17:52:05 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.12/0.35 ----- Otter 3.2, August 2001 -----
% 0.12/0.35 The process was started by sandbox on n028.cluster.edu,
% 0.12/0.35 Mon Jul 4 17:52:05 2022
% 0.12/0.35 The command was "./sos". The process ID is 2930.
% 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.12/0.38
% 0.12/0.38 Model 1 (0.00 seconds, 0 Inserts)
% 0.12/0.38
% 0.12/0.38 Stopped by limit on number of solutions
% 0.12/0.38
% 0.12/0.38
% 0.12/0.38 -------------- Softie stats --------------
% 0.12/0.38
% 0.12/0.38 UPDATE_STOP: 300
% 0.12/0.38 SFINDER_TIME_LIMIT: 2
% 0.12/0.38 SHORT_CLAUSE_CUTOFF: 4
% 0.12/0.38 number of clauses in intial UL: 2
% 0.12/0.38 number of clauses initially in problem: 5
% 0.12/0.38 percentage of clauses intially in UL: 40
% 0.12/0.38 percentage of distinct symbols occuring in initial UL: 100
% 0.12/0.38 percent of all initial clauses that are short: 100
% 0.12/0.38 absolute distinct symbol count: 5
% 0.12/0.38 distinct predicate count: 1
% 0.12/0.38 distinct function count: 2
% 0.12/0.38 distinct constant count: 2
% 0.12/0.38
% 0.12/0.38 ---------- no more Softie stats ----------
% 0.12/0.38
% 0.12/0.38
% 0.12/0.38
% 0.12/0.38 =========== start of search ===========
% 3.49/3.75
% 3.49/3.75 -------- PROOF --------
% 3.49/3.75 % SZS status Unsatisfiable
% 3.49/3.75 % SZS output start Refutation
% 3.49/3.75
% 3.49/3.75 Model 2 (0.00 seconds, 0 Inserts)
% 3.49/3.75
% 3.49/3.75 Stopped by limit on number of solutions
% 3.49/3.75
% 3.49/3.75 Model 3 (0.00 seconds, 0 Inserts)
% 3.49/3.75
% 3.49/3.75 Stopped by limit on number of solutions
% 3.49/3.75
% 3.49/3.75 Stopped by limit on insertions
% 3.49/3.75
% 3.49/3.75 Model 4 [ 1 1 214 ] (0.00 seconds, 250000 Inserts)
% 3.49/3.75
% 3.49/3.75 ----> UNIT CONFLICT at 3.37 sec ----> 304 [binary,303.1,2.1] {-} $F.
% 3.49/3.75
% 3.49/3.75 Length of proof is 10. Level of proof is 6.
% 3.49/3.75
% 3.49/3.75 ---------------- PROOF ----------------
% 3.49/3.75 % SZS status Unsatisfiable
% 3.49/3.75 % SZS output start Refutation
% 3.49/3.75
% 3.49/3.75 1 [] {+} -is_a_theorem(implies(A,B))| -is_a_theorem(A)|is_a_theorem(B).
% 3.49/3.75 2 [] {+} -is_a_theorem(implies(implies(x,implies(implies(not(y),y),y)),implies(implies(not(y),y),y))).
% 3.49/3.75 3 [] {-} is_a_theorem(implies(implies(A,B),implies(implies(B,C),implies(A,C)))).
% 3.49/3.75 4 [] {+} is_a_theorem(implies(implies(not(A),A),A)).
% 3.49/3.75 5 [] {+} is_a_theorem(implies(A,implies(not(A),B))).
% 3.49/3.75 6 [hyper,3,1,3] {-} is_a_theorem(implies(implies(implies(implies(A,B),implies(C,B)),D),implies(implies(C,A),D))).
% 3.49/3.75 7 [hyper,4,1,3] {-} is_a_theorem(implies(implies(A,B),implies(implies(not(A),A),B))).
% 3.49/3.75 9 [hyper,5,1,3] {-} is_a_theorem(implies(implies(implies(not(A),B),C),implies(A,C))).
% 3.49/3.75 12 [hyper,7,1,7] {+} is_a_theorem(implies(implies(not(implies(A,B)),implies(A,B)),implies(implies(not(A),A),B))).
% 3.49/3.75 29 [hyper,9,1,6] {-} is_a_theorem(implies(implies(A,not(B)),implies(B,implies(A,C)))).
% 3.49/3.75 34 [hyper,9,1,4] {+} is_a_theorem(implies(A,A)).
% 3.49/3.75 36 [hyper,34,1,5] {+} is_a_theorem(implies(not(implies(A,A)),B)).
% 3.49/3.75 61 [hyper,29,1,36] {-} is_a_theorem(implies(A,implies(not(implies(B,B)),C))).
% 3.49/3.75 83 [hyper,61,1,3] {-} is_a_theorem(implies(implies(implies(not(implies(A,A)),B),C),implies(D,C))).
% 3.49/3.75 303 [hyper,83,1,12] {-} is_a_theorem(implies(A,implies(implies(not(B),B),B))).
% 3.49/3.75 304 [binary,303.1,2.1] {-} $F.
% 3.49/3.75
% 3.49/3.75 % SZS output end Refutation
% 3.49/3.75 ------------ end of proof -------------
% 3.49/3.75
% 3.49/3.75
% 3.49/3.75 Search stopped by max_proofs option.
% 3.49/3.75
% 3.49/3.75
% 3.49/3.75 Search stopped by max_proofs option.
% 3.49/3.75
% 3.49/3.75 ============ end of search ============
% 3.49/3.75
% 3.49/3.75 ----------- soft-scott stats ----------
% 3.49/3.75
% 3.49/3.75 true clauses given 6 (17.6%)
% 3.49/3.75 false clauses given 28
% 3.49/3.75
% 3.49/3.75 FALSE TRUE
% 3.49/3.75 13 2 6
% 3.49/3.75 14 9 2
% 3.49/3.75 15 24 0
% 3.49/3.75 16 18 5
% 3.49/3.75 17 26 0
% 3.49/3.75 18 25 0
% 3.49/3.75 19 18 6
% 3.49/3.75 20 27 1
% 3.49/3.75 21 22 0
% 3.49/3.75 22 7 1
% 3.49/3.75 23 9 0
% 3.49/3.75 24 6 0
% 3.49/3.75 25 5 4
% 3.49/3.75 26 0 1
% 3.49/3.75 27 5 0
% 3.49/3.75 29 9 0
% 3.49/3.75 31 4 0
% 3.49/3.75 33 1 0
% 3.49/3.75 35 2 0
% 3.49/3.75 37 1 1
% 3.49/3.75 tot: 220 27 (10.9% true)
% 3.49/3.75
% 3.49/3.75
% 3.49/3.75 Model 4 [ 1 1 214 ] (0.00 seconds, 250000 Inserts)
% 3.49/3.75
% 3.49/3.75 That finishes the proof of the theorem.
% 3.49/3.75
% 3.49/3.75 Process 2930 finished Mon Jul 4 17:52:08 2022
%------------------------------------------------------------------------------