TSTP Solution File: SET588+3 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : SET588+3 : TPTP v8.1.0. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n005.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 05:19:06 EDT 2022
% Result : Theorem 2.27s 2.51s
% Output : Refutation 2.27s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SET588+3 : TPTP v8.1.0. Released v2.2.0.
% 0.03/0.12 % Command : sos-script %s
% 0.13/0.33 % Computer : n005.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Sat Jul 9 20:59:22 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.13/0.35 ----- Otter 3.2, August 2001 -----
% 0.13/0.35 The process was started by sandbox2 on n005.cluster.edu,
% 0.13/0.35 Sat Jul 9 20:59:22 2022
% 0.13/0.35 The command was "./sos". The process ID is 27821.
% 0.13/0.35
% 0.13/0.35 set(prolog_style_variables).
% 0.13/0.35 set(auto).
% 0.13/0.35 dependent: set(auto1).
% 0.13/0.35 dependent: set(process_input).
% 0.13/0.35 dependent: clear(print_kept).
% 0.13/0.35 dependent: clear(print_new_demod).
% 0.13/0.35 dependent: clear(print_back_demod).
% 0.13/0.35 dependent: clear(print_back_sub).
% 0.13/0.35 dependent: set(control_memory).
% 0.13/0.35 dependent: assign(max_mem, 12000).
% 0.13/0.35 dependent: assign(pick_given_ratio, 4).
% 0.13/0.35 dependent: assign(stats_level, 1).
% 0.13/0.35 dependent: assign(pick_semantic_ratio, 3).
% 0.13/0.35 dependent: assign(sos_limit, 5000).
% 0.13/0.35 dependent: assign(max_weight, 60).
% 0.13/0.35 clear(print_given).
% 0.13/0.35
% 0.13/0.35 formula_list(usable).
% 0.13/0.35
% 0.13/0.35 SCAN INPUT: prop=0, horn=0, equality=0, symmetry=0, max_lits=3.
% 0.13/0.35
% 0.13/0.35 This is a non-Horn set without equality. The strategy
% 0.13/0.35 will be ordered hyper_res, ur_res, unit deletion, and
% 0.13/0.35 factoring, with satellites in sos and nuclei in usable.
% 0.13/0.35
% 0.13/0.35 dependent: set(hyper_res).
% 0.13/0.35 dependent: set(factor).
% 0.13/0.35 dependent: set(unit_deletion).
% 0.13/0.35
% 0.13/0.35 ------------> process usable:
% 0.13/0.35
% 0.13/0.35 ------------> process sos:
% 0.13/0.35
% 0.13/0.35 ======= end of input processing =======
% 0.19/0.38
% 0.19/0.38 Model 1 (0.00 seconds, 0 Inserts)
% 0.19/0.38
% 0.19/0.38 Stopped by limit on number of solutions
% 0.19/0.38
% 0.19/0.38
% 0.19/0.38 -------------- Softie stats --------------
% 0.19/0.38
% 0.19/0.38 UPDATE_STOP: 300
% 0.19/0.38 SFINDER_TIME_LIMIT: 2
% 0.19/0.38 SHORT_CLAUSE_CUTOFF: 4
% 0.19/0.38 number of clauses in intial UL: 6
% 0.19/0.38 number of clauses initially in problem: 9
% 0.19/0.38 percentage of clauses intially in UL: 66
% 0.19/0.38 percentage of distinct symbols occuring in initial UL: 100
% 0.19/0.38 percent of all initial clauses that are short: 100
% 0.19/0.38 absolute distinct symbol count: 7
% 0.19/0.38 distinct predicate count: 2
% 0.19/0.38 distinct function count: 2
% 0.19/0.38 distinct constant count: 3
% 0.19/0.38
% 0.19/0.38 ---------- no more Softie stats ----------
% 0.19/0.38
% 0.19/0.38
% 0.19/0.38
% 0.19/0.38 Model 2 (0.00 seconds, 0 Inserts)
% 0.19/0.38
% 0.19/0.38 Stopped by limit on number of solutions
% 0.19/0.38
% 0.19/0.38 =========== start of search ===========
% 2.27/2.51
% 2.27/2.51 -------- PROOF --------
% 2.27/2.51 % SZS status Theorem
% 2.27/2.51 % SZS output start Refutation
% 2.27/2.51
% 2.27/2.51 Stopped by limit on insertions
% 2.27/2.51
% 2.27/2.51 Model 3 [ 1 0 163 ] (0.00 seconds, 250000 Inserts)
% 2.27/2.51
% 2.27/2.51 Stopped by limit on insertions
% 2.27/2.51
% 2.27/2.51 Model 4 [ 1 1 3970 ] (0.00 seconds, 250000 Inserts)
% 2.27/2.51
% 2.27/2.51 -----> EMPTY CLAUSE at 2.14 sec ----> 751 [hyper,672,2,10] {-} $F.
% 2.27/2.51
% 2.27/2.51 Length of proof is 5. Level of proof is 5.
% 2.27/2.51
% 2.27/2.51 ---------------- PROOF ----------------
% 2.27/2.51 % SZS status Theorem
% 2.27/2.51 % SZS output start Refutation
% 2.27/2.51
% 2.27/2.51 1 [] {+} -member(A,difference(B,C))|member(A,B).
% 2.27/2.51 2 [] {+} -member(A,difference(B,C))| -member(A,C).
% 2.27/2.51 3 [] {+} member(A,difference(B,C))| -member(A,B)|member(A,C).
% 2.27/2.51 4 [] {+} -subset(A,B)| -member(C,A)|member(C,B).
% 2.27/2.51 5 [] {+} subset(A,B)| -member($f1(A,B),B).
% 2.27/2.51 6 [] {+} -subset(difference($c3,$c1),difference($c2,$c1)).
% 2.27/2.51 7 [] {+} subset(A,B)|member($f1(A,B),A).
% 2.27/2.51 9 [] {+} subset($c3,$c2).
% 2.27/2.51 10 [hyper,7,6] {+} member($f1(difference($c3,$c1),difference($c2,$c1)),difference($c3,$c1)).
% 2.27/2.51 13 [hyper,10,1] {+} member($f1(difference($c3,$c1),difference($c2,$c1)),$c3).
% 2.27/2.51 14 [hyper,13,4,9] {-} member($f1(difference($c3,$c1),difference($c2,$c1)),$c2).
% 2.27/2.51 30 [hyper,14,3] {-} member($f1(difference($c3,$c1),difference($c2,$c1)),difference($c2,A))|member($f1(difference($c3,$c1),difference($c2,$c1)),A).
% 2.27/2.51 672 [hyper,30,5,unit_del,6] {-} member($f1(difference($c3,$c1),difference($c2,$c1)),$c1).
% 2.27/2.51 751 [hyper,672,2,10] {-} $F.
% 2.27/2.51
% 2.27/2.51 % SZS output end Refutation
% 2.27/2.51 ------------ end of proof -------------
% 2.27/2.51
% 2.27/2.51
% 2.27/2.51 Search stopped by max_proofs option.
% 2.27/2.51
% 2.27/2.51
% 2.27/2.51 Search stopped by max_proofs option.
% 2.27/2.51
% 2.27/2.51 ============ end of search ============
% 2.27/2.51
% 2.27/2.51 ----------- soft-scott stats ----------
% 2.27/2.51
% 2.27/2.51 true clauses given 28 (36.4%)
% 2.27/2.51 false clauses given 49
% 2.27/2.51
% 2.27/2.51 FALSE TRUE
% 2.27/2.51 10 0 1
% 2.27/2.51 11 6 4
% 2.27/2.51 12 1 11
% 2.27/2.51 13 8 6
% 2.27/2.51 14 40 8
% 2.27/2.51 15 7 8
% 2.27/2.51 16 27 14
% 2.27/2.51 17 43 6
% 2.27/2.51 18 17 14
% 2.27/2.51 19 28 4
% 2.27/2.51 20 13 16
% 2.27/2.51 21 21 6
% 2.27/2.51 22 9 20
% 2.27/2.51 23 3 7
% 2.27/2.51 24 14 16
% 2.27/2.51 25 3 12
% 2.27/2.51 26 7 10
% 2.27/2.51 27 8 23
% 2.27/2.51 28 0 6
% 2.27/2.51 29 3 20
% 2.27/2.51 30 1 4
% 2.27/2.51 31 3 19
% 2.27/2.51 32 0 5
% 2.27/2.51 33 5 19
% 2.27/2.51 34 0 6
% 2.27/2.51 35 1 6
% 2.27/2.51 36 0 10
% 2.27/2.51 38 0 5
% 2.27/2.51 39 0 1
% 2.27/2.51 40 0 4
% 2.27/2.51 42 0 3
% 2.27/2.51 44 0 1
% 2.27/2.51 tot: 268 295 (52.4% true)
% 2.27/2.51
% 2.27/2.51
% 2.27/2.51 Model 4 [ 1 1 3970 ] (0.00 seconds, 250000 Inserts)
% 2.27/2.51
% 2.27/2.51 That finishes the proof of the theorem.
% 2.27/2.51
% 2.27/2.51 Process 27821 finished Sat Jul 9 20:59:24 2022
%------------------------------------------------------------------------------