TSTP Solution File: PRO012+2 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : PRO012+2 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n024.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 : Mon Jul 18 17:53:35 EDT 2022
% Result : Theorem 0.96s 1.16s
% Output : Refutation 0.96s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : PRO012+2 : TPTP v8.1.0. Released v4.0.0.
% 0.03/0.12 % Command : sos-script %s
% 0.13/0.34 % Computer : n024.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 : Mon Jun 13 03:21:18 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.13/0.36 ----- Otter 3.2, August 2001 -----
% 0.13/0.36 The process was started by sandbox on n024.cluster.edu,
% 0.13/0.36 Mon Jun 13 03:21:18 2022
% 0.13/0.36 The command was "./sos". The process ID is 11884.
% 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=1, symmetry=0, max_lits=8.
% 0.13/0.36
% 0.13/0.36 This ia a non-Horn set with equality. The strategy will be
% 0.13/0.36 Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.13/0.36 unit deletion, with positive clauses in sos and nonpositive
% 0.13/0.36 clauses in usable.
% 0.13/0.36
% 0.13/0.36 dependent: set(knuth_bendix).
% 0.13/0.36 dependent: set(para_from).
% 0.13/0.36 dependent: set(para_into).
% 0.13/0.36 dependent: clear(para_from_right).
% 0.13/0.36 dependent: clear(para_into_right).
% 0.13/0.36 dependent: set(para_from_vars).
% 0.13/0.36 dependent: set(eq_units_both_ways).
% 0.13/0.36 dependent: set(dynamic_demod_all).
% 0.13/0.36 dependent: set(dynamic_demod).
% 0.13/0.36 dependent: set(order_eq).
% 0.13/0.36 dependent: set(back_demod).
% 0.13/0.36 dependent: set(lrpo).
% 0.13/0.36 dependent: set(hyper_res).
% 0.13/0.36 dependent: set(unit_deletion).
% 0.13/0.36 dependent: set(factor).
% 0.13/0.36
% 0.13/0.36 ------------> process usable:
% 0.13/0.36
% 0.13/0.36 ------------> process sos:
% 0.13/0.36 Following clause subsumed by 92 during input processing: 0 [copy,92,flip.1] {-} A=A.
% 0.13/0.36 92 back subsumes 85.
% 0.13/0.36 92 back subsumes 84.
% 0.13/0.36 92 back subsumes 81.
% 0.13/0.36 92 back subsumes 80.
% 0.13/0.36
% 0.13/0.36 ======= end of input processing =======
% 0.18/0.45
% 0.18/0.45
% 0.18/0.45 Failed to model usable list: disabling FINDER
% 0.18/0.45
% 0.18/0.45
% 0.18/0.45
% 0.18/0.45 -------------- Softie stats --------------
% 0.18/0.45
% 0.18/0.45 UPDATE_STOP: 300
% 0.18/0.45 SFINDER_TIME_LIMIT: 2
% 0.18/0.45 SHORT_CLAUSE_CUTOFF: 4
% 0.18/0.45 number of clauses in intial UL: 81
% 0.18/0.45 number of clauses initially in problem: 88
% 0.18/0.45 percentage of clauses intially in UL: 92
% 0.18/0.45 percentage of distinct symbols occuring in initial UL: 100
% 0.18/0.45 percent of all initial clauses that are short: 100
% 0.18/0.45 absolute distinct symbol count: 41
% 0.18/0.45 distinct predicate count: 18
% 0.18/0.45 distinct function count: 17
% 0.18/0.45 distinct constant count: 6
% 0.18/0.45
% 0.18/0.45 ---------- no more Softie stats ----------
% 0.18/0.45
% 0.18/0.45
% 0.18/0.45
% 0.18/0.45 =========== start of search ===========
% 0.96/1.16
% 0.96/1.16 -------- PROOF --------
% 0.96/1.16 % SZS status Theorem
% 0.96/1.16 % SZS output start Refutation
% 0.96/1.16
% 0.96/1.16 -----> EMPTY CLAUSE at 0.77 sec ----> 2591 [hyper,2589,79,1057,749,1348] {-} $F.
% 0.96/1.16
% 0.96/1.16 Length of proof is 12. Level of proof is 5.
% 0.96/1.16
% 0.96/1.16 ---------------- PROOF ----------------
% 0.96/1.16 % SZS status Theorem
% 0.96/1.16 % SZS output start Refutation
% 0.96/1.16
% 0.96/1.16 1 [] {+} -min_precedes(A,B,C)| -min_precedes(B,D,C)|min_precedes(A,D,C).
% 0.96/1.16 3 [] {+} -occurrence_of(A,B)| -root_occ(C,A)| -root_occ(D,A)|C=D.
% 0.96/1.16 20 [] {+} root_occ(A,B)| -occurrence_of(B,C)| -subactivity_occurrence(A,B)| -root(A,C).
% 0.96/1.16 61 [] {+} -occurrence_of(A,B)|atomic(B)|root($f14(B,A),B).
% 0.96/1.16 62 [] {+} -occurrence_of(A,B)|atomic(B)|subactivity_occurrence($f14(B,A),A).
% 0.96/1.16 64 [] {+} -occurrence_of(A,tptp0)|occurrence_of($f17(A),tptp3).
% 0.96/1.16 65 [] {+} -occurrence_of(A,tptp0)|root_occ($f17(A),A).
% 0.96/1.16 67 [] {+} -occurrence_of(A,tptp0)|min_precedes($f17(A),$f16(A),tptp0).
% 0.96/1.16 68 [] {+} -occurrence_of(A,tptp0)|occurrence_of($f15(A),tptp2)|occurrence_of($f15(A),tptp1).
% 0.96/1.16 69 [] {+} -occurrence_of(A,tptp0)|min_precedes($f16(A),$f15(A),tptp0).
% 0.96/1.16 71 [] {+} -atomic(tptp0).
% 0.96/1.16 78 [] {+} -occurrence_of(A,tptp3)| -root_occ(A,$c1)| -occurrence_of(B,tptp2)| -min_precedes(A,B,tptp0).
% 0.96/1.16 79 [] {+} -occurrence_of(A,tptp3)| -root_occ(A,$c1)| -occurrence_of(B,tptp1)| -min_precedes(A,B,tptp0).
% 0.96/1.16 91 [] {-} occurrence_of($c1,tptp0).
% 0.96/1.16 127 [hyper,91,69] {-} min_precedes($f16($c1),$f15($c1),tptp0).
% 0.96/1.16 128 [hyper,91,68] {-} occurrence_of($f15($c1),tptp2)|occurrence_of($f15($c1),tptp1).
% 0.96/1.16 129 [hyper,91,67] {-} min_precedes($f17($c1),$f16($c1),tptp0).
% 0.96/1.16 131 [hyper,91,65] {-} root_occ($f17($c1),$c1).
% 0.96/1.16 132 [hyper,91,64] {-} occurrence_of($f17($c1),tptp3).
% 0.96/1.16 133 [hyper,91,62,unit_del,71] {-} subactivity_occurrence($f14(tptp0,$c1),$c1).
% 0.96/1.16 134 [hyper,91,61,unit_del,71] {-} root($f14(tptp0,$c1),tptp0).
% 0.96/1.16 749 [hyper,134,20,91,133] {-} root_occ($f14(tptp0,$c1),$c1).
% 0.96/1.16 982,981 [hyper,749,3,91,131] {-} $f17($c1)=$f14(tptp0,$c1).
% 0.96/1.16 1057 [back_demod,132,demod,982] {-} occurrence_of($f14(tptp0,$c1),tptp3).
% 0.96/1.16 1348 [hyper,129,1,127,demod,982] {-} min_precedes($f14(tptp0,$c1),$f15($c1),tptp0).
% 0.96/1.16 2589 [hyper,128,78,1057,749,1348] {-} occurrence_of($f15($c1),tptp1).
% 0.96/1.16 2591 [hyper,2589,79,1057,749,1348] {-} $F.
% 0.96/1.16
% 0.96/1.16 % SZS output end Refutation
% 0.96/1.16 ------------ end of proof -------------
% 0.96/1.16
% 0.96/1.16
% 0.96/1.16 Search stopped by max_proofs option.
% 0.96/1.16
% 0.96/1.16
% 0.96/1.16 Search stopped by max_proofs option.
% 0.96/1.16
% 0.96/1.16 ============ end of search ============
% 0.96/1.16
% 0.96/1.16 That finishes the proof of the theorem.
% 0.96/1.16
% 0.96/1.16 Process 11884 finished Mon Jun 13 03:21:19 2022
%------------------------------------------------------------------------------