TSTP Solution File: SEU165+3 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : SEU165+3 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n032.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:21 EDT 2022
% Result : Theorem 0.12s 0.40s
% Output : Refutation 0.12s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.09 % Problem : SEU165+3 : TPTP v8.1.0. Released v3.2.0.
% 0.00/0.09 % Command : sos-script %s
% 0.08/0.28 % Computer : n032.cluster.edu
% 0.08/0.28 % Model : x86_64 x86_64
% 0.08/0.28 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.28 % Memory : 8042.1875MB
% 0.08/0.28 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.28 % CPULimit : 300
% 0.12/0.28 % WCLimit : 600
% 0.12/0.28 % DateTime : Mon Jun 20 07:34:48 EDT 2022
% 0.12/0.28 % CPUTime :
% 0.12/0.29 ----- Otter 3.2, August 2001 -----
% 0.12/0.29 The process was started by sandbox on n032.cluster.edu,
% 0.12/0.29 Mon Jun 20 07:34:48 2022
% 0.12/0.29 The command was "./sos". The process ID is 30193.
% 0.12/0.29
% 0.12/0.29 set(prolog_style_variables).
% 0.12/0.29 set(auto).
% 0.12/0.29 dependent: set(auto1).
% 0.12/0.29 dependent: set(process_input).
% 0.12/0.29 dependent: clear(print_kept).
% 0.12/0.29 dependent: clear(print_new_demod).
% 0.12/0.29 dependent: clear(print_back_demod).
% 0.12/0.29 dependent: clear(print_back_sub).
% 0.12/0.29 dependent: set(control_memory).
% 0.12/0.29 dependent: assign(max_mem, 12000).
% 0.12/0.29 dependent: assign(pick_given_ratio, 4).
% 0.12/0.29 dependent: assign(stats_level, 1).
% 0.12/0.29 dependent: assign(pick_semantic_ratio, 3).
% 0.12/0.29 dependent: assign(sos_limit, 5000).
% 0.12/0.29 dependent: assign(max_weight, 60).
% 0.12/0.29 clear(print_given).
% 0.12/0.29
% 0.12/0.29 formula_list(usable).
% 0.12/0.29
% 0.12/0.29 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=3.
% 0.12/0.29
% 0.12/0.29 This ia a non-Horn set with equality. The strategy will be
% 0.12/0.29 Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.12/0.29 unit deletion, with positive clauses in sos and nonpositive
% 0.12/0.29 clauses in usable.
% 0.12/0.29
% 0.12/0.29 dependent: set(knuth_bendix).
% 0.12/0.29 dependent: set(para_from).
% 0.12/0.29 dependent: set(para_into).
% 0.12/0.29 dependent: clear(para_from_right).
% 0.12/0.29 dependent: clear(para_into_right).
% 0.12/0.29 dependent: set(para_from_vars).
% 0.12/0.29 dependent: set(eq_units_both_ways).
% 0.12/0.29 dependent: set(dynamic_demod_all).
% 0.12/0.29 dependent: set(dynamic_demod).
% 0.12/0.29 dependent: set(order_eq).
% 0.12/0.29 dependent: set(back_demod).
% 0.12/0.29 dependent: set(lrpo).
% 0.12/0.29 dependent: set(hyper_res).
% 0.12/0.29 dependent: set(unit_deletion).
% 0.12/0.29 dependent: set(factor).
% 0.12/0.29
% 0.12/0.29 ------------> process usable:
% 0.12/0.29
% 0.12/0.29 ------------> process sos:
% 0.12/0.29 Following clause subsumed by 10 during input processing: 0 [copy,10,flip.1] {-} unordered_pair(A,B)=unordered_pair(B,A).
% 0.12/0.29 Following clause subsumed by 17 during input processing: 0 [copy,17,flip.1] {-} A=A.
% 0.12/0.29
% 0.12/0.29 ======= end of input processing =======
% 0.12/0.33
% 0.12/0.33 Model 1 (0.00 seconds, 0 Inserts)
% 0.12/0.33
% 0.12/0.33 Stopped by limit on number of solutions
% 0.12/0.33
% 0.12/0.33
% 0.12/0.33 -------------- Softie stats --------------
% 0.12/0.33
% 0.12/0.33 UPDATE_STOP: 300
% 0.12/0.33 SFINDER_TIME_LIMIT: 2
% 0.12/0.33 SHORT_CLAUSE_CUTOFF: 4
% 0.12/0.33 number of clauses in intial UL: 9
% 0.12/0.33 number of clauses initially in problem: 16
% 0.12/0.33 percentage of clauses intially in UL: 56
% 0.12/0.33 percentage of distinct symbols occuring in initial UL: 69
% 0.12/0.33 percent of all initial clauses that are short: 100
% 0.12/0.33 absolute distinct symbol count: 13
% 0.12/0.33 distinct predicate count: 3
% 0.12/0.33 distinct function count: 4
% 0.12/0.33 distinct constant count: 6
% 0.12/0.33
% 0.12/0.33 ---------- no more Softie stats ----------
% 0.12/0.33
% 0.12/0.33
% 0.12/0.33
% 0.12/0.33 Model 2 (0.00 seconds, 0 Inserts)
% 0.12/0.33
% 0.12/0.33 Stopped by limit on number of solutions
% 0.12/0.33
% 0.12/0.33 =========== start of search ===========
% 0.12/0.40
% 0.12/0.40 -------- PROOF --------
% 0.12/0.40 % SZS status Theorem
% 0.12/0.40 % SZS output start Refutation
% 0.12/0.40
% 0.12/0.40 Model 3 (0.00 seconds, 0 Inserts)
% 0.12/0.40
% 0.12/0.40 Stopped by limit on number of solutions
% 0.12/0.40
% 0.12/0.40 Model 4 (0.00 seconds, 0 Inserts)
% 0.12/0.40
% 0.12/0.40 Stopped by limit on number of solutions
% 0.12/0.40
% 0.12/0.40 Stopped by limit on insertions
% 0.12/0.40
% 0.12/0.40 Model 5 [ 1 0 139 ] (0.00 seconds, 250000 Inserts)
% 0.12/0.40
% 0.12/0.40 -----> EMPTY CLAUSE at 0.08 sec ----> 49 [hyper,34,4,31,25] {-} $F.
% 0.12/0.40
% 0.12/0.40 Length of proof is 3. Level of proof is 2.
% 0.12/0.40
% 0.12/0.40 ---------------- PROOF ----------------
% 0.12/0.40 % SZS status Theorem
% 0.12/0.40 % SZS output start Refutation
% 0.12/0.40
% 0.12/0.40 4 [] {+} -in(ordered_pair($c6,$c5),cartesian_product2($c4,$c3))| -in($c6,$c4)| -in($c5,$c3).
% 0.12/0.40 5 [] {+} -in(ordered_pair(A,B),cartesian_product2(C,D))|in(A,C).
% 0.12/0.40 6 [] {+} -in(ordered_pair(A,B),cartesian_product2(C,D))|in(B,D).
% 0.12/0.40 7 [] {+} in(ordered_pair(A,B),cartesian_product2(C,D))| -in(A,C)| -in(B,D).
% 0.12/0.40 15 [] {-} in(ordered_pair($c6,$c5),cartesian_product2($c4,$c3))|in($c6,$c4).
% 0.12/0.40 16 [] {-} in(ordered_pair($c6,$c5),cartesian_product2($c4,$c3))|in($c5,$c3).
% 0.12/0.40 25 [hyper,16,6,factor_simp] {+} in($c5,$c3).
% 0.12/0.40 31 [hyper,15,5,factor_simp] {+} in($c6,$c4).
% 0.12/0.40 34 [hyper,15,7,25,factor_simp] {-} in(ordered_pair($c6,$c5),cartesian_product2($c4,$c3)).
% 0.12/0.40 49 [hyper,34,4,31,25] {-} $F.
% 0.12/0.40
% 0.12/0.40 % SZS output end Refutation
% 0.12/0.40 ------------ end of proof -------------
% 0.12/0.40
% 0.12/0.40
% 0.12/0.40 Search stopped by max_proofs option.
% 0.12/0.40
% 0.12/0.40
% 0.12/0.40 Search stopped by max_proofs option.
% 0.12/0.40
% 0.12/0.40 ============ end of search ============
% 0.12/0.40
% 0.12/0.40 ----------- soft-scott stats ----------
% 0.12/0.40
% 0.12/0.40 true clauses given 1 (10.0%)
% 0.12/0.40 false clauses given 9
% 0.12/0.40
% 0.12/0.40 FALSE TRUE
% 0.12/0.40 7 1 1
% 0.12/0.40 10 2 0
% 0.12/0.40 11 4 0
% 0.12/0.40 15 2 0
% 0.12/0.40 tot: 9 1 (10.0% true)
% 0.12/0.40
% 0.12/0.40
% 0.12/0.40 Model 5 [ 1 0 139 ] (0.00 seconds, 250000 Inserts)
% 0.12/0.40
% 0.12/0.40 That finishes the proof of the theorem.
% 0.12/0.40
% 0.12/0.40 Process 30193 finished Mon Jun 20 07:34:48 2022
%------------------------------------------------------------------------------