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