TSTP Solution File: SET793+4 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : SET793+4 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n010.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:20:42 EDT 2022
% Result : Theorem 1.99s 2.20s
% Output : Refutation 1.99s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : SET793+4 : TPTP v8.1.0. Released v3.2.0.
% 0.04/0.12 % Command : sos-script %s
% 0.12/0.33 % Computer : n010.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Sun Jul 10 02:02:00 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.12/0.35 ----- Otter 3.2, August 2001 -----
% 0.12/0.35 The process was started by sandbox on n010.cluster.edu,
% 0.12/0.35 Sun Jul 10 02:02:00 2022
% 0.12/0.35 The command was "./sos". The process ID is 25973.
% 0.12/0.35
% 0.12/0.35 set(prolog_style_variables).
% 0.12/0.35 set(auto).
% 0.12/0.35 dependent: set(auto1).
% 0.12/0.35 dependent: set(process_input).
% 0.12/0.35 dependent: clear(print_kept).
% 0.12/0.35 dependent: clear(print_new_demod).
% 0.12/0.35 dependent: clear(print_back_demod).
% 0.12/0.35 dependent: clear(print_back_sub).
% 0.12/0.35 dependent: set(control_memory).
% 0.12/0.35 dependent: assign(max_mem, 12000).
% 0.12/0.35 dependent: assign(pick_given_ratio, 4).
% 0.12/0.35 dependent: assign(stats_level, 1).
% 0.12/0.35 dependent: assign(pick_semantic_ratio, 3).
% 0.12/0.35 dependent: assign(sos_limit, 5000).
% 0.12/0.35 dependent: assign(max_weight, 60).
% 0.12/0.35 clear(print_given).
% 0.12/0.35
% 0.12/0.35 formula_list(usable).
% 0.12/0.35
% 0.12/0.35 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=7.
% 0.12/0.35
% 0.12/0.35 This ia a non-Horn set with equality. The strategy will be
% 0.12/0.35 Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.12/0.35 unit deletion, with positive clauses in sos and nonpositive
% 0.12/0.35 clauses in usable.
% 0.12/0.35
% 0.12/0.35 dependent: set(knuth_bendix).
% 0.12/0.35 dependent: set(para_from).
% 0.12/0.35 dependent: set(para_into).
% 0.12/0.35 dependent: clear(para_from_right).
% 0.12/0.35 dependent: clear(para_into_right).
% 0.12/0.35 dependent: set(para_from_vars).
% 0.12/0.35 dependent: set(eq_units_both_ways).
% 0.12/0.35 dependent: set(dynamic_demod_all).
% 0.12/0.35 dependent: set(dynamic_demod).
% 0.12/0.35 dependent: set(order_eq).
% 0.12/0.35 dependent: set(back_demod).
% 0.12/0.35 dependent: set(lrpo).
% 0.12/0.35 dependent: set(hyper_res).
% 0.12/0.35 dependent: set(unit_deletion).
% 0.12/0.35 dependent: set(factor).
% 0.12/0.35
% 0.12/0.35 ------------> process usable:
% 0.12/0.35
% 0.12/0.35 ------------> process sos:
% 0.12/0.35 Following clause subsumed by 113 during input processing: 0 [copy,113,flip.1] {-} A=A.
% 0.12/0.35 113 back subsumes 87.
% 0.12/0.35
% 0.12/0.35 ======= end of input processing =======
% 0.50/0.70
% 0.50/0.70 Stopped by limit on insertions
% 0.50/0.70
% 0.50/0.70
% 0.50/0.70 Failed to model usable list: disabling FINDER
% 0.50/0.70
% 0.50/0.70
% 0.50/0.70
% 0.50/0.70 -------------- Softie stats --------------
% 0.50/0.70
% 0.50/0.70 UPDATE_STOP: 300
% 0.50/0.70 SFINDER_TIME_LIMIT: 2
% 0.50/0.70 SHORT_CLAUSE_CUTOFF: 4
% 0.50/0.70 number of clauses in intial UL: 85
% 0.50/0.70 number of clauses initially in problem: 110
% 0.50/0.70 percentage of clauses intially in UL: 77
% 0.50/0.70 percentage of distinct symbols occuring in initial UL: 100
% 0.50/0.70 percent of all initial clauses that are short: 100
% 0.50/0.70 absolute distinct symbol count: 32
% 0.50/0.70 distinct predicate count: 13
% 0.50/0.70 distinct function count: 16
% 0.50/0.70 distinct constant count: 3
% 0.50/0.70
% 0.50/0.70 ---------- no more Softie stats ----------
% 0.50/0.70
% 0.50/0.70
% 0.50/0.70
% 0.50/0.70 =========== start of search ===========
% 1.99/2.20
% 1.99/2.20 -------- PROOF --------
% 1.99/2.20 % SZS status Theorem
% 1.99/2.20 % SZS output start Refutation
% 1.99/2.20
% 1.99/2.20 ----> UNIT CONFLICT at 1.83 sec ----> 2120 [binary,2119.1,86.1] {-} $F.
% 1.99/2.20
% 1.99/2.20 Length of proof is 9. Level of proof is 6.
% 1.99/2.20
% 1.99/2.20 ---------------- PROOF ----------------
% 1.99/2.20 % SZS status Theorem
% 1.99/2.20 % SZS output start Refutation
% 1.99/2.20
% 1.99/2.20 45 [] {+} -total_order(A,B)| -member(C,B)| -member(D,B)|apply(A,C,D)|apply(A,D,C).
% 1.99/2.20 56 [] {+} greatest(A,B,C)| -member(A,C)|member($f11(B,C,A),C).
% 1.99/2.20 57 [] {+} greatest(A,B,C)| -member(A,C)| -apply(B,$f11(B,C,A),A).
% 1.99/2.20 62 [] {+} -max(A,B,C)|member(A,C).
% 1.99/2.20 63 [] {+} -max(A,B,C)| -member(D,C)| -apply(B,A,D)|A=D.
% 1.99/2.20 86 [] {+} -greatest($c1,$c3,$c2).
% 1.99/2.20 88 [factor,45.2.3,factor_simp] {+} -total_order(A,B)| -member(C,B)|apply(A,C,C).
% 1.99/2.20 111 [] {-} total_order($c3,$c2).
% 1.99/2.20 112 [] {-} max($c1,$c3,$c2).
% 1.99/2.20 156 [hyper,112,62] {-} member($c1,$c2).
% 1.99/2.20 195 [hyper,156,88,111] {-} apply($c3,$c1,$c1).
% 1.99/2.20 201 [hyper,156,56] {-} greatest($c1,A,$c2)|member($f11(A,$c2,$c1),$c2).
% 1.99/2.20 214 [para_into,195.1.2,63.4.1] {-} apply($c3,A,$c1)| -max($c1,B,C)| -member(A,C)| -apply(B,$c1,A).
% 1.99/2.20 390 [hyper,201,45,111,156] {-} greatest($c1,A,$c2)|apply($c3,$c1,$f11(A,$c2,$c1))|apply($c3,$f11(A,$c2,$c1),$c1).
% 1.99/2.20 2058 [hyper,390,86] {-} apply($c3,$c1,$f11($c3,$c2,$c1))|apply($c3,$f11($c3,$c2,$c1),$c1).
% 1.99/2.20 2105 [hyper,2058,214,112,201,unit_del,86,factor_simp] {-} apply($c3,$f11($c3,$c2,$c1),$c1).
% 1.99/2.20 2119 [hyper,2105,57,156] {-} greatest($c1,$c3,$c2).
% 1.99/2.20 2120 [binary,2119.1,86.1] {-} $F.
% 1.99/2.20
% 1.99/2.20 % SZS output end Refutation
% 1.99/2.20 ------------ end of proof -------------
% 1.99/2.20
% 1.99/2.20
% 1.99/2.20 Search stopped by max_proofs option.
% 1.99/2.20
% 1.99/2.20
% 1.99/2.20 Search stopped by max_proofs option.
% 1.99/2.20
% 1.99/2.20 ============ end of search ============
% 1.99/2.20
% 1.99/2.20 That finishes the proof of the theorem.
% 1.99/2.20
% 1.99/2.20 Process 25973 finished Sun Jul 10 02:02:02 2022
%------------------------------------------------------------------------------