TSTP Solution File: SEU139+1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : SEU139+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n024.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:04 EDT 2022
% Result : Theorem 0.12s 0.39s
% Output : Refutation 0.12s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : SEU139+1 : TPTP v8.1.0. Released v3.3.0.
% 0.06/0.12 % Command : sos-script %s
% 0.12/0.33 % Computer : n024.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 : Sun Jun 19 13:42:32 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.12/0.35 ----- Otter 3.2, August 2001 -----
% 0.12/0.35 The process was started by sandbox2 on n024.cluster.edu,
% 0.12/0.35 Sun Jun 19 13:42:32 2022
% 0.12/0.35 The command was "./sos". The process ID is 10827.
% 0.12/0.35
% 0.12/0.35 set(prolog_style_variables).
% 0.12/0.35 set(auto).
% 0.12/0.35 dependent: set(auto1).
% 0.12/0.35 dependent: set(process_input).
% 0.12/0.35 dependent: clear(print_kept).
% 0.12/0.35 dependent: clear(print_new_demod).
% 0.12/0.35 dependent: clear(print_back_demod).
% 0.12/0.35 dependent: clear(print_back_sub).
% 0.12/0.35 dependent: set(control_memory).
% 0.12/0.35 dependent: assign(max_mem, 12000).
% 0.12/0.35 dependent: assign(pick_given_ratio, 4).
% 0.12/0.35 dependent: assign(stats_level, 1).
% 0.12/0.35 dependent: assign(pick_semantic_ratio, 3).
% 0.12/0.35 dependent: assign(sos_limit, 5000).
% 0.12/0.35 dependent: assign(max_weight, 60).
% 0.12/0.35 clear(print_given).
% 0.12/0.35
% 0.12/0.35 formula_list(usable).
% 0.12/0.35
% 0.12/0.35 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=3.
% 0.12/0.35
% 0.12/0.35 This ia a non-Horn set with equality. The strategy will be
% 0.12/0.35 Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.12/0.35 unit deletion, with positive clauses in sos and nonpositive
% 0.12/0.35 clauses in usable.
% 0.12/0.35
% 0.12/0.35 dependent: set(knuth_bendix).
% 0.12/0.35 dependent: set(para_from).
% 0.12/0.35 dependent: set(para_into).
% 0.12/0.35 dependent: clear(para_from_right).
% 0.12/0.35 dependent: clear(para_into_right).
% 0.12/0.35 dependent: set(para_from_vars).
% 0.12/0.35 dependent: set(eq_units_both_ways).
% 0.12/0.35 dependent: set(dynamic_demod_all).
% 0.12/0.35 dependent: set(dynamic_demod).
% 0.12/0.35 dependent: set(order_eq).
% 0.12/0.35 dependent: set(back_demod).
% 0.12/0.35 dependent: set(lrpo).
% 0.12/0.35 dependent: set(hyper_res).
% 0.12/0.35 dependent: set(unit_deletion).
% 0.12/0.35 dependent: set(factor).
% 0.12/0.35
% 0.12/0.35 ------------> process usable:
% 0.12/0.35
% 0.12/0.35 ------------> process sos:
% 0.12/0.35 Following clause subsumed by 13 during input processing: 0 [copy,13,flip.1] {-} A=A.
% 0.12/0.35 13 back subsumes 9.
% 0.12/0.35
% 0.12/0.35 ======= end of input processing =======
% 0.12/0.37
% 0.12/0.37 Model 1 (0.00 seconds, 0 Inserts)
% 0.12/0.37
% 0.12/0.37 Stopped by limit on number of solutions
% 0.12/0.37
% 0.12/0.37
% 0.12/0.37 -------------- Softie stats --------------
% 0.12/0.37
% 0.12/0.37 UPDATE_STOP: 300
% 0.12/0.37 SFINDER_TIME_LIMIT: 2
% 0.12/0.37 SHORT_CLAUSE_CUTOFF: 4
% 0.12/0.37 number of clauses in intial UL: 8
% 0.12/0.37 number of clauses initially in problem: 12
% 0.12/0.37 percentage of clauses intially in UL: 66
% 0.12/0.37 percentage of distinct symbols occuring in initial UL: 60
% 0.12/0.37 percent of all initial clauses that are short: 100
% 0.12/0.37 absolute distinct symbol count: 5
% 0.12/0.37 distinct predicate count: 3
% 0.12/0.37 distinct function count: 0
% 0.12/0.37 distinct constant count: 2
% 0.12/0.37
% 0.12/0.37 ---------- no more Softie stats ----------
% 0.12/0.37
% 0.12/0.37
% 0.12/0.37
% 0.12/0.37 =========== start of search ===========
% 0.12/0.39
% 0.12/0.39 -------- PROOF --------
% 0.12/0.39 % SZS status Theorem
% 0.12/0.39 % SZS output start Refutation
% 0.12/0.39
% 0.12/0.39 Model 2 (0.00 seconds, 0 Inserts)
% 0.12/0.39
% 0.12/0.39 Stopped by limit on number of solutions
% 0.12/0.39
% 0.12/0.39 Model 3 [ 1 0 34 ] (0.00 seconds, 242 Inserts)
% 0.12/0.39
% 0.12/0.39 -----> EMPTY CLAUSE at 0.02 sec ----> 31 [factor,25.1.2,unit_del,8,10,11,14] {-} $F.
% 0.12/0.39
% 0.12/0.39 Length of proof is 3. Level of proof is 2.
% 0.12/0.39
% 0.12/0.39 ---------------- PROOF ----------------
% 0.12/0.39 % SZS status Theorem
% 0.12/0.39 % SZS output start Refutation
% 0.12/0.39
% 0.12/0.39 4 [] {+} A=B| -subset(A,B)| -subset(B,A).
% 0.12/0.39 5 [] {+} -proper_subset(A,B)|subset(A,B).
% 0.12/0.39 7 [] {+} proper_subset(A,B)| -subset(A,B)|A=B.
% 0.12/0.39 8 [] {+} -proper_subset(A,A).
% 0.12/0.39 10 [] {+} subset(A,A).
% 0.12/0.39 11 [] {+} subset($c2,$c1).
% 0.12/0.39 12 [] {+} proper_subset($c1,$c2).
% 0.12/0.39 14 [hyper,12,5] {+} subset($c1,$c2).
% 0.12/0.39 15 [para_into,12.1.1,7.3.1] {-} proper_subset(A,$c2)|proper_subset($c1,A)| -subset($c1,A).
% 0.12/0.39 25 [para_into,15.1.2,4.1.1] {-} proper_subset(A,B)|proper_subset($c1,A)| -subset($c1,A)| -subset($c2,B)| -subset(B,$c2).
% 0.12/0.39 31 [factor,25.1.2,unit_del,8,10,11,14] {-} $F.
% 0.12/0.39
% 0.12/0.39 % SZS output end Refutation
% 0.12/0.39 ------------ end of proof -------------
% 0.12/0.39
% 0.12/0.39
% 0.12/0.39 Search stopped by max_proofs option.
% 0.12/0.39
% 0.12/0.39
% 0.12/0.39 Search stopped by max_proofs option.
% 0.12/0.39
% 0.12/0.39 ============ end of search ============
% 0.12/0.39
% 0.12/0.39 ----------- soft-scott stats ----------
% 0.12/0.39
% 0.12/0.39 true clauses given 1 (25.0%)
% 0.12/0.39 false clauses given 3
% 0.12/0.39
% 0.12/0.39 FALSE TRUE
% 0.12/0.39 3 0 2
% 0.12/0.39 6 0 1
% 0.12/0.39 9 3 4
% 0.12/0.39 tot: 3 7 (70.0% true)
% 0.12/0.39
% 0.12/0.39
% 0.12/0.39 Model 3 [ 1 0 34 ] (0.00 seconds, 242 Inserts)
% 0.12/0.39
% 0.12/0.39 That finishes the proof of the theorem.
% 0.12/0.39
% 0.12/0.39 Process 10827 finished Sun Jun 19 13:42:32 2022
%------------------------------------------------------------------------------