TSTP Solution File: SET949+1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : SET949+1 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n019.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:03 EDT 2022
% Result : Theorem 0.20s 0.47s
% Output : Refutation 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SET949+1 : TPTP v8.1.0. Released v3.2.0.
% 0.03/0.13 % Command : sos-script %s
% 0.12/0.34 % Computer : n019.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 : Sun Jul 10 13:22:38 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 sandbox on n019.cluster.edu,
% 0.12/0.36 Sun Jul 10 13:22:38 2022
% 0.12/0.36 The command was "./sos". The process ID is 24990.
% 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=1, symmetry=0, max_lits=5.
% 0.12/0.36
% 0.12/0.36 This ia a non-Horn set with equality. The strategy will be
% 0.12/0.36 Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.12/0.36 unit deletion, with positive clauses in sos and nonpositive
% 0.12/0.36 clauses in usable.
% 0.12/0.36
% 0.12/0.36 dependent: set(knuth_bendix).
% 0.12/0.36 dependent: set(para_from).
% 0.12/0.36 dependent: set(para_into).
% 0.12/0.36 dependent: clear(para_from_right).
% 0.12/0.36 dependent: clear(para_into_right).
% 0.12/0.36 dependent: set(para_from_vars).
% 0.12/0.36 dependent: set(eq_units_both_ways).
% 0.12/0.36 dependent: set(dynamic_demod_all).
% 0.12/0.36 dependent: set(dynamic_demod).
% 0.12/0.36 dependent: set(order_eq).
% 0.12/0.36 dependent: set(back_demod).
% 0.12/0.36 dependent: set(lrpo).
% 0.12/0.36 dependent: set(hyper_res).
% 0.12/0.36 dependent: set(unit_deletion).
% 0.12/0.36 dependent: set(factor).
% 0.12/0.36
% 0.12/0.36 ------------> process usable:
% 0.12/0.36
% 0.12/0.36 ------------> process sos:
% 0.12/0.36 Following clause subsumed by 17 during input processing: 0 [copy,17,flip.1] {-} unordered_pair(A,B)=unordered_pair(B,A).
% 0.12/0.36 Following clause subsumed by 27 during input processing: 0 [copy,27,flip.1] {-} A=A.
% 0.12/0.36
% 0.12/0.36 ======= end of input processing =======
% 0.20/0.43
% 0.20/0.43 Model 1 (0.00 seconds, 0 Inserts)
% 0.20/0.43
% 0.20/0.43 Stopped by limit on number of solutions
% 0.20/0.43
% 0.20/0.43
% 0.20/0.43 -------------- Softie stats --------------
% 0.20/0.43
% 0.20/0.43 UPDATE_STOP: 300
% 0.20/0.43 SFINDER_TIME_LIMIT: 2
% 0.20/0.43 SHORT_CLAUSE_CUTOFF: 4
% 0.20/0.43 number of clauses in intial UL: 15
% 0.20/0.43 number of clauses initially in problem: 24
% 0.20/0.43 percentage of clauses intially in UL: 62
% 0.20/0.43 percentage of distinct symbols occuring in initial UL: 58
% 0.20/0.43 percent of all initial clauses that are short: 100
% 0.20/0.43 absolute distinct symbol count: 17
% 0.20/0.43 distinct predicate count: 3
% 0.20/0.43 distinct function count: 9
% 0.20/0.43 distinct constant count: 5
% 0.20/0.43
% 0.20/0.43 ---------- no more Softie stats ----------
% 0.20/0.43
% 0.20/0.43
% 0.20/0.43
% 0.20/0.43 Model 2 (0.00 seconds, 0 Inserts)
% 0.20/0.43
% 0.20/0.43 Stopped by limit on number of solutions
% 0.20/0.43
% 0.20/0.43 =========== start of search ===========
% 0.20/0.47
% 0.20/0.47 -------- PROOF --------
% 0.20/0.47 % SZS status Theorem
% 0.20/0.47 % SZS output start Refutation
% 0.20/0.47
% 0.20/0.47 Model 3 (0.00 seconds, 0 Inserts)
% 0.20/0.47
% 0.20/0.47 Stopped by limit on number of solutions
% 0.20/0.47
% 0.20/0.47 ----> UNIT CONFLICT at 0.09 sec ----> 81 [binary,79.1,10.1] {-} $F.
% 0.20/0.47
% 0.20/0.47 Length of proof is 2. Level of proof is 2.
% 0.20/0.47
% 0.20/0.47 ---------------- PROOF ----------------
% 0.20/0.47 % SZS status Theorem
% 0.20/0.47 % SZS output start Refutation
% 0.20/0.47
% 0.20/0.47 4 [] {-} A!=cartesian_product2(B,C)| -in(D,A)|D=ordered_pair($f2(B,C,A,D),$f1(B,C,A,D)).
% 0.20/0.47 5 [copy,4,flip.3] {+} A!=cartesian_product2(B,C)| -in(D,A)|ordered_pair($f2(B,C,A,D),$f1(B,C,A,D))=D.
% 0.20/0.47 10 [] {+} ordered_pair(A,B)!=$c5.
% 0.20/0.47 26 [] {-} in($c5,cartesian_product2($c4,$c3)).
% 0.20/0.47 27 [] {+} A=A.
% 0.20/0.47 79 [hyper,27,5,26] {-} ordered_pair($f2($c4,$c3,cartesian_product2($c4,$c3),$c5),$f1($c4,$c3,cartesian_product2($c4,$c3),$c5))=$c5.
% 0.20/0.47 81 [binary,79.1,10.1] {-} $F.
% 0.20/0.47
% 0.20/0.47 % SZS output end Refutation
% 0.20/0.47 ------------ end of proof -------------
% 0.20/0.47
% 0.20/0.47
% 0.20/0.47 Search stopped by max_proofs option.
% 0.20/0.47
% 0.20/0.47
% 0.20/0.47 Search stopped by max_proofs option.
% 0.20/0.47
% 0.20/0.47 ============ end of search ============
% 0.20/0.47
% 0.20/0.47 ----------- soft-scott stats ----------
% 0.20/0.47
% 0.20/0.47 true clauses given 1 (20.0%)
% 0.20/0.47 false clauses given 4
% 0.20/0.47
% 0.20/0.47 FALSE TRUE
% 0.20/0.47 10 2 0
% 0.20/0.47 15 1 0
% 0.20/0.47 17 2 0
% 0.20/0.47 21 0 1
% 0.20/0.47 23 0 2
% 0.20/0.47 24 0 7
% 0.20/0.47 25 1 0
% 0.20/0.47 27 0 12
% 0.20/0.47 28 0 1
% 0.20/0.47 30 0 2
% 0.20/0.47 31 0 2
% 0.20/0.47 33 0 3
% 0.20/0.47 34 0 1
% 0.20/0.47 36 0 1
% 0.20/0.47 39 0 2
% 0.20/0.47 41 0 2
% 0.20/0.47 43 0 2
% 0.20/0.47 46 0 3
% 0.20/0.47 55 0 1
% 0.20/0.47 57 0 1
% 0.20/0.47 60 0 1
% 0.20/0.47 tot: 6 44 (88.0% true)
% 0.20/0.47
% 0.20/0.47
% 0.20/0.47 Model 3 (0.00 seconds, 0 Inserts)
% 0.20/0.47
% 0.20/0.47 That finishes the proof of the theorem.
% 0.20/0.47
% 0.20/0.47 Process 24990 finished Sun Jul 10 13:22:38 2022
%------------------------------------------------------------------------------