%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : SEU127+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n029.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:26:58 EDT 2022
% Result : Theorem 0.18s 0.51s
% Output : Refutation 0.18s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SEU127+1 : TPTP v8.1.0. Released v3.3.0.
% 0.03/0.12 % Command : sos-script %s
% 0.12/0.32 % Computer : n029.cluster.edu
% 0.12/0.32 % Model : x86_64 x86_64
% 0.12/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.32 % Memory : 8042.1875MB
% 0.12/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.32 % CPULimit : 300
% 0.12/0.32 % WCLimit : 600
% 0.12/0.32 % DateTime : Sun Jun 19 10:29:14 EDT 2022
% 0.12/0.32 % CPUTime :
% 0.12/0.34 ----- Otter 3.2, August 2001 -----
% 0.12/0.34 The process was started by sandbox on n029.cluster.edu,
% 0.12/0.34 Sun Jun 19 10:29:14 2022
% 0.12/0.34 The command was "./sos". The process ID is 23917.
% 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 formula_list(usable).
% 0.12/0.34
% 0.12/0.34 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=4.
% 0.12/0.34
% 0.12/0.34 This ia a non-Horn set with equality. The strategy will be
% 0.12/0.34 Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.12/0.34 unit deletion, with positive clauses in sos and nonpositive
% 0.12/0.34 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: set(unit_deletion).
% 0.12/0.34 dependent: set(factor).
% 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 20 during input processing: 0 [copy,20,flip.1] {-} set_intersection2(A,B)=set_intersection2(B,A).
% 0.12/0.34 Following clause subsumed by 31 during input processing: 0 [copy,31,flip.1] {-} A=A.
% 0.12/0.34 31 back subsumes 18.
% 0.12/0.34
% 0.12/0.34 ======= end of input processing =======
% 0.18/0.36
% 0.18/0.36 Model 1 (0.00 seconds, 0 Inserts)
% 0.18/0.36
% 0.18/0.36 Stopped by limit on number of solutions
% 0.18/0.36
% 0.18/0.36
% 0.18/0.36 -------------- Softie stats --------------
% 0.18/0.36
% 0.18/0.36 UPDATE_STOP: 300
% 0.18/0.36 SFINDER_TIME_LIMIT: 2
% 0.18/0.36 SHORT_CLAUSE_CUTOFF: 4
% 0.18/0.36 number of clauses in intial UL: 15
% 0.18/0.36 number of clauses initially in problem: 31
% 0.18/0.36 percentage of clauses intially in UL: 48
% 0.18/0.36 percentage of distinct symbols occuring in initial UL: 91
% 0.18/0.36 percent of all initial clauses that are short: 100
% 0.18/0.36 absolute distinct symbol count: 12
% 0.18/0.36 distinct predicate count: 4
% 0.18/0.36 distinct function count: 3
% 0.18/0.36 distinct constant count: 5
% 0.18/0.36
% 0.18/0.36 ---------- no more Softie stats ----------
% 0.18/0.36
% 0.18/0.36
% 0.18/0.36
% 0.18/0.36 =========== start of search ===========
% 0.18/0.51
% 0.18/0.51 -------- PROOF --------
% 0.18/0.51 % SZS status Theorem
% 0.18/0.51 % SZS output start Refutation
% 0.18/0.51
% 0.18/0.51 Model 2 (0.00 seconds, 0 Inserts)
% 0.18/0.51
% 0.18/0.51 Stopped by limit on number of solutions
% 0.18/0.51
% 0.18/0.51 Model 3 (0.00 seconds, 0 Inserts)
% 0.18/0.51
% 0.18/0.51 Stopped by limit on number of solutions
% 0.18/0.51
% 0.18/0.51 Model 4 (0.00 seconds, 0 Inserts)
% 0.18/0.51
% 0.18/0.51 Stopped by limit on number of solutions
% 0.18/0.51
% 0.18/0.51 Model 5 [ 1 1 340 ] (0.00 seconds, 107308 Inserts)
% 0.18/0.51
% 0.18/0.51 ----> UNIT CONFLICT at 0.15 sec ----> 305 [binary,304.1,9.1] {-} $F.
% 0.18/0.51
% 0.18/0.51 Length of proof is 3. Level of proof is 3.
% 0.18/0.51
% 0.18/0.51 ---------------- PROOF ----------------
% 0.18/0.51 % SZS status Theorem
% 0.18/0.51 % SZS output start Refutation
% 0.18/0.51
% 0.18/0.51 3 [] {+} subset(A,B)| -in($f1(A,B),B).
% 0.18/0.51 5 [] {+} A!=set_intersection2(B,C)| -in(D,A)|in(D,C).
% 0.18/0.51 9 [] {+} -subset(set_intersection2($c4,$c3),$c4).
% 0.18/0.51 20 [] {+} set_intersection2(A,B)=set_intersection2(B,A).
% 0.18/0.51 21 [] {-} subset(A,B)|in($f1(A,B),A).
% 0.18/0.51 57 [hyper,21,9] {-} in($f1(set_intersection2($c4,$c3),$c4),set_intersection2($c4,$c3)).
% 0.18/0.51 85 [hyper,57,5,20] {-} in($f1(set_intersection2($c4,$c3),$c4),$c4).
% 0.18/0.51 304 [hyper,85,3] {-} subset(set_intersection2($c4,$c3),$c4).
% 0.18/0.51 305 [binary,304.1,9.1] {-} $F.
% 0.18/0.51
% 0.18/0.51 % SZS output end Refutation
% 0.18/0.51 ------------ end of proof -------------
% 0.18/0.51
% 0.18/0.51
% 0.18/0.51 Search stopped by max_proofs option.
% 0.18/0.51
% 0.18/0.51
% 0.18/0.51 Search stopped by max_proofs option.
% 0.18/0.51
% 0.18/0.51 ============ end of search ============
% 0.18/0.51
% 0.18/0.51 ----------- soft-scott stats ----------
% 0.18/0.51
% 0.18/0.51 true clauses given 4 (28.6%)
% 0.18/0.51 false clauses given 10
% 0.18/0.51
% 0.18/0.51 FALSE TRUE
% 0.18/0.51 5 0 5
% 0.18/0.51 7 1 3
% 0.18/0.51 9 5 6
% 0.18/0.51 10 1 0
% 0.18/0.51 11 8 8
% 0.18/0.51 12 0 3
% 0.18/0.51 13 4 10
% 0.18/0.51 14 0 2
% 0.18/0.51 15 9 5
% 0.18/0.51 16 5 2
% 0.18/0.51 17 6 9
% 0.18/0.51 19 3 22
% 0.18/0.51 21 8 14
% 0.18/0.51 22 4 2
% 0.18/0.51 23 14 15
% 0.18/0.51 24 1 0
% 0.18/0.51 25 2 7
% 0.18/0.51 26 2 0
% 0.18/0.51 27 5 5
% 0.18/0.51 29 2 8
% 0.18/0.51 31 1 7
% 0.18/0.51 32 3 0
% 0.18/0.51 33 0 10
% 0.18/0.51 34 3 4
% 0.18/0.51 35 1 8
% 0.18/0.51 37 3 3
% 0.18/0.51 39 0 1
% 0.18/0.51 40 1 2
% 0.18/0.51 41 0 3
% 0.18/0.51 43 2 3
% 0.18/0.51 46 0 6
% 0.18/0.51 tot: 94 173 (64.8% true)
% 0.18/0.51
% 0.18/0.51
% 0.18/0.51 Model 5 [ 1 1 340 ] (0.00 seconds, 107308 Inserts)
% 0.18/0.51
% 0.18/0.51 That finishes the proof of the theorem.
% 0.18/0.51
% 0.18/0.51 Process 23917 finished Sun Jun 19 10:29:15 2022
%------------------------------------------------------------------------------