TSTP Solution File: SEU122+1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : SEU122+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:26:55 EDT 2022
% Result : Theorem 0.18s 0.47s
% Output : Refutation 0.18s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : SEU122+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 04:53:07 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 sandbox2 on n012.cluster.edu,
% 0.12/0.34 Mon Jun 20 04:53:07 2022
% 0.12/0.34 The command was "./sos". The process ID is 10536.
% 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=3.
% 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 15 during input processing: 0 [copy,15,flip.1] {-} A=A.
% 0.12/0.34 15 back subsumes 10.
% 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: 9
% 0.12/0.38 number of clauses initially in problem: 14
% 0.12/0.38 percentage of clauses intially in UL: 64
% 0.12/0.38 percentage of distinct symbols occuring in initial UL: 88
% 0.12/0.38 percent of all initial clauses that are short: 100
% 0.12/0.38 absolute distinct symbol count: 9
% 0.12/0.38 distinct predicate count: 4
% 0.12/0.38 distinct function count: 1
% 0.12/0.38 distinct constant count: 4
% 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.47
% 0.18/0.47 -------- PROOF --------
% 0.18/0.47 % SZS status Theorem
% 0.18/0.47 % SZS output start Refutation
% 0.18/0.47
% 0.18/0.47 Model 3 [ 1 0 155 ] (0.00 seconds, 710 Inserts)
% 0.18/0.47
% 0.18/0.47 Model 4 [ 1 1 168 ] (0.00 seconds, 876 Inserts)
% 0.18/0.47
% 0.18/0.47 Model 5 [ 1 1 128 ] (0.00 seconds, 558 Inserts)
% 0.18/0.47
% 0.18/0.47 Stopped by limit on insertions
% 0.18/0.47
% 0.18/0.47 Model 6 [ 2 0 140 ] (0.00 seconds, 250000 Inserts)
% 0.18/0.47
% 0.18/0.47 -----> EMPTY CLAUSE at 0.11 sec ----> 25 [hyper,22,7,13] {-} $F.
% 0.18/0.47
% 0.18/0.47 Length of proof is 3. Level of proof is 2.
% 0.18/0.47
% 0.18/0.47 ---------------- PROOF ----------------
% 0.18/0.47 % SZS status Theorem
% 0.18/0.47 % SZS output start Refutation
% 0.18/0.47
% 0.18/0.47 5 [] {+} -subset(empty_set,$c3).
% 0.18/0.47 7 [] {+} -in(A,B)| -empty(B).
% 0.18/0.47 8 [] {+} -empty(A)|A=B| -empty(B).
% 0.18/0.47 11 [] {+} subset(A,B)|in($f1(A,B),A).
% 0.18/0.47 12 [] {+} empty(empty_set).
% 0.18/0.47 13 [] {+} empty($c1).
% 0.18/0.47 16 [hyper,11,5] {-} in($f1(empty_set,$c3),empty_set).
% 0.18/0.47 20,19 [hyper,13,8,12] {+} empty_set=$c1.
% 0.18/0.47 22 [back_demod,16,demod,20,20] {+} in($f1($c1,$c3),$c1).
% 0.18/0.47 25 [hyper,22,7,13] {-} $F.
% 0.18/0.47
% 0.18/0.47 % SZS output end Refutation
% 0.18/0.47 ------------ end of proof -------------
% 0.18/0.47
% 0.18/0.47
% 0.18/0.47 Search stopped by max_proofs option.
% 0.18/0.47
% 0.18/0.47
% 0.18/0.47 Search stopped by max_proofs option.
% 0.18/0.47
% 0.18/0.47 ============ end of search ============
% 0.18/0.47
% 0.18/0.47 ----------- soft-scott stats ----------
% 0.18/0.47
% 0.18/0.47 true clauses given 2 (28.6%)
% 0.18/0.47 false clauses given 5
% 0.18/0.47
% 0.18/0.47 FALSE TRUE
% 0.18/0.47 3 0 1
% 0.18/0.47 5 2 1
% 0.18/0.47 10 1 1
% 0.18/0.47 12 1 0
% 0.18/0.47 tot: 4 3 (42.9% true)
% 0.18/0.47
% 0.18/0.47
% 0.18/0.47 Model 6 [ 2 0 140 ] (0.00 seconds, 250000 Inserts)
% 0.18/0.47
% 0.18/0.47 That finishes the proof of the theorem.
% 0.18/0.47
% 0.18/0.47 Process 10536 finished Mon Jun 20 04:53:07 2022
%------------------------------------------------------------------------------