TSTP Solution File: SEU126+1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : SEU126+1 : TPTP v8.1.0. Released v3.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 : Tue Jul 19 14:26:57 EDT 2022
% Result : Theorem 0.55s 0.73s
% Output : Refutation 0.55s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.14/0.14 % Problem : SEU126+1 : TPTP v8.1.0. Released v3.3.0.
% 0.14/0.15 % Command : sos-script %s
% 0.16/0.37 % Computer : n015.cluster.edu
% 0.16/0.37 % Model : x86_64 x86_64
% 0.16/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.37 % Memory : 8042.1875MB
% 0.16/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.37 % CPULimit : 300
% 0.16/0.37 % WCLimit : 600
% 0.16/0.37 % DateTime : Sun Jun 19 23:08:45 EDT 2022
% 0.16/0.37 % CPUTime :
% 0.16/0.39 ----- Otter 3.2, August 2001 -----
% 0.16/0.39 The process was started by sandbox2 on n015.cluster.edu,
% 0.16/0.39 Sun Jun 19 23:08:45 2022
% 0.16/0.39 The command was "./sos". The process ID is 6329.
% 0.16/0.39
% 0.16/0.39 set(prolog_style_variables).
% 0.16/0.39 set(auto).
% 0.16/0.39 dependent: set(auto1).
% 0.16/0.39 dependent: set(process_input).
% 0.16/0.39 dependent: clear(print_kept).
% 0.16/0.39 dependent: clear(print_new_demod).
% 0.16/0.39 dependent: clear(print_back_demod).
% 0.16/0.39 dependent: clear(print_back_sub).
% 0.16/0.39 dependent: set(control_memory).
% 0.16/0.39 dependent: assign(max_mem, 12000).
% 0.16/0.39 dependent: assign(pick_given_ratio, 4).
% 0.16/0.39 dependent: assign(stats_level, 1).
% 0.16/0.39 dependent: assign(pick_semantic_ratio, 3).
% 0.16/0.39 dependent: assign(sos_limit, 5000).
% 0.16/0.39 dependent: assign(max_weight, 60).
% 0.16/0.39 clear(print_given).
% 0.16/0.39
% 0.16/0.39 formula_list(usable).
% 0.16/0.39
% 0.16/0.39 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=4.
% 0.16/0.39
% 0.16/0.39 This ia a non-Horn set with equality. The strategy will be
% 0.16/0.39 Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.16/0.39 unit deletion, with positive clauses in sos and nonpositive
% 0.16/0.39 clauses in usable.
% 0.16/0.39
% 0.16/0.39 dependent: set(knuth_bendix).
% 0.16/0.39 dependent: set(para_from).
% 0.16/0.39 dependent: set(para_into).
% 0.16/0.39 dependent: clear(para_from_right).
% 0.16/0.39 dependent: clear(para_into_right).
% 0.16/0.39 dependent: set(para_from_vars).
% 0.16/0.39 dependent: set(eq_units_both_ways).
% 0.16/0.39 dependent: set(dynamic_demod_all).
% 0.16/0.39 dependent: set(dynamic_demod).
% 0.16/0.39 dependent: set(order_eq).
% 0.16/0.39 dependent: set(back_demod).
% 0.16/0.39 dependent: set(lrpo).
% 0.16/0.39 dependent: set(hyper_res).
% 0.16/0.39 dependent: set(unit_deletion).
% 0.16/0.39 dependent: set(factor).
% 0.16/0.39
% 0.16/0.39 ------------> process usable:
% 0.16/0.39
% 0.16/0.39 ------------> process sos:
% 0.16/0.39 Following clause subsumed by 25 during input processing: 0 [copy,25,flip.1] {-} set_union2(A,B)=set_union2(B,A).
% 0.16/0.39 Following clause subsumed by 36 during input processing: 0 [copy,36,flip.1] {-} A=A.
% 0.16/0.39 36 back subsumes 24.
% 0.16/0.39 36 back subsumes 20.
% 0.16/0.39
% 0.16/0.39 ======= end of input processing =======
% 0.16/0.42
% 0.16/0.42 Model 1 (0.00 seconds, 0 Inserts)
% 0.16/0.42
% 0.16/0.42 Stopped by limit on number of solutions
% 0.16/0.42
% 0.16/0.42
% 0.16/0.42 -------------- Softie stats --------------
% 0.16/0.42
% 0.16/0.42 UPDATE_STOP: 300
% 0.16/0.42 SFINDER_TIME_LIMIT: 2
% 0.16/0.42 SHORT_CLAUSE_CUTOFF: 4
% 0.16/0.42 number of clauses in intial UL: 21
% 0.16/0.42 number of clauses initially in problem: 37
% 0.16/0.42 percentage of clauses intially in UL: 56
% 0.16/0.42 percentage of distinct symbols occuring in initial UL: 91
% 0.16/0.42 percent of all initial clauses that are short: 100
% 0.16/0.42 absolute distinct symbol count: 12
% 0.16/0.42 distinct predicate count: 4
% 0.16/0.42 distinct function count: 3
% 0.16/0.42 distinct constant count: 5
% 0.16/0.42
% 0.16/0.42 ---------- no more Softie stats ----------
% 0.16/0.42
% 0.16/0.42
% 0.16/0.42
% 0.16/0.42 =========== start of search ===========
% 0.55/0.73
% 0.55/0.73 -------- PROOF --------
% 0.55/0.73 % SZS status Theorem
% 0.55/0.73 % SZS output start Refutation
% 0.55/0.73
% 0.55/0.73 Model 2 (0.00 seconds, 0 Inserts)
% 0.55/0.73
% 0.55/0.73 Stopped by limit on number of solutions
% 0.55/0.73
% 0.55/0.73 Stopped by limit on insertions
% 0.55/0.73
% 0.55/0.73 Model 3 [ 1 1 353 ] (0.00 seconds, 250000 Inserts)
% 0.55/0.73
% 0.55/0.73 Stopped by limit on insertions
% 0.55/0.73
% 0.55/0.73 Model 4 [ 1 0 570 ] (0.00 seconds, 250000 Inserts)
% 0.55/0.73
% 0.55/0.73 Stopped by limit on insertions
% 0.55/0.73
% 0.55/0.73 ----> UNIT CONFLICT at 0.32 sec ----> 322 [binary,320.1,15.1] {-} $F.
% 0.55/0.73
% 0.55/0.73 Length of proof is 5. Level of proof is 4.
% 0.55/0.73
% 0.55/0.73 ---------------- PROOF ----------------
% 0.55/0.73 % SZS status Theorem
% 0.55/0.73 % SZS output start Refutation
% 0.55/0.73
% 0.55/0.73 9 [] {+} A=set_union2(B,C)| -in($f1(B,C,A),A)| -in($f1(B,C,A),C).
% 0.55/0.73 10 [] {+} -subset(A,B)| -in(C,A)|in(C,B).
% 0.55/0.73 15 [] {+} set_union2($c4,$c3)!=$c3.
% 0.55/0.73 23 [factor,9.2.3,flip.1] {+} set_union2(A,B)=B| -in($f1(A,B,B),B).
% 0.55/0.73 26 [] {-} A=set_union2(B,C)|in($f1(B,C,A),A)|in($f1(B,C,A),B)|in($f1(B,C,A),C).
% 0.55/0.73 33 [] {+} subset($c4,$c3).
% 0.55/0.73 94 [hyper,26,10,33] {-} A=set_union2($c4,B)|in($f1($c4,B,A),A)|in($f1($c4,B,A),B)|in($f1($c4,B,A),$c3).
% 0.55/0.73 124 [factor,94.2.3,flip.1] {-} set_union2($c4,A)=A|in($f1($c4,A,A),A)|in($f1($c4,A,A),$c3).
% 0.55/0.73 164 [factor,124.2.3,unit_del,15] {-} in($f1($c4,$c3,$c3),$c3).
% 0.55/0.73 320 [hyper,164,23] {-} set_union2($c4,$c3)=$c3.
% 0.55/0.73 322 [binary,320.1,15.1] {-} $F.
% 0.55/0.73
% 0.55/0.73 % SZS output end Refutation
% 0.55/0.73 ------------ end of proof -------------
% 0.55/0.73
% 0.55/0.73
% 0.55/0.73 Search stopped by max_proofs option.
% 0.55/0.73
% 0.55/0.73
% 0.55/0.73 Search stopped by max_proofs option.
% 0.55/0.73
% 0.55/0.73 ============ end of search ============
% 0.55/0.73
% 0.55/0.73 ----------- soft-scott stats ----------
% 0.55/0.73
% 0.55/0.73 true clauses given 2 (28.6%)
% 0.55/0.73 false clauses given 5
% 0.55/0.73
% 0.55/0.73 FALSE TRUE
% 0.55/0.73 3 0 3
% 0.55/0.73 5 0 10
% 0.55/0.73 6 1 1
% 0.55/0.73 7 0 3
% 0.55/0.73 8 0 3
% 0.55/0.73 9 4 3
% 0.55/0.73 10 0 1
% 0.55/0.73 11 4 5
% 0.55/0.73 12 0 1
% 0.55/0.73 13 0 1
% 0.55/0.73 14 3 1
% 0.55/0.73 15 4 2
% 0.55/0.73 16 1 7
% 0.55/0.73 17 23 3
% 0.55/0.73 19 4 5
% 0.55/0.73 20 1 0
% 0.55/0.73 21 2 9
% 0.55/0.73 22 11 3
% 0.55/0.73 23 14 0
% 0.55/0.73 24 3 0
% 0.55/0.73 25 19 3
% 0.55/0.73 26 2 2
% 0.55/0.73 27 1 4
% 0.55/0.73 28 3 0
% 0.55/0.73 29 2 3
% 0.55/0.73 30 0 4
% 0.55/0.73 31 17 0
% 0.55/0.73 32 9 2
% 0.55/0.73 33 2 0
% 0.55/0.73 34 5 1
% 0.55/0.73 35 8 4
% 0.55/0.73 37 5 1
% 0.55/0.73 39 3 0
% 0.55/0.73 40 7 5
% 0.55/0.73 41 3 0
% 0.55/0.73 43 6 0
% 0.55/0.73 44 3 0
% 0.55/0.73 46 9 9
% 0.55/0.73 52 9 0
% 0.55/0.73 tot: 188 99 (34.5% true)
% 0.55/0.73
% 0.55/0.73
% 0.55/0.73 Model 4 [ 1 -8 570 ] (0.00 seconds, 250000 Inserts)
% 0.55/0.73
% 0.55/0.73 That finishes the proof of the theorem.
% 0.55/0.73
% 0.55/0.73 Process 6329 finished Sun Jun 19 23:08:45 2022
%------------------------------------------------------------------------------