TSTP Solution File: SEU155+1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : SEU155+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n012.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:27:13 EDT 2022
% Result : Theorem 0.18s 0.43s
% Output : Refutation 0.18s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : SEU155+1 : TPTP v8.1.0. Released v3.3.0.
% 0.06/0.12 % Command : sos-script %s
% 0.12/0.33 % Computer : n012.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 : Mon Jun 20 11:55: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 n012.cluster.edu,
% 0.12/0.34 Mon Jun 20 11:55:52 2022
% 0.12/0.34 The command was "./sos". The process ID is 3886.
% 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 16 during input processing: 0 [copy,16,flip.1] {-} A=A.
% 0.12/0.34
% 0.12/0.34 ======= end of input processing =======
% 0.12/0.38
% 0.12/0.38 Model 1 (0.00 seconds, 0 Inserts)
% 0.12/0.38
% 0.12/0.38 Stopped by limit on number of solutions
% 0.12/0.38
% 0.12/0.38
% 0.12/0.38 -------------- Softie stats --------------
% 0.12/0.38
% 0.12/0.38 UPDATE_STOP: 300
% 0.12/0.38 SFINDER_TIME_LIMIT: 2
% 0.12/0.38 SHORT_CLAUSE_CUTOFF: 4
% 0.12/0.38 number of clauses in intial UL: 10
% 0.12/0.38 number of clauses initially in problem: 16
% 0.12/0.38 percentage of clauses intially in UL: 62
% 0.12/0.38 percentage of distinct symbols occuring in initial UL: 90
% 0.12/0.38 percent of all initial clauses that are short: 100
% 0.12/0.38 absolute distinct symbol count: 10
% 0.12/0.38 distinct predicate count: 3
% 0.12/0.38 distinct function count: 5
% 0.12/0.38 distinct constant count: 2
% 0.12/0.38
% 0.12/0.38 ---------- no more Softie stats ----------
% 0.12/0.38
% 0.12/0.38
% 0.12/0.38
% 0.12/0.38 Model 2 (0.00 seconds, 0 Inserts)
% 0.12/0.38
% 0.12/0.38 Stopped by limit on number of solutions
% 0.12/0.38
% 0.12/0.38 =========== start of search ===========
% 0.18/0.43
% 0.18/0.43 -------- PROOF --------
% 0.18/0.43 % SZS status Theorem
% 0.18/0.43 % SZS output start Refutation
% 0.18/0.43
% 0.18/0.43 Model 3 [ 1 1 1224 ] (0.00 seconds, 3762 Inserts)
% 0.18/0.43
% 0.18/0.43 ----> UNIT CONFLICT at 0.06 sec ----> 302 [binary,301.1,8.1] {-} $F.
% 0.18/0.43
% 0.18/0.43 Length of proof is 3. Level of proof is 3.
% 0.18/0.43
% 0.18/0.43 ---------------- PROOF ----------------
% 0.18/0.43 % SZS status Theorem
% 0.18/0.43 % SZS output start Refutation
% 0.18/0.43
% 0.18/0.43 3 [] {+} subset(A,B)| -in($f1(A,B),B).
% 0.18/0.43 6 [] {+} A!=union(B)|in(C,A)| -in(C,D)| -in(D,B).
% 0.18/0.43 8 [] {+} -subset($c2,union($c1)).
% 0.18/0.43 11 [] {+} subset(A,B)|in($f1(A,B),A).
% 0.18/0.43 14 [] {+} in($c2,$c1).
% 0.18/0.43 16 [] {+} A=A.
% 0.18/0.43 17 [hyper,11,8] {-} in($f1($c2,union($c1)),$c2).
% 0.18/0.43 162 [hyper,16,6,17,14] {-} in($f1($c2,union($c1)),union($c1)).
% 0.18/0.43 301 [hyper,162,3] {-} subset($c2,union($c1)).
% 0.18/0.43 302 [binary,301.1,8.1] {-} $F.
% 0.18/0.43
% 0.18/0.43 % SZS output end Refutation
% 0.18/0.43 ------------ end of proof -------------
% 0.18/0.43
% 0.18/0.43
% 0.18/0.43 Search stopped by max_proofs option.
% 0.18/0.43
% 0.18/0.43
% 0.18/0.43 Search stopped by max_proofs option.
% 0.18/0.43
% 0.18/0.43 ============ end of search ============
% 0.18/0.43
% 0.18/0.43 ----------- soft-scott stats ----------
% 0.18/0.43
% 0.18/0.43 true clauses given 2 (16.7%)
% 0.18/0.43 false clauses given 10
% 0.18/0.43
% 0.18/0.43 FALSE TRUE
% 0.18/0.43 8 0 1
% 0.18/0.43 9 1 1
% 0.18/0.43 12 1 2
% 0.18/0.43 13 1 0
% 0.18/0.43 14 2 1
% 0.18/0.43 15 6 5
% 0.18/0.43 16 5 5
% 0.18/0.43 17 8 7
% 0.18/0.43 18 6 0
% 0.18/0.43 19 14 1
% 0.18/0.43 20 8 9
% 0.18/0.43 21 7 7
% 0.18/0.43 22 9 6
% 0.18/0.43 23 9 2
% 0.18/0.43 24 12 2
% 0.18/0.43 25 6 6
% 0.18/0.43 26 6 3
% 0.18/0.43 27 6 6
% 0.18/0.43 28 4 1
% 0.18/0.43 29 6 5
% 0.18/0.43 30 9 3
% 0.18/0.43 31 5 3
% 0.18/0.43 32 5 5
% 0.18/0.43 33 3 0
% 0.18/0.43 34 3 5
% 0.18/0.43 35 3 3
% 0.18/0.43 36 4 2
% 0.18/0.43 37 1 0
% 0.18/0.43 tot: 150 91 (37.8% true)
% 0.18/0.43
% 0.18/0.43
% 0.18/0.43 Model 3 [ 1 1 1224 ] (0.00 seconds, 3762 Inserts)
% 0.18/0.43
% 0.18/0.43 That finishes the proof of the theorem.
% 0.18/0.43
% 0.18/0.43 Process 3886 finished Mon Jun 20 11:55:52 2022
%------------------------------------------------------------------------------