%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : LCL235-3 : TPTP v8.1.0. Released v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n021.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:58 EDT 2022
% Result : Unsatisfiable 24.16s 24.36s
% Output : Refutation 24.16s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : LCL235-3 : TPTP v8.1.0. Released v2.3.0.
% 0.03/0.13 % Command : sos-script %s
% 0.12/0.34 % Computer : n021.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 : Mon Jul 4 18:30:17 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.19/0.36 ----- Otter 3.2, August 2001 -----
% 0.19/0.36 The process was started by sandbox on n021.cluster.edu,
% 0.19/0.36 Mon Jul 4 18:30:17 2022
% 0.19/0.36 The command was "./sos". The process ID is 4265.
% 0.19/0.36
% 0.19/0.36 set(prolog_style_variables).
% 0.19/0.36 set(auto).
% 0.19/0.36 dependent: set(auto1).
% 0.19/0.36 dependent: set(process_input).
% 0.19/0.36 dependent: clear(print_kept).
% 0.19/0.36 dependent: clear(print_new_demod).
% 0.19/0.36 dependent: clear(print_back_demod).
% 0.19/0.36 dependent: clear(print_back_sub).
% 0.19/0.36 dependent: set(control_memory).
% 0.19/0.36 dependent: assign(max_mem, 12000).
% 0.19/0.36 dependent: assign(pick_given_ratio, 4).
% 0.19/0.36 dependent: assign(stats_level, 1).
% 0.19/0.36 dependent: assign(pick_semantic_ratio, 3).
% 0.19/0.36 dependent: assign(sos_limit, 5000).
% 0.19/0.36 dependent: assign(max_weight, 60).
% 0.19/0.36 clear(print_given).
% 0.19/0.36
% 0.19/0.36 list(usable).
% 0.19/0.36
% 0.19/0.36 SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=3.
% 0.19/0.36
% 0.19/0.36 This is a Horn set with equality. The strategy will be
% 0.19/0.36 Knuth-Bendix and hyper_res, with positive clauses in
% 0.19/0.36 sos and nonpositive clauses in usable.
% 0.19/0.36
% 0.19/0.36 dependent: set(knuth_bendix).
% 0.19/0.36 dependent: set(para_from).
% 0.19/0.36 dependent: set(para_into).
% 0.19/0.36 dependent: clear(para_from_right).
% 0.19/0.36 dependent: clear(para_into_right).
% 0.19/0.36 dependent: set(para_from_vars).
% 0.19/0.36 dependent: set(eq_units_both_ways).
% 0.19/0.36 dependent: set(dynamic_demod_all).
% 0.19/0.36 dependent: set(dynamic_demod).
% 0.19/0.36 dependent: set(order_eq).
% 0.19/0.36 dependent: set(back_demod).
% 0.19/0.36 dependent: set(lrpo).
% 0.19/0.36 dependent: set(hyper_res).
% 0.19/0.36 dependent: clear(order_hyper).
% 0.19/0.36
% 0.19/0.36 ------------> process usable:
% 0.19/0.36
% 0.19/0.36 ------------> process sos:
% 0.19/0.36 Following clause subsumed by 15 during input processing: 0 [copy,15,flip.1] {-} A=A.
% 0.19/0.36
% 0.19/0.36 ======= end of input processing =======
% 0.19/0.39
% 0.19/0.39 Model 1 (0.00 seconds, 0 Inserts)
% 0.19/0.39
% 0.19/0.39 Stopped by limit on number of solutions
% 0.19/0.39
% 0.19/0.39
% 0.19/0.39 -------------- Softie stats --------------
% 0.19/0.39
% 0.19/0.39 UPDATE_STOP: 300
% 0.19/0.39 SFINDER_TIME_LIMIT: 2
% 0.19/0.39 SHORT_CLAUSE_CUTOFF: 4
% 0.19/0.39 number of clauses in intial UL: 2
% 0.19/0.39 number of clauses initially in problem: 13
% 0.19/0.39 percentage of clauses intially in UL: 15
% 0.19/0.39 percentage of distinct symbols occuring in initial UL: 33
% 0.19/0.39 percent of all initial clauses that are short: 100
% 0.19/0.39 absolute distinct symbol count: 9
% 0.19/0.39 distinct predicate count: 3
% 0.19/0.39 distinct function count: 4
% 0.19/0.39 distinct constant count: 2
% 0.19/0.39
% 0.19/0.39 ---------- no more Softie stats ----------
% 0.19/0.39
% 0.19/0.39
% 0.19/0.39
% 0.19/0.39 Model 2 (0.00 seconds, 0 Inserts)
% 0.19/0.39
% 0.19/0.39 Stopped by limit on number of solutions
% 0.19/0.39
% 0.19/0.39 =========== start of search ===========
% 1.05/1.29
% 1.05/1.29
% 1.05/1.29 Changing weight limit from 60 to 32.
% 1.05/1.29
% 1.05/1.29 Model 3 (0.00 seconds, 0 Inserts)
% 1.05/1.29
% 1.05/1.29 Stopped by limit on number of solutions
% 1.05/1.29
% 1.05/1.29 Stopped by limit on insertions
% 1.05/1.29
% 1.05/1.29 Model 4 [ 1 1 542 ] (0.00 seconds, 250000 Inserts)
% 1.05/1.29
% 1.05/1.29 Model 5 (0.00 seconds, 250000 Inserts)
% 1.05/1.29
% 1.05/1.29 Stopped by limit on number of solutions
% 1.05/1.29
% 1.05/1.29 Stopped by limit on insertions
% 1.05/1.29
% 1.05/1.29 Model 6 [ 3 1 3141 ] (0.00 seconds, 250000 Inserts)
% 1.05/1.29
% 1.05/1.29 Stopped by limit on insertions
% 1.05/1.29
% 1.05/1.29 Model 7 [ 30 1 92 ] (0.00 seconds, 250000 Inserts)
% 1.05/1.29
% 1.05/1.29 Stopped by limit on insertions
% 1.05/1.29
% 1.05/1.29 Model 8 [ 2 1 577 ] (0.00 seconds, 250000 Inserts)
% 1.05/1.29
% 1.05/1.29 Stopped by limit on insertions
% 1.05/1.29
% 1.05/1.29 Model 9 [ 3 1 6525 ] (0.00 seconds, 250000 Inserts)
% 1.05/1.29
% 1.05/1.29 Stopped by limit on insertions
% 1.05/1.29
% 1.05/1.29 Model 10 [ 27 0 54 ] (0.00 seconds, 250000 Inserts)
% 1.05/1.29
% 1.05/1.29 Resetting weight limit to 32 after 190 givens.
% 1.05/1.29
% 24.16/24.36
% 24.16/24.36 -- HEY sandbox, WE HAVE A PROOF!! --
% 24.16/24.36
% 24.16/24.36 Modelling stopped after 300 given clauses and 0.00 seconds
% 24.16/24.36
% 24.16/24.36
% 24.16/24.36 ----> UNIT CONFLICT at 23.90 sec ----> 82164 [binary,82163.1,16.1] {+} $F.
% 24.16/24.36
% 24.16/24.36 Length of proof is 28. Level of proof is 12.
% 24.16/24.36
% 24.16/24.36 ---------------- PROOF ----------------
% 24.16/24.36 % SZS status Unsatisfiable
% 24.16/24.36 % SZS output start Refutation
% 24.16/24.36
% 24.16/24.36 1 [] {+} theorem(A)| -axiom(A).
% 24.16/24.36 2 [] {+} theorem(A)| -theorem(implies(B,A))| -theorem(B).
% 24.16/24.36 3 [] {-} -theorem(implies(not(and(p,q)),or(not(p),not(q)))).
% 24.16/24.36 4 [] {+} axiom(implies(or(A,A),A)).
% 24.16/24.36 5 [] {+} axiom(implies(A,or(B,A))).
% 24.16/24.36 6 [] {+} axiom(implies(or(A,B),or(B,A))).
% 24.16/24.36 7 [] {-} axiom(implies(or(A,or(B,C)),or(B,or(A,C)))).
% 24.16/24.36 8 [] {-} axiom(implies(implies(A,B),implies(or(C,A),or(C,B)))).
% 24.16/24.36 9 [] {-} implies(A,B)=or(not(A),B).
% 24.16/24.36 11,10 [copy,9,flip.1] {+} or(not(A),B)=implies(A,B).
% 24.16/24.36 12 [] {-} and(A,B)=not(or(not(A),not(B))).
% 24.16/24.36 13 [copy,12,demod,11,flip.1] {-} not(implies(A,not(B)))=and(A,B).
% 24.16/24.36 16 [back_demod,3,demod,11] {+} -theorem(implies(not(and(p,q)),implies(p,not(q)))).
% 24.16/24.36 17 [hyper,4,1] {+} theorem(implies(or(A,A),A)).
% 24.16/24.36 18 [hyper,5,1] {+} theorem(implies(A,or(B,A))).
% 24.16/24.36 19 [hyper,6,1] {+} theorem(implies(or(A,B),or(B,A))).
% 24.16/24.36 23 [para_from,10.1.1,7.1.1.2.2,demod,11] {-} axiom(implies(implies(A,or(B,C)),or(B,implies(A,C)))).
% 24.16/24.36 25 [para_from,10.1.1,6.1.1.2] {-} axiom(implies(or(A,not(B)),implies(B,A))).
% 24.16/24.36 30 [para_into,17.1.1.1,10.1.1] {+} theorem(implies(implies(A,not(A)),not(A))).
% 24.16/24.36 37 [para_from,13.1.1,10.1.1.1] {-} or(and(A,B),C)=implies(implies(A,not(B)),C).
% 24.16/24.36 38 [copy,37,flip.1] {-} implies(implies(A,not(B)),C)=or(and(A,B),C).
% 24.16/24.36 39 [hyper,8,1] {+} theorem(implies(implies(A,B),implies(or(C,A),or(C,B)))).
% 24.16/24.36 41 [hyper,25,1] {-} theorem(implies(or(A,not(B)),implies(B,A))).
% 24.16/24.36 47 [para_into,41.1.1.1,10.1.1] {-} theorem(implies(implies(A,not(B)),implies(B,not(A)))).
% 24.16/24.36 54 [para_into,19.1.1.1,10.1.1] {+} theorem(implies(implies(A,B),or(B,not(A)))).
% 24.16/24.36 69 [hyper,23,1] {+} theorem(implies(implies(A,or(B,C)),or(B,implies(A,C)))).
% 24.16/24.36 103 [para_from,38.1.1,2.2.1] {-} theorem(A)| -theorem(or(and(B,C),A))| -theorem(implies(B,not(C))).
% 24.16/24.36 1502 [hyper,69,2,18] {+} theorem(or(A,implies(B,B))).
% 24.16/24.36 1651 [hyper,1502,103,30] {+} theorem(implies(A,A)).
% 24.16/24.36 1828 [hyper,1651,2,69] {+} theorem(or(A,implies(or(A,B),B))).
% 24.16/24.36 1829 [hyper,1651,2,54] {+} theorem(or(A,not(A))).
% 24.16/24.36 1830 [hyper,1651,2,47] {+} theorem(implies(A,not(not(A)))).
% 24.16/24.36 2232 [hyper,1830,2,39] {+} theorem(implies(or(A,B),or(A,not(not(B))))).
% 24.16/24.36 5593 [para_into,1828.1.1.2.1,10.1.1,demod,11] {+} theorem(implies(A,implies(implies(A,B),B))).
% 24.16/24.36 10740 [hyper,5593,2,1829] {+} theorem(implies(implies(or(A,not(A)),B),B)).
% 24.16/24.36 81462 [hyper,2232,2,10740] {+} theorem(or(A,not(not(not(A))))).
% 24.16/24.36 81974 [hyper,81462,2,41] {+} theorem(implies(not(not(A)),A)).
% 24.16/24.36 82163 [para_into,81974.1.1.1.1,13.1.1] {-} theorem(implies(not(and(A,B)),implies(A,not(B)))).
% 24.16/24.36 82164 [binary,82163.1,16.1] {+} $F.
% 24.16/24.36
% 24.16/24.36 % SZS output end Refutation
% 24.16/24.36 ------------ end of proof -------------
% 24.16/24.36
% 24.16/24.36
% 24.16/24.36 Search stopped by max_proofs option.
% 24.16/24.36
% 24.16/24.36
% 24.16/24.36 Search stopped by max_proofs option.
% 24.16/24.36
% 24.16/24.36 ============ end of search ============
% 24.16/24.36
% 24.16/24.36 ----------- soft-scott stats ----------
% 24.16/24.36
% 24.16/24.36 true clauses given 641 (39.0%)
% 24.16/24.36 false clauses given 1004
% 24.16/24.36
% 24.16/24.36 FALSE TRUE
% 24.16/24.36 7 0 1
% 24.16/24.36 8 0 4
% 24.16/24.36 9 0 21
% 24.16/24.36 10 0 607
% 24.16/24.36 11 0 1296
% 24.16/24.36 12 0 569
% 24.16/24.36 13 0 1
% 24.16/24.36 14 0 1
% 24.16/24.36 29 79 0
% 24.16/24.36 30 414 0
% 24.16/24.36 31 534 0
% 24.16/24.36 32 622 0
% 24.16/24.36 tot: 1649 2500 (60.3% true)
% 24.16/24.36
% 24.16/24.36
% 24.16/24.36 Model 10 [ 27 0 54 ] (0.00 seconds, 250000 Inserts)
% 24.16/24.36
% 24.16/24.36 That finishes the proof of the theorem.
% 24.16/24.36
% 24.16/24.36 Process 4265 finished Mon Jul 4 18:30:41 2022
%------------------------------------------------------------------------------