%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : LCL188-3 : TPTP v8.1.0. Released v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n015.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:28 EDT 2022
% Result : Unsatisfiable 2.04s 2.25s
% Output : Refutation 2.04s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : LCL188-3 : TPTP v8.1.0. Released v2.3.0.
% 0.12/0.13 % Command : sos-script %s
% 0.13/0.34 % Computer : n015.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Mon Jul 4 10:45:16 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.13/0.36 ----- Otter 3.2, August 2001 -----
% 0.13/0.36 The process was started by sandbox2 on n015.cluster.edu,
% 0.13/0.36 Mon Jul 4 10:45:16 2022
% 0.13/0.36 The command was "./sos". The process ID is 18081.
% 0.13/0.36
% 0.13/0.36 set(prolog_style_variables).
% 0.13/0.36 set(auto).
% 0.13/0.36 dependent: set(auto1).
% 0.13/0.36 dependent: set(process_input).
% 0.13/0.36 dependent: clear(print_kept).
% 0.13/0.36 dependent: clear(print_new_demod).
% 0.13/0.36 dependent: clear(print_back_demod).
% 0.13/0.36 dependent: clear(print_back_sub).
% 0.13/0.36 dependent: set(control_memory).
% 0.13/0.36 dependent: assign(max_mem, 12000).
% 0.13/0.36 dependent: assign(pick_given_ratio, 4).
% 0.13/0.36 dependent: assign(stats_level, 1).
% 0.13/0.36 dependent: assign(pick_semantic_ratio, 3).
% 0.13/0.36 dependent: assign(sos_limit, 5000).
% 0.13/0.36 dependent: assign(max_weight, 60).
% 0.13/0.36 clear(print_given).
% 0.13/0.36
% 0.13/0.36 list(usable).
% 0.13/0.36
% 0.13/0.36 SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=3.
% 0.13/0.36
% 0.13/0.36 This is a Horn set with equality. The strategy will be
% 0.13/0.36 Knuth-Bendix and hyper_res, with positive clauses in
% 0.13/0.36 sos and nonpositive clauses in usable.
% 0.13/0.36
% 0.13/0.36 dependent: set(knuth_bendix).
% 0.13/0.36 dependent: set(para_from).
% 0.13/0.36 dependent: set(para_into).
% 0.13/0.36 dependent: clear(para_from_right).
% 0.13/0.36 dependent: clear(para_into_right).
% 0.13/0.36 dependent: set(para_from_vars).
% 0.13/0.36 dependent: set(eq_units_both_ways).
% 0.13/0.36 dependent: set(dynamic_demod_all).
% 0.13/0.36 dependent: set(dynamic_demod).
% 0.13/0.36 dependent: set(order_eq).
% 0.13/0.36 dependent: set(back_demod).
% 0.13/0.36 dependent: set(lrpo).
% 0.13/0.36 dependent: set(hyper_res).
% 0.13/0.36 dependent: clear(order_hyper).
% 0.13/0.36
% 0.13/0.36 ------------> process usable:
% 0.13/0.36
% 0.13/0.36 ------------> process sos:
% 0.13/0.36 Following clause subsumed by 12 during input processing: 0 [copy,12,flip.1] {-} A=A.
% 0.13/0.36
% 0.13/0.36 ======= end of input processing =======
% 0.13/0.39
% 0.13/0.39 Model 1 (0.00 seconds, 0 Inserts)
% 0.13/0.39
% 0.13/0.39 Stopped by limit on number of solutions
% 0.13/0.39
% 0.13/0.39
% 0.13/0.39 -------------- Softie stats --------------
% 0.13/0.39
% 0.13/0.39 UPDATE_STOP: 300
% 0.13/0.39 SFINDER_TIME_LIMIT: 2
% 0.13/0.39 SHORT_CLAUSE_CUTOFF: 4
% 0.13/0.39 number of clauses in intial UL: 3
% 0.13/0.39 number of clauses initially in problem: 11
% 0.13/0.39 percentage of clauses intially in UL: 27
% 0.13/0.39 percentage of distinct symbols occuring in initial UL: 75
% 0.13/0.39 percent of all initial clauses that are short: 100
% 0.13/0.39 absolute distinct symbol count: 8
% 0.13/0.39 distinct predicate count: 3
% 0.13/0.39 distinct function count: 3
% 0.13/0.39 distinct constant count: 2
% 0.13/0.39
% 0.13/0.39 ---------- no more Softie stats ----------
% 0.13/0.39
% 0.13/0.39
% 0.13/0.39
% 0.13/0.39 Model 2 (0.00 seconds, 0 Inserts)
% 0.13/0.39
% 0.13/0.39 Stopped by limit on number of solutions
% 0.13/0.39
% 0.13/0.39 =========== start of search ===========
% 2.04/2.25
% 2.04/2.25 -------- PROOF --------
% 2.04/2.25 % SZS status Unsatisfiable
% 2.04/2.25 % SZS output start Refutation
% 2.04/2.25
% 2.04/2.25 Model 3 (0.00 seconds, 0 Inserts)
% 2.04/2.25
% 2.04/2.25 Stopped by limit on number of solutions
% 2.04/2.25
% 2.04/2.25 Model 4 (0.00 seconds, 0 Inserts)
% 2.04/2.25
% 2.04/2.25 Stopped by limit on number of solutions
% 2.04/2.25
% 2.04/2.25 Stopped by limit on insertions
% 2.04/2.25
% 2.04/2.25 Model 5 [ 21 1 192 ] (0.00 seconds, 250000 Inserts)
% 2.04/2.25
% 2.04/2.25 Stopped by limit on insertions
% 2.04/2.25
% 2.04/2.25 Model 6 [ 1 6 98208 ] (0.00 seconds, 250000 Inserts)
% 2.04/2.25
% 2.04/2.25 Stopped by limit on insertions
% 2.04/2.25
% 2.04/2.25 Model 7 [ 1 12 181215 ] (0.00 seconds, 250000 Inserts)
% 2.04/2.25
% 2.04/2.25 Stopped by limit on insertions
% 2.04/2.25
% 2.04/2.25 Model 8 [ 2 1 2966 ] (0.00 seconds, 250000 Inserts)
% 2.04/2.25
% 2.04/2.25 Stopped by limit on insertions
% 2.04/2.25
% 2.04/2.25 Model 9 [ 2 2 13181 ] (0.00 seconds, 250000 Inserts)
% 2.04/2.25
% 2.04/2.25 Stopped by limit on insertions
% 2.04/2.25
% 2.04/2.25 Model 10 [ 22 0 878 ] (0.00 seconds, 250000 Inserts)
% 2.04/2.25
% 2.04/2.25 Stopped by limit on insertions
% 2.04/2.25
% 2.04/2.25 Stopped by limit on insertions
% 2.04/2.25
% 2.04/2.25 Model 11 [ 2 1 272 ] (0.00 seconds, 250000 Inserts)
% 2.04/2.25
% 2.04/2.25 ----> UNIT CONFLICT at 1.87 sec ----> 214 [binary,213.1,3.1] {+} $F.
% 2.04/2.25
% 2.04/2.25 Length of proof is 8. Level of proof is 5.
% 2.04/2.25
% 2.04/2.25 ---------------- PROOF ----------------
% 2.04/2.25 % SZS status Unsatisfiable
% 2.04/2.25 % SZS output start Refutation
% 2.04/2.25
% 2.04/2.25 1 [] {+} theorem(A)| -axiom(A).
% 2.04/2.25 2 [] {+} theorem(A)| -theorem(implies(B,A))| -theorem(B).
% 2.04/2.25 3 [] {+} -theorem(or(p,implies(or(p,q),q))).
% 2.04/2.25 4 [] {+} axiom(implies(or(A,A),A)).
% 2.04/2.25 5 [] {+} axiom(implies(A,or(B,A))).
% 2.04/2.25 7 [] {-} axiom(implies(or(A,or(B,C)),or(B,or(A,C)))).
% 2.04/2.25 9 [] {-} implies(A,B)=or(not(A),B).
% 2.04/2.25 11,10 [copy,9,flip.1] {+} or(not(A),B)=implies(A,B).
% 2.04/2.25 13 [hyper,4,1] {+} theorem(implies(or(A,A),A)).
% 2.04/2.25 14 [hyper,5,1] {+} theorem(implies(A,or(B,A))).
% 2.04/2.25 20 [hyper,7,1] {-} theorem(implies(or(A,or(B,C)),or(B,or(A,C)))).
% 2.04/2.25 40 [para_into,20.1.1.1,10.1.1,demod,11] {-} theorem(implies(implies(A,or(B,C)),or(B,implies(A,C)))).
% 2.04/2.25 114 [hyper,40,2,14] {+} theorem(or(A,implies(B,B))).
% 2.04/2.25 129 [hyper,114,2,13] {+} theorem(implies(A,A)).
% 2.04/2.25 213 [hyper,129,2,40] {-} theorem(or(A,implies(or(A,B),B))).
% 2.04/2.25 214 [binary,213.1,3.1] {+} $F.
% 2.04/2.25
% 2.04/2.25 % SZS output end Refutation
% 2.04/2.25 ------------ end of proof -------------
% 2.04/2.25
% 2.04/2.25
% 2.04/2.25 Search stopped by max_proofs option.
% 2.04/2.25
% 2.04/2.25
% 2.04/2.25 Search stopped by max_proofs option.
% 2.04/2.25
% 2.04/2.25 ============ end of search ============
% 2.04/2.25
% 2.04/2.25 ----------- soft-scott stats ----------
% 2.04/2.25
% 2.04/2.25 true clauses given 13 (28.9%)
% 2.04/2.25 false clauses given 32
% 2.04/2.25
% 2.04/2.25 FALSE TRUE
% 2.04/2.25 6 0 2
% 2.04/2.25 8 0 11
% 2.04/2.25 9 0 3
% 2.04/2.25 10 11 23
% 2.04/2.25 11 6 1
% 2.04/2.25 12 13 21
% 2.04/2.25 13 22 0
% 2.04/2.25 14 13 6
% 2.04/2.25 15 12 0
% 2.04/2.25 16 11 2
% 2.04/2.25 17 4 0
% 2.04/2.25 tot: 92 69 (42.9% true)
% 2.04/2.25
% 2.04/2.25
% 2.04/2.25 Model 11 [ 2 1 272 ] (0.00 seconds, 250000 Inserts)
% 2.04/2.25
% 2.04/2.25 That finishes the proof of the theorem.
% 2.04/2.25
% 2.04/2.25 Process 18081 finished Mon Jul 4 10:45:18 2022
%------------------------------------------------------------------------------