TSTP Solution File: SET978+1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : SET978+1 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n015.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:22:11 EDT 2022
% Result : Theorem 2.93s 3.15s
% Output : Refutation 2.93s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : SET978+1 : TPTP v8.1.0. Released v3.2.0.
% 0.06/0.13 % Command : sos-script %s
% 0.14/0.34 % Computer : n015.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 600
% 0.14/0.34 % DateTime : Sat Jul 9 16:11:37 EDT 2022
% 0.14/0.34 % CPUTime :
% 0.14/0.36 ----- Otter 3.2, August 2001 -----
% 0.14/0.36 The process was started by sandbox on n015.cluster.edu,
% 0.14/0.36 Sat Jul 9 16:11:37 2022
% 0.14/0.36 The command was "./sos". The process ID is 28606.
% 0.14/0.36
% 0.14/0.36 set(prolog_style_variables).
% 0.14/0.36 set(auto).
% 0.14/0.36 dependent: set(auto1).
% 0.14/0.36 dependent: set(process_input).
% 0.14/0.36 dependent: clear(print_kept).
% 0.14/0.36 dependent: clear(print_new_demod).
% 0.14/0.36 dependent: clear(print_back_demod).
% 0.14/0.36 dependent: clear(print_back_sub).
% 0.14/0.36 dependent: set(control_memory).
% 0.14/0.36 dependent: assign(max_mem, 12000).
% 0.14/0.36 dependent: assign(pick_given_ratio, 4).
% 0.14/0.36 dependent: assign(stats_level, 1).
% 0.14/0.36 dependent: assign(pick_semantic_ratio, 3).
% 0.14/0.36 dependent: assign(sos_limit, 5000).
% 0.14/0.36 dependent: assign(max_weight, 60).
% 0.14/0.36 clear(print_given).
% 0.14/0.36
% 0.14/0.36 formula_list(usable).
% 0.14/0.36
% 0.14/0.36 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=2.
% 0.14/0.36
% 0.14/0.36 This ia a non-Horn set with equality. The strategy will be
% 0.14/0.36 Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.14/0.36 unit deletion, with positive clauses in sos and nonpositive
% 0.14/0.36 clauses in usable.
% 0.14/0.36
% 0.14/0.36 dependent: set(knuth_bendix).
% 0.14/0.36 dependent: set(para_from).
% 0.14/0.36 dependent: set(para_into).
% 0.14/0.36 dependent: clear(para_from_right).
% 0.14/0.36 dependent: clear(para_into_right).
% 0.14/0.36 dependent: set(para_from_vars).
% 0.14/0.36 dependent: set(eq_units_both_ways).
% 0.14/0.36 dependent: set(dynamic_demod_all).
% 0.14/0.36 dependent: set(dynamic_demod).
% 0.14/0.36 dependent: set(order_eq).
% 0.14/0.36 dependent: set(back_demod).
% 0.14/0.36 dependent: set(lrpo).
% 0.14/0.36 dependent: set(hyper_res).
% 0.14/0.36 dependent: set(unit_deletion).
% 0.14/0.36 dependent: set(factor).
% 0.14/0.36
% 0.14/0.36 ------------> process usable:
% 0.14/0.36
% 0.14/0.36 ------------> process sos:
% 0.14/0.36 Following clause subsumed by 9 during input processing: 0 [copy,9,flip.1] {-} A=A.
% 0.14/0.36
% 0.14/0.36 ======= end of input processing =======
% 0.14/0.39
% 0.14/0.39 Model 1 (0.00 seconds, 0 Inserts)
% 0.14/0.39
% 0.14/0.39 Stopped by limit on number of solutions
% 0.14/0.39
% 0.14/0.39
% 0.14/0.39 -------------- Softie stats --------------
% 0.14/0.39
% 0.14/0.39 UPDATE_STOP: 300
% 0.14/0.39 SFINDER_TIME_LIMIT: 2
% 0.14/0.39 SHORT_CLAUSE_CUTOFF: 4
% 0.14/0.39 number of clauses in intial UL: 6
% 0.14/0.39 number of clauses initially in problem: 9
% 0.14/0.39 percentage of clauses intially in UL: 66
% 0.14/0.39 percentage of distinct symbols occuring in initial UL: 90
% 0.14/0.39 percent of all initial clauses that are short: 100
% 0.14/0.39 absolute distinct symbol count: 11
% 0.14/0.39 distinct predicate count: 3
% 0.14/0.39 distinct function count: 2
% 0.14/0.39 distinct constant count: 6
% 0.14/0.39
% 0.14/0.39 ---------- no more Softie stats ----------
% 0.14/0.39
% 0.14/0.39
% 0.14/0.39
% 0.14/0.39 =========== start of search ===========
% 2.93/3.15
% 2.93/3.15 -------- PROOF --------
% 2.93/3.15 % SZS status Theorem
% 2.93/3.15 % SZS output start Refutation
% 2.93/3.15
% 2.93/3.15 Stopped by limit on insertions
% 2.93/3.15
% 2.93/3.15 Stopped by limit on insertions
% 2.93/3.15
% 2.93/3.15 -----> EMPTY CLAUSE at 2.77 sec ----> 174 [hyper,11,6,10,unit_del,5,5] {-} $F.
% 2.93/3.15
% 2.93/3.15 Length of proof is 2. Level of proof is 1.
% 2.93/3.15
% 2.93/3.15 ---------------- PROOF ----------------
% 2.93/3.15 % SZS status Theorem
% 2.93/3.15 % SZS output start Refutation
% 2.93/3.15
% 2.93/3.15 3 [] {+} -disjoint(A,B)|disjoint(cartesian_product2(A,C),cartesian_product2(B,D)).
% 2.93/3.15 4 [] {+} -disjoint(A,B)|disjoint(cartesian_product2(C,A),cartesian_product2(D,B)).
% 2.93/3.15 5 [] {+} $c6!=$c5.
% 2.93/3.15 6 [] {+} -disjoint(cartesian_product2(singleton($c6),$c4),cartesian_product2(singleton($c5),$c3))| -disjoint(cartesian_product2($c4,singleton($c6)),cartesian_product2($c3,singleton($c5))).
% 2.93/3.15 8 [] {-} A=B|disjoint(singleton(A),singleton(B)).
% 2.93/3.15 10 [hyper,8,4] {-} A=B|disjoint(cartesian_product2(C,singleton(A)),cartesian_product2(D,singleton(B))).
% 2.93/3.15 11 [hyper,8,3] {-} A=B|disjoint(cartesian_product2(singleton(A),C),cartesian_product2(singleton(B),D)).
% 2.93/3.15 174 [hyper,11,6,10,unit_del,5,5] {-} $F.
% 2.93/3.15
% 2.93/3.15 % SZS output end Refutation
% 2.93/3.15 ------------ end of proof -------------
% 2.93/3.15
% 2.93/3.15
% 2.93/3.15 Search stopped by max_proofs option.
% 2.93/3.15
% 2.93/3.15
% 2.93/3.15 Search stopped by max_proofs option.
% 2.93/3.15
% 2.93/3.15 ============ end of search ============
% 2.93/3.15
% 2.93/3.15 ----------- soft-scott stats ----------
% 2.93/3.15
% 2.93/3.15 true clauses given 2 (18.2%)
% 2.93/3.15 false clauses given 9
% 2.93/3.15
% 2.93/3.15 FALSE TRUE
% 2.93/3.15 5 0 2
% 2.93/3.15 7 0 2
% 2.93/3.15 8 1 0
% 2.93/3.15 9 4 0
% 2.93/3.15 10 12 0
% 2.93/3.15 11 1 1
% 2.93/3.15 12 17 0
% 2.93/3.15 13 16 1
% 2.93/3.15 14 8 0
% 2.93/3.15 15 8 0
% 2.93/3.15 16 8 0
% 2.93/3.15 17 12 4
% 2.93/3.15 19 4 1
% 2.93/3.15 21 2 2
% 2.93/3.15 23 0 32
% 2.93/3.15 25 0 1
% 2.93/3.15 27 0 17
% 2.93/3.15 tot: 93 63 (40.4% true)
% 2.93/3.15
% 2.93/3.15
% 2.93/3.15 Model 1 (0.00 seconds, 0 Inserts)
% 2.93/3.15
% 2.93/3.15 That finishes the proof of the theorem.
% 2.93/3.15
% 2.93/3.15 Process 28606 finished Sat Jul 9 16:11:40 2022
%------------------------------------------------------------------------------