%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : SEU263+1 : TPTP v8.1.0. Released v3.3.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 : Tue Jul 19 14:28:15 EDT 2022
% Result : Theorem 0.92s 1.12s
% Output : Refutation 0.92s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SEU263+1 : TPTP v8.1.0. Released v3.3.0.
% 0.03/0.13 % Command : sos-script %s
% 0.14/0.34 % Computer : n018.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 600
% 0.14/0.34 % DateTime : Sun Jun 19 20:39:34 EDT 2022
% 0.14/0.34 % CPUTime :
% 0.14/0.36 ----- Otter 3.2, August 2001 -----
% 0.14/0.36 The process was started by sandbox2 on n018.cluster.edu,
% 0.14/0.36 Sun Jun 19 20:39:34 2022
% 0.14/0.36 The command was "./sos". The process ID is 26958.
% 0.14/0.36
% 0.14/0.36 set(prolog_style_variables).
% 0.14/0.36 set(auto).
% 0.14/0.36 dependent: set(auto1).
% 0.14/0.36 dependent: set(process_input).
% 0.14/0.36 dependent: clear(print_kept).
% 0.14/0.36 dependent: clear(print_new_demod).
% 0.14/0.36 dependent: clear(print_back_demod).
% 0.14/0.36 dependent: clear(print_back_sub).
% 0.14/0.36 dependent: set(control_memory).
% 0.14/0.36 dependent: assign(max_mem, 12000).
% 0.14/0.36 dependent: assign(pick_given_ratio, 4).
% 0.14/0.36 dependent: assign(stats_level, 1).
% 0.14/0.36 dependent: assign(pick_semantic_ratio, 3).
% 0.14/0.36 dependent: assign(sos_limit, 5000).
% 0.14/0.36 dependent: assign(max_weight, 60).
% 0.14/0.36 clear(print_given).
% 0.14/0.36
% 0.14/0.36 formula_list(usable).
% 0.14/0.36
% 0.14/0.36 SCAN INPUT: prop=0, horn=1, equality=0, symmetry=0, max_lits=3.
% 0.14/0.36
% 0.14/0.36 This is a Horn set without equality. The strategy will
% 0.14/0.36 be hyperresolution, with satellites in sos and nuclei
% 0.14/0.36 in usable.
% 0.14/0.36
% 0.14/0.36 dependent: set(hyper_res).
% 0.14/0.36 dependent: clear(order_hyper).
% 0.14/0.36
% 0.14/0.36 ------------> process usable:
% 0.14/0.36
% 0.14/0.36 ------------> process sos:
% 0.14/0.36
% 0.14/0.36 ======= end of input processing =======
% 0.21/0.42
% 0.21/0.42 Model 1 (0.00 seconds, 0 Inserts)
% 0.21/0.42
% 0.21/0.42 Stopped by limit on number of solutions
% 0.21/0.42
% 0.21/0.42
% 0.21/0.42 -------------- Softie stats --------------
% 0.21/0.42
% 0.21/0.42 UPDATE_STOP: 300
% 0.21/0.42 SFINDER_TIME_LIMIT: 2
% 0.21/0.42 SHORT_CLAUSE_CUTOFF: 4
% 0.21/0.42 number of clauses in intial UL: 14
% 0.21/0.42 number of clauses initially in problem: 20
% 0.21/0.42 percentage of clauses intially in UL: 70
% 0.21/0.42 percentage of distinct symbols occuring in initial UL: 75
% 0.21/0.42 percent of all initial clauses that are short: 100
% 0.21/0.42 absolute distinct symbol count: 16
% 0.21/0.42 distinct predicate count: 5
% 0.21/0.42 distinct function count: 7
% 0.21/0.42 distinct constant count: 4
% 0.21/0.42
% 0.21/0.42 ---------- no more Softie stats ----------
% 0.21/0.42
% 0.21/0.42
% 0.21/0.42
% 0.21/0.42 Model 2 (0.00 seconds, 0 Inserts)
% 0.21/0.42
% 0.21/0.42 Stopped by limit on number of solutions
% 0.21/0.42
% 0.21/0.42 =========== start of search ===========
% 0.92/1.11
% 0.92/1.11
% 0.92/1.11 Changing weight limit from 60 to 29.
% 0.92/1.11
% 0.92/1.11 Model 3 (0.00 seconds, 0 Inserts)
% 0.92/1.11
% 0.92/1.11 Stopped by limit on number of solutions
% 0.92/1.11
% 0.92/1.11 Stopped by limit on insertions
% 0.92/1.11
% 0.92/1.11 Model 4 [ 1 1 367 ] (0.00 seconds, 250000 Inserts)
% 0.92/1.11
% 0.92/1.11 Model 5 (0.00 seconds, 250000 Inserts)
% 0.92/1.11
% 0.92/1.11 Stopped by limit on number of solutions
% 0.92/1.11
% 0.92/1.11 Stopped by limit on insertions
% 0.92/1.11
% 0.92/1.11 Model 6 [ 9 1 5321 ] (0.00 seconds, 250000 Inserts)
% 0.92/1.11
% 0.92/1.11 Stopped by limit on insertions
% 0.92/1.11
% 0.92/1.11 Model 7 [ 3 1 1290 ] (0.00 seconds, 250000 Inserts)
% 0.92/1.11
% 0.92/1.11 Stopped by limit on insertions
% 0.92/1.11
% 0.92/1.11 Model 8 [ 1 0 1632 ] (0.00 seconds, 250000 Inserts)
% 0.92/1.11
% 0.92/1.11 Resetting weight limit to 29 after 110 givens.
% 0.92/1.11
% 0.92/1.12
% 0.92/1.12 -------- PROOF --------
% 0.92/1.12 % SZS status Theorem
% 0.92/1.12 % SZS output start Refutation
% 0.92/1.12
% 0.92/1.12 ----> UNIT CONFLICT at 0.74 sec ----> 4006 [binary,4005.1,10.1] {-} $F.
% 0.92/1.12
% 0.92/1.12 Length of proof is 8. Level of proof is 6.
% 0.92/1.12
% 0.92/1.12 ---------------- PROOF ----------------
% 0.92/1.12 % SZS status Theorem
% 0.92/1.12 % SZS output start Refutation
% 0.92/1.12
% 0.92/1.12 1 [] {+} -element(A,powerset(cartesian_product2(B,C)))|relation(A).
% 0.92/1.12 3 [] {+} relation_of2(A,B,C)| -subset(A,cartesian_product2(B,C)).
% 0.92/1.12 4 [] {+} -relation_of2_as_subset(A,B,C)|element(A,powerset(cartesian_product2(B,C))).
% 0.92/1.12 6 [] {+} relation_of2_as_subset(A,B,C)| -relation_of2(A,B,C).
% 0.92/1.12 7 [] {+} -subset(A,B)| -subset(C,D)|subset(cartesian_product2(A,C),cartesian_product2(B,D)).
% 0.92/1.12 8 [] {+} -relation_of2_as_subset(A,B,C)|subset(relation_dom(A),B).
% 0.92/1.12 10 [] {+} -relation_of2_as_subset($c1,$c2,$c3).
% 0.92/1.12 11 [] {+} -subset(A,B)| -subset(B,C)|subset(A,C).
% 0.92/1.12 12 [] {+} -relation(A)|subset(A,cartesian_product2(relation_dom(A),relation_rng(A))).
% 0.92/1.12 19 [] {+} relation_of2_as_subset($c1,$c2,$c4).
% 0.92/1.12 20 [] {+} subset(relation_rng($c1),$c3).
% 0.92/1.12 28 [hyper,19,8] {+} subset(relation_dom($c1),$c2).
% 0.92/1.12 30 [hyper,19,4] {+} element($c1,powerset(cartesian_product2($c2,$c4))).
% 0.92/1.12 67 [hyper,28,7,20] {-} subset(cartesian_product2(relation_dom($c1),relation_rng($c1)),cartesian_product2($c2,$c3)).
% 0.92/1.12 221 [hyper,30,1] {+} relation($c1).
% 0.92/1.12 222 [hyper,221,12] {+} subset($c1,cartesian_product2(relation_dom($c1),relation_rng($c1))).
% 0.92/1.12 3643 [hyper,222,11,67] {-} subset($c1,cartesian_product2($c2,$c3)).
% 0.92/1.12 3880 [hyper,3643,3] {-} relation_of2($c1,$c2,$c3).
% 0.92/1.12 4005 [hyper,3880,6] {-} relation_of2_as_subset($c1,$c2,$c3).
% 0.92/1.12 4006 [binary,4005.1,10.1] {-} $F.
% 0.92/1.12
% 0.92/1.12 % SZS output end Refutation
% 0.92/1.12 ------------ end of proof -------------
% 0.92/1.12
% 0.92/1.12
% 0.92/1.13 Search stopped by max_proofs option.
% 0.92/1.13
% 0.92/1.13
% 0.92/1.13 Search stopped by max_proofs option.
% 0.92/1.13
% 0.92/1.13 ============ end of search ============
% 0.92/1.13
% 0.92/1.13 ----------- soft-scott stats ----------
% 0.92/1.13
% 0.92/1.13 true clauses given 39 (34.8%)
% 0.92/1.13 false clauses given 73
% 0.92/1.13
% 0.92/1.13 FALSE TRUE
% 0.92/1.13 6 2 2
% 0.92/1.13 7 0 30
% 0.92/1.13 8 4 36
% 0.92/1.13 9 2 83
% 0.92/1.13 10 5 79
% 0.92/1.13 11 28 99
% 0.92/1.13 12 34 136
% 0.92/1.13 13 65 188
% 0.92/1.13 14 74 185
% 0.92/1.13 15 70 200
% 0.92/1.13 16 101 210
% 0.92/1.13 17 116 272
% 0.92/1.13 18 125 242
% 0.92/1.13 19 106 182
% 0.92/1.13 20 87 211
% 0.92/1.13 21 65 237
% 0.92/1.13 22 114 116
% 0.92/1.13 23 57 60
% 0.92/1.13 24 26 26
% 0.92/1.13 25 16 0
% 0.92/1.13 26 4 1
% 0.92/1.13 27 3 4
% 0.92/1.13 28 2 0
% 0.92/1.13 29 7 0
% 0.92/1.13 tot: 1113 2599 (70.0% true)
% 0.92/1.13
% 0.92/1.13
% 0.92/1.13 Model 8 [ 1 -21 1632 ] (0.00 seconds, 250000 Inserts)
% 0.92/1.13
% 0.92/1.13 That finishes the proof of the theorem.
% 0.92/1.13
% 0.92/1.13 Process 26958 finished Sun Jun 19 20:39:35 2022
%------------------------------------------------------------------------------