TSTP Solution File: SET956+1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : SET956+1 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n017.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:05 EDT 2022
% Result : Theorem 0.47s 0.67s
% Output : Refutation 0.47s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13 % Problem : SET956+1 : TPTP v8.1.0. Released v3.2.0.
% 0.04/0.14 % Command : sos-script %s
% 0.15/0.35 % Computer : n017.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 300
% 0.15/0.35 % WCLimit : 600
% 0.15/0.35 % DateTime : Mon Jul 11 01:05:18 EDT 2022
% 0.15/0.35 % CPUTime :
% 0.15/0.37 ----- Otter 3.2, August 2001 -----
% 0.15/0.37 The process was started by sandbox2 on n017.cluster.edu,
% 0.15/0.37 Mon Jul 11 01:05:18 2022
% 0.15/0.37 The command was "./sos". The process ID is 26344.
% 0.15/0.37
% 0.15/0.37 set(prolog_style_variables).
% 0.15/0.37 set(auto).
% 0.15/0.37 dependent: set(auto1).
% 0.15/0.37 dependent: set(process_input).
% 0.15/0.37 dependent: clear(print_kept).
% 0.15/0.37 dependent: clear(print_new_demod).
% 0.15/0.37 dependent: clear(print_back_demod).
% 0.15/0.37 dependent: clear(print_back_sub).
% 0.15/0.37 dependent: set(control_memory).
% 0.15/0.37 dependent: assign(max_mem, 12000).
% 0.15/0.37 dependent: assign(pick_given_ratio, 4).
% 0.15/0.37 dependent: assign(stats_level, 1).
% 0.15/0.37 dependent: assign(pick_semantic_ratio, 3).
% 0.15/0.37 dependent: assign(sos_limit, 5000).
% 0.15/0.37 dependent: assign(max_weight, 60).
% 0.15/0.37 clear(print_given).
% 0.15/0.37
% 0.15/0.37 formula_list(usable).
% 0.15/0.37
% 0.15/0.37 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=3.
% 0.15/0.37
% 0.15/0.37 This ia a non-Horn set with equality. The strategy will be
% 0.15/0.37 Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.15/0.37 unit deletion, with positive clauses in sos and nonpositive
% 0.15/0.37 clauses in usable.
% 0.15/0.37
% 0.15/0.37 dependent: set(knuth_bendix).
% 0.15/0.37 dependent: set(para_from).
% 0.15/0.37 dependent: set(para_into).
% 0.15/0.37 dependent: clear(para_from_right).
% 0.15/0.37 dependent: clear(para_into_right).
% 0.15/0.37 dependent: set(para_from_vars).
% 0.15/0.37 dependent: set(eq_units_both_ways).
% 0.15/0.37 dependent: set(dynamic_demod_all).
% 0.15/0.37 dependent: set(dynamic_demod).
% 0.15/0.37 dependent: set(order_eq).
% 0.15/0.37 dependent: set(back_demod).
% 0.15/0.37 dependent: set(lrpo).
% 0.15/0.37 dependent: set(hyper_res).
% 0.15/0.37 dependent: set(unit_deletion).
% 0.15/0.37 dependent: set(factor).
% 0.15/0.37
% 0.15/0.37 ------------> process usable:
% 0.15/0.37
% 0.15/0.37 ------------> process sos:
% 0.15/0.37 Following clause subsumed by 13 during input processing: 0 [copy,13,flip.1] {-} unordered_pair(A,B)=unordered_pair(B,A).
% 0.15/0.37 Following clause subsumed by 21 during input processing: 0 [copy,21,flip.1] {-} A=A.
% 0.15/0.37
% 0.15/0.37 ======= end of input processing =======
% 0.21/0.42
% 0.21/0.42 Model 1 (0.00 seconds, 0 Inserts)
% 0.21/0.42
% 0.21/0.42 Stopped by limit on number of solutions
% 0.21/0.42
% 0.21/0.42
% 0.21/0.42 -------------- Softie stats --------------
% 0.21/0.42
% 0.21/0.42 UPDATE_STOP: 300
% 0.21/0.42 SFINDER_TIME_LIMIT: 2
% 0.21/0.42 SHORT_CLAUSE_CUTOFF: 4
% 0.21/0.42 number of clauses in intial UL: 11
% 0.21/0.42 number of clauses initially in problem: 19
% 0.21/0.42 percentage of clauses intially in UL: 57
% 0.21/0.42 percentage of distinct symbols occuring in initial UL: 70
% 0.21/0.42 percent of all initial clauses that are short: 100
% 0.21/0.42 absolute distinct symbol count: 17
% 0.21/0.42 distinct predicate count: 4
% 0.21/0.42 distinct function count: 7
% 0.21/0.42 distinct constant count: 6
% 0.21/0.42
% 0.21/0.42 ---------- no more Softie stats ----------
% 0.21/0.42
% 0.21/0.42
% 0.21/0.42
% 0.21/0.42 Model 2 (0.00 seconds, 0 Inserts)
% 0.21/0.42
% 0.21/0.42 Stopped by limit on number of solutions
% 0.21/0.42
% 0.21/0.42 =========== start of search ===========
% 0.47/0.67
% 0.47/0.67 -------- PROOF --------
% 0.47/0.67 % SZS status Theorem
% 0.47/0.67 % SZS output start Refutation
% 0.47/0.67
% 0.47/0.67 Model 3 (0.00 seconds, 0 Inserts)
% 0.47/0.67
% 0.47/0.67 Stopped by limit on number of solutions
% 0.47/0.67
% 0.47/0.67 Model 4 (0.00 seconds, 0 Inserts)
% 0.47/0.67
% 0.47/0.67 Stopped by limit on number of solutions
% 0.47/0.67
% 0.47/0.67 Model 5 (0.00 seconds, 0 Inserts)
% 0.47/0.67
% 0.47/0.67 Stopped by limit on number of solutions
% 0.47/0.67
% 0.47/0.67 Stopped by limit on insertions
% 0.47/0.67
% 0.47/0.67 ----> UNIT CONFLICT at 0.27 sec ----> 247 [binary,246.1,11.1] {-} $F.
% 0.47/0.67
% 0.47/0.67 Length of proof is 5. Level of proof is 4.
% 0.47/0.67
% 0.47/0.67 ---------------- PROOF ----------------
% 0.47/0.67 % SZS status Theorem
% 0.47/0.67 % SZS output start Refutation
% 0.47/0.67
% 0.47/0.67 3 [] {+} subset(A,B)| -in($f1(A,B),B).
% 0.47/0.67 8 [] {-} -subset(A,cartesian_product2(B,C))| -in(D,A)|D=ordered_pair($f3(A,B,C,D),$f2(A,B,C,D)).
% 0.47/0.67 9 [copy,8,flip.3] {+} -subset(A,cartesian_product2(B,C))| -in(D,A)|ordered_pair($f3(A,B,C,D),$f2(A,B,C,D))=D.
% 0.47/0.67 10 [] {+} -in(ordered_pair(A,B),$c6)|in(ordered_pair(A,B),$c3).
% 0.47/0.67 11 [] {+} -subset($c6,$c3).
% 0.47/0.67 14 [] {+} subset(A,B)|in($f1(A,B),A).
% 0.47/0.67 20 [] {-} subset($c6,cartesian_product2($c5,$c4)).
% 0.47/0.67 22 [hyper,14,11] {+} in($f1($c6,$c3),$c6).
% 0.47/0.67 38,37 [hyper,22,9,20] {-} ordered_pair($f3($c6,$c5,$c4,$f1($c6,$c3)),$f2($c6,$c5,$c4,$f1($c6,$c3)))=$f1($c6,$c3).
% 0.47/0.67 241 [para_from,37.1.1,10.2.1,demod,38,unit_del,22] {-} in($f1($c6,$c3),$c3).
% 0.47/0.67 246 [hyper,241,3] {-} subset($c6,$c3).
% 0.47/0.67 247 [binary,246.1,11.1] {-} $F.
% 0.47/0.67
% 0.47/0.67 % SZS output end Refutation
% 0.47/0.67 ------------ end of proof -------------
% 0.47/0.67
% 0.47/0.67
% 0.47/0.67 Search stopped by max_proofs option.
% 0.47/0.67
% 0.47/0.67
% 0.47/0.67 Search stopped by max_proofs option.
% 0.47/0.67
% 0.47/0.67 ============ end of search ============
% 0.47/0.67
% 0.47/0.67 ----------- soft-scott stats ----------
% 0.47/0.67
% 0.47/0.67 true clauses given 9 (23.7%)
% 0.47/0.67 false clauses given 29
% 0.47/0.67
% 0.47/0.67 FALSE TRUE
% 0.47/0.67 13 4 2
% 0.47/0.67 14 6 1
% 0.47/0.67 15 6 2
% 0.47/0.67 16 10 4
% 0.47/0.67 17 1 2
% 0.47/0.67 18 6 4
% 0.47/0.67 19 8 0
% 0.47/0.67 20 8 4
% 0.47/0.67 21 1 4
% 0.47/0.67 22 12 0
% 0.47/0.67 23 3 8
% 0.47/0.67 24 9 0
% 0.47/0.67 25 3 0
% 0.47/0.67 26 5 1
% 0.47/0.67 27 5 0
% 0.47/0.67 28 2 0
% 0.47/0.67 29 6 0
% 0.47/0.67 30 0 1
% 0.47/0.67 31 1 2
% 0.47/0.67 32 1 1
% 0.47/0.67 33 1 1
% 0.47/0.67 34 3 0
% 0.47/0.67 35 3 0
% 0.47/0.67 36 0 2
% 0.47/0.67 37 0 1
% 0.47/0.67 38 2 2
% 0.47/0.67 39 1 0
% 0.47/0.67 40 2 0
% 0.47/0.67 41 0 2
% 0.47/0.67 44 3 1
% 0.47/0.67 45 3 0
% 0.47/0.67 46 2 0
% 0.47/0.67 50 2 0
% 0.47/0.67 tot: 119 45 (27.4% true)
% 0.47/0.67
% 0.47/0.67
% 0.47/0.67 Model 5 (0.00 seconds, 0 Inserts)
% 0.47/0.67
% 0.47/0.67 That finishes the proof of the theorem.
% 0.47/0.67
% 0.47/0.67 Process 26344 finished Mon Jul 11 01:05:18 2022
%------------------------------------------------------------------------------