%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : LCL170-3 : TPTP v8.1.0. Released v2.3.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:18 EDT 2022
% Result : Unsatisfiable 0.45s 0.65s
% Output : Refutation 0.45s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : LCL170-3 : TPTP v8.1.0. Released v2.3.0.
% 0.06/0.12 % Command : sos-script %s
% 0.12/0.33 % Computer : n009.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 19:43:52 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 Sun Jul 3 19:43:52 2022
% 0.12/0.34 The command was "./sos". The process ID is 6479.
% 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=1, symmetry=0, max_lits=3.
% 0.12/0.34
% 0.12/0.34 This is a Horn set with equality. The strategy will be
% 0.12/0.34 Knuth-Bendix and hyper_res, with positive clauses in
% 0.12/0.34 sos and nonpositive clauses in usable.
% 0.12/0.34
% 0.12/0.34 dependent: set(knuth_bendix).
% 0.12/0.34 dependent: set(para_from).
% 0.12/0.34 dependent: set(para_into).
% 0.12/0.34 dependent: clear(para_from_right).
% 0.12/0.34 dependent: clear(para_into_right).
% 0.12/0.34 dependent: set(para_from_vars).
% 0.12/0.34 dependent: set(eq_units_both_ways).
% 0.12/0.34 dependent: set(dynamic_demod_all).
% 0.12/0.34 dependent: set(dynamic_demod).
% 0.12/0.34 dependent: set(order_eq).
% 0.12/0.34 dependent: set(back_demod).
% 0.12/0.34 dependent: set(lrpo).
% 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 Following clause subsumed by 12 during input processing: 0 [copy,12,flip.1] {-} A=A.
% 0.12/0.34
% 0.12/0.34 ======= end of input processing =======
% 0.12/0.37
% 0.12/0.37 Model 1 (0.00 seconds, 0 Inserts)
% 0.12/0.37
% 0.12/0.37 Stopped by limit on number of solutions
% 0.12/0.37
% 0.12/0.37
% 0.12/0.37 -------------- Softie stats --------------
% 0.12/0.37
% 0.12/0.37 UPDATE_STOP: 300
% 0.12/0.37 SFINDER_TIME_LIMIT: 2
% 0.12/0.37 SHORT_CLAUSE_CUTOFF: 4
% 0.12/0.37 number of clauses in intial UL: 3
% 0.12/0.37 number of clauses initially in problem: 11
% 0.12/0.37 percentage of clauses intially in UL: 27
% 0.12/0.37 percentage of distinct symbols occuring in initial UL: 62
% 0.12/0.37 percent of all initial clauses that are short: 100
% 0.12/0.37 absolute distinct symbol count: 8
% 0.12/0.37 distinct predicate count: 3
% 0.12/0.37 distinct function count: 3
% 0.12/0.37 distinct constant count: 2
% 0.12/0.37
% 0.12/0.37 ---------- no more Softie stats ----------
% 0.12/0.37
% 0.12/0.37
% 0.12/0.37
% 0.12/0.37 Model 2 (0.00 seconds, 0 Inserts)
% 0.12/0.37
% 0.12/0.37 Stopped by limit on number of solutions
% 0.12/0.37
% 0.12/0.37 =========== start of search ===========
% 0.45/0.65
% 0.45/0.65 -------- PROOF --------
% 0.45/0.65 % SZS status Unsatisfiable
% 0.45/0.65 % SZS output start Refutation
% 0.45/0.65
% 0.45/0.65 Model 3 (0.00 seconds, 0 Inserts)
% 0.45/0.65
% 0.45/0.65 Stopped by limit on number of solutions
% 0.45/0.65
% 0.45/0.65 Model 4 (0.00 seconds, 0 Inserts)
% 0.45/0.65
% 0.45/0.65 Stopped by limit on number of solutions
% 0.45/0.65
% 0.45/0.65 Stopped by limit on insertions
% 0.45/0.65
% 0.45/0.65 Model 5 [ 21 0 130 ] (0.00 seconds, 250000 Inserts)
% 0.45/0.65
% 0.45/0.65 Stopped by limit on insertions
% 0.45/0.65
% 0.45/0.65 Model 6 [ 1 1 4430 ] (0.00 seconds, 250000 Inserts)
% 0.45/0.65
% 0.45/0.65 ----> UNIT CONFLICT at 0.28 sec ----> 25 [binary,24.1,3.1] {+} $F.
% 0.45/0.65
% 0.45/0.65 Length of proof is 3. Level of proof is 3.
% 0.45/0.65
% 0.45/0.65 ---------------- PROOF ----------------
% 0.45/0.65 % SZS status Unsatisfiable
% 0.45/0.65 % SZS output start Refutation
% 0.45/0.65
% 0.45/0.65 1 [] {+} theorem(A)| -axiom(A).
% 0.45/0.65 3 [] {+} -theorem(implies(q,implies(p,q))).
% 0.45/0.65 5 [] {+} axiom(implies(A,or(B,A))).
% 0.45/0.65 9 [] {-} implies(A,B)=or(not(A),B).
% 0.45/0.65 10 [copy,9,flip.1] {+} or(not(A),B)=implies(A,B).
% 0.45/0.65 18 [para_from,10.1.1,5.1.1.2] {-} axiom(implies(A,implies(B,A))).
% 0.45/0.65 24 [hyper,18,1] {-} theorem(implies(A,implies(B,A))).
% 0.45/0.65 25 [binary,24.1,3.1] {+} $F.
% 0.45/0.65
% 0.45/0.65 % SZS output end Refutation
% 0.45/0.65 ------------ end of proof -------------
% 0.45/0.65
% 0.45/0.65
% 0.45/0.65 Search stopped by max_proofs option.
% 0.45/0.65
% 0.45/0.65
% 0.45/0.65 Search stopped by max_proofs option.
% 0.45/0.65
% 0.45/0.65 ============ end of search ============
% 0.45/0.65
% 0.45/0.65 ----------- soft-scott stats ----------
% 0.45/0.65
% 0.45/0.65 true clauses given 1 (12.5%)
% 0.45/0.65 false clauses given 7
% 0.45/0.65
% 0.45/0.65 FALSE TRUE
% 0.45/0.65 6 0 1
% 0.45/0.65 8 0 3
% 0.45/0.65 9 1 1
% 0.45/0.65 12 1 3
% 0.45/0.65 tot: 2 8 (80.0% true)
% 0.45/0.65
% 0.45/0.65
% 0.45/0.65 Model 6 [ 1 -17 4430 ] (0.00 seconds, 250000 Inserts)
% 0.45/0.65
% 0.45/0.65 That finishes the proof of the theorem.
% 0.45/0.65
% 0.45/0.65 Process 6479 finished Sun Jul 3 19:43:52 2022
%------------------------------------------------------------------------------