TSTP Solution File: SET573+3 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : SET573+3 : TPTP v8.1.0. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n003.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:18:57 EDT 2022
% Result : Theorem 0.46s 0.67s
% Output : Refutation 0.46s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SET573+3 : TPTP v8.1.0. Released v2.2.0.
% 0.07/0.13 % Command : sos-script %s
% 0.13/0.34 % Computer : n003.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Sun Jul 10 05:57:44 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.13/0.36 ----- Otter 3.2, August 2001 -----
% 0.13/0.36 The process was started by sandbox on n003.cluster.edu,
% 0.13/0.36 Sun Jul 10 05:57:44 2022
% 0.13/0.36 The command was "./sos". The process ID is 27655.
% 0.13/0.36
% 0.13/0.36 set(prolog_style_variables).
% 0.13/0.36 set(auto).
% 0.13/0.36 dependent: set(auto1).
% 0.13/0.36 dependent: set(process_input).
% 0.13/0.36 dependent: clear(print_kept).
% 0.13/0.36 dependent: clear(print_new_demod).
% 0.13/0.36 dependent: clear(print_back_demod).
% 0.13/0.36 dependent: clear(print_back_sub).
% 0.13/0.36 dependent: set(control_memory).
% 0.13/0.36 dependent: assign(max_mem, 12000).
% 0.13/0.36 dependent: assign(pick_given_ratio, 4).
% 0.13/0.36 dependent: assign(stats_level, 1).
% 0.13/0.36 dependent: assign(pick_semantic_ratio, 3).
% 0.13/0.36 dependent: assign(sos_limit, 5000).
% 0.13/0.36 dependent: assign(max_weight, 60).
% 0.13/0.36 clear(print_given).
% 0.13/0.36
% 0.13/0.36 formula_list(usable).
% 0.13/0.36
% 0.13/0.36 SCAN INPUT: prop=0, horn=0, equality=0, symmetry=0, max_lits=3.
% 0.13/0.36
% 0.13/0.36 This is a non-Horn set without equality. The strategy
% 0.13/0.36 will be ordered hyper_res, ur_res, unit deletion, and
% 0.13/0.36 factoring, with satellites in sos and nuclei in usable.
% 0.13/0.36
% 0.13/0.36 dependent: set(hyper_res).
% 0.13/0.36 dependent: set(factor).
% 0.13/0.36 dependent: set(unit_deletion).
% 0.13/0.36
% 0.13/0.36 ------------> process usable:
% 0.13/0.36
% 0.13/0.36 ------------> process sos:
% 0.13/0.36
% 0.13/0.36 ======= end of input processing =======
% 0.13/0.39
% 0.13/0.39 Model 1 (0.00 seconds, 0 Inserts)
% 0.13/0.39
% 0.13/0.39 Stopped by limit on number of solutions
% 0.13/0.39
% 0.13/0.39
% 0.13/0.39 -------------- Softie stats --------------
% 0.13/0.39
% 0.13/0.39 UPDATE_STOP: 300
% 0.13/0.39 SFINDER_TIME_LIMIT: 2
% 0.13/0.39 SHORT_CLAUSE_CUTOFF: 4
% 0.13/0.39 number of clauses in intial UL: 6
% 0.13/0.39 number of clauses initially in problem: 10
% 0.13/0.39 percentage of clauses intially in UL: 60
% 0.13/0.39 percentage of distinct symbols occuring in initial UL: 57
% 0.13/0.39 percent of all initial clauses that are short: 100
% 0.13/0.39 absolute distinct symbol count: 7
% 0.13/0.39 distinct predicate count: 3
% 0.13/0.39 distinct function count: 1
% 0.13/0.39 distinct constant count: 3
% 0.13/0.39
% 0.13/0.39 ---------- no more Softie stats ----------
% 0.13/0.39
% 0.13/0.39
% 0.13/0.39
% 0.13/0.39 =========== start of search ===========
% 0.46/0.67
% 0.46/0.67 -------- PROOF --------
% 0.46/0.67 % SZS status Theorem
% 0.46/0.67 % SZS output start Refutation
% 0.46/0.67
% 0.46/0.67 Model 2 (0.00 seconds, 0 Inserts)
% 0.46/0.67
% 0.46/0.67 Stopped by limit on number of solutions
% 0.46/0.67
% 0.46/0.67 Model 3 (0.00 seconds, 0 Inserts)
% 0.46/0.67
% 0.46/0.67 Stopped by limit on number of solutions
% 0.46/0.67
% 0.46/0.67 Stopped by limit on insertions
% 0.46/0.67
% 0.46/0.67 Model 4 [ 1 0 53 ] (0.00 seconds, 250000 Inserts)
% 0.46/0.67
% 0.46/0.67 Stopped by limit on insertions
% 0.46/0.67
% 0.46/0.67 Model 5 [ 1 0 78 ] (0.00 seconds, 250000 Inserts)
% 0.46/0.67
% 0.46/0.67 Stopped by limit on insertions
% 0.46/0.67
% 0.46/0.67 Model 6 [ 1 0 47 ] (0.00 seconds, 250000 Inserts)
% 0.46/0.67
% 0.46/0.67 Stopped by limit on insertions
% 0.46/0.67
% 0.46/0.67 Model 7 [ 2 1 46 ] (0.00 seconds, 250000 Inserts)
% 0.46/0.67
% 0.46/0.67 -----> EMPTY CLAUSE at 0.27 sec ----> 22 [hyper,16,4,19] {-} $F.
% 0.46/0.67
% 0.46/0.67 Length of proof is 3. Level of proof is 2.
% 0.46/0.67
% 0.46/0.67 ---------------- PROOF ----------------
% 0.46/0.67 % SZS status Theorem
% 0.46/0.67 % SZS output start Refutation
% 0.46/0.67
% 0.46/0.67 3 [] {+} intersect(A,B)| -member(C,A)| -member(C,B).
% 0.46/0.67 4 [] {+} -disjoint(A,B)| -intersect(A,B).
% 0.46/0.67 5 [] {+} -intersect(A,B)|intersect(B,A).
% 0.46/0.67 7 [] {+} disjoint(A,B)|intersect(A,B).
% 0.46/0.67 8 [] {+} member($c3,$c2).
% 0.46/0.67 9 [] {+} disjoint($c2,$c1).
% 0.46/0.67 10 [] {+} member($c3,$c1).
% 0.46/0.67 11 [hyper,7,5] {+} disjoint(A,B)|intersect(B,A).
% 0.46/0.67 16 [hyper,8,3,10] {+} intersect($c1,$c2).
% 0.46/0.67 19 [hyper,11,4,9] {+} disjoint($c1,$c2).
% 0.46/0.67 22 [hyper,16,4,19] {-} $F.
% 0.46/0.67
% 0.46/0.67 % SZS output end Refutation
% 0.46/0.67 ------------ end of proof -------------
% 0.46/0.67
% 0.46/0.67
% 0.46/0.67 Search stopped by max_proofs option.
% 0.46/0.67
% 0.46/0.67
% 0.46/0.67 Search stopped by max_proofs option.
% 0.46/0.67
% 0.46/0.67 ============ end of search ============
% 0.46/0.67
% 0.46/0.67 ----------- soft-scott stats ----------
% 0.46/0.67
% 0.46/0.67 true clauses given 2 (25.0%)
% 0.46/0.67 false clauses given 6
% 0.46/0.67
% 0.46/0.67 FALSE TRUE
% 0.46/0.67 3 0 2
% 0.46/0.67 5 0 1
% 0.46/0.67 8 0 4
% 0.46/0.67 tot: 0 7 (100.0% true)
% 0.46/0.67
% 0.46/0.67
% 0.46/0.67 Model 7 [ 2 1 46 ] (0.00 seconds, 250000 Inserts)
% 0.46/0.67
% 0.46/0.67 That finishes the proof of the theorem.
% 0.46/0.67
% 0.46/0.67 Process 27655 finished Sun Jul 10 05:57:44 2022
%------------------------------------------------------------------------------