TSTP Solution File: SYN207-1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : SYN207-1 : TPTP v8.1.0. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n016.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 : Thu Jul 21 12:10:54 EDT 2022
% Result : Unsatisfiable 0.67s 0.86s
% Output : Refutation 0.67s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SYN207-1 : TPTP v8.1.0. Released v1.1.0.
% 0.07/0.13 % Command : sos-script %s
% 0.13/0.35 % Computer : n016.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Tue Jul 12 08:42:29 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.20/0.39 ----- Otter 3.2, August 2001 -----
% 0.20/0.39 The process was started by sandbox on n016.cluster.edu,
% 0.20/0.39 Tue Jul 12 08:42:29 2022
% 0.20/0.39 The command was "./sos". The process ID is 12948.
% 0.20/0.39
% 0.20/0.39 set(prolog_style_variables).
% 0.20/0.39 set(auto).
% 0.20/0.39 dependent: set(auto1).
% 0.20/0.39 dependent: set(process_input).
% 0.20/0.39 dependent: clear(print_kept).
% 0.20/0.39 dependent: clear(print_new_demod).
% 0.20/0.39 dependent: clear(print_back_demod).
% 0.20/0.39 dependent: clear(print_back_sub).
% 0.20/0.39 dependent: set(control_memory).
% 0.20/0.39 dependent: assign(max_mem, 12000).
% 0.20/0.39 dependent: assign(pick_given_ratio, 4).
% 0.20/0.39 dependent: assign(stats_level, 1).
% 0.20/0.39 dependent: assign(pick_semantic_ratio, 3).
% 0.20/0.39 dependent: assign(sos_limit, 5000).
% 0.20/0.39 dependent: assign(max_weight, 60).
% 0.20/0.39 clear(print_given).
% 0.20/0.39
% 0.20/0.39 list(usable).
% 0.20/0.39
% 0.20/0.39 SCAN INPUT: prop=0, horn=1, equality=0, symmetry=0, max_lits=5.
% 0.20/0.39
% 0.20/0.39 This is a Horn set without equality. The strategy will
% 0.20/0.39 be hyperresolution, with satellites in sos and nuclei
% 0.20/0.39 in usable.
% 0.20/0.39
% 0.20/0.39 dependent: set(hyper_res).
% 0.20/0.39 dependent: clear(order_hyper).
% 0.20/0.39
% 0.20/0.39 ------------> process usable:
% 0.20/0.39 Following clause subsumed by 13 during input processing: 0 [] {-} m1(A,A,A)| -q0(B,C)| -q0(B,A).
% 0.20/0.39 Following clause subsumed by 14 during input processing: 0 [] {-} m1(A,A,A)| -m0(B,C,A).
% 0.20/0.39 Following clause subsumed by 14 during input processing: 0 [] {-} m1(A,A,A)| -l0(A)| -k0(A)| -m0(A,A,A).
% 0.20/0.39 Following clause subsumed by 12 during input processing: 0 [] {-} m1(e,e,e)| -r0(e).
% 0.20/0.39 Following clause subsumed by 63 during input processing: 0 [] {-} p1(A,A,A)| -n0(e,b)| -k0(b)| -k0(A)| -k1(B).
% 0.20/0.39 Following clause subsumed by 64 during input processing: 0 [] {-} p1(A,A,B)| -p0(B,A)| -r0(A).
% 0.20/0.39 Following clause subsumed by 63 during input processing: 0 [] {-} p1(e,e,e)| -r0(e)| -k0(e).
% 0.20/0.39 Following clause subsumed by 88 during input processing: 0 [] {-} q1(A,A,A)| -s0(A)| -m0(B,B,C).
% 0.20/0.39 Following clause subsumed by 88 during input processing: 0 [] {-} q1(A,A,A)| -s0(A).
% 0.20/0.39 Following clause subsumed by 88 during input processing: 0 [] {-} q1(d,d,d)| -k0(e)| -s0(d).
% 0.20/0.39 Following clause subsumed by 105 during input processing: 0 [] {-} q1(b,b,b)| -r0(b).
% 0.20/0.39 Following clause subsumed by 99 during input processing: 0 [] {-} q1(A,A,A)| -m0(B,C,A).
% 0.20/0.39 Following clause subsumed by 99 during input processing: 0 [] {-} q1(A,A,A)| -m0(A,B,A).
% 0.20/0.39 Following clause subsumed by 105 during input processing: 0 [] {-} q1(A,A,A)| -m0(c,A,A)| -r0(A).
% 0.20/0.39 Following clause subsumed by 142 during input processing: 0 [] {-} p2(A,A,A)| -s1(A)| -k1(A).
% 0.20/0.39 Following clause subsumed by 224 during input processing: 0 [] {-} p3(A,A,A)| -n2(A)| -q2(B,C,A)| -s1(B).
% 0.20/0.39 Following clause subsumed by 224 during input processing: 0 [] {-} p3(A,A,A)| -k1(A)| -n2(A).
% 0.20/0.39 13 back subsumes 9.
% 0.20/0.39 14 back subsumes 6.
% 0.20/0.39 28 back subsumes 21.
% 0.20/0.39 28 back subsumes 17.
% 0.20/0.39 40 back subsumes 39.
% 0.20/0.39 52 back subsumes 51.
% 0.20/0.39 77 back subsumes 68.
% 0.20/0.39 77 back subsumes 65.
% 0.20/0.39 142 back subsumes 134.
% 0.20/0.39 194 back subsumes 180.
% 0.20/0.39 216 back subsumes 213.
% 0.20/0.39 216 back subsumes 212.
% 0.20/0.39 244 back subsumes 239.
% 0.20/0.39
% 0.20/0.39 ------------> process sos:
% 0.20/0.39 Following clause subsumed by 321 during input processing: 0 [] {-} p0(b,c).
% 0.20/0.39 Following clause subsumed by 324 during input processing: 0 [] {-} q0(d,d).
% 0.20/0.39 321 back subsumes 317.
% 0.20/0.39 324 back subsumes 309.
% 0.20/0.39 326 back subsumes 315.
% 0.20/0.39 326 back subsumes 311.
% 0.20/0.39
% 0.20/0.39 ======= end of input processing =======
% 0.67/0.86
% 0.67/0.86 Stopped by limit on insertions
% 0.67/0.86
% 0.67/0.86
% 0.67/0.86 Failed to model usable list: disabling FINDER
% 0.67/0.86
% 0.67/0.86
% 0.67/0.86
% 0.67/0.86 -------------- Softie stats --------------
% 0.67/0.86
% 0.67/0.86 UPDATE_STOP: 300
% 0.67/0.86 SFINDER_TIME_LIMIT: 2
% 0.67/0.86 SHORT_CLAUSE_CUTOFF: 4
% 0.67/0.86 number of clauses in intial UL: 294
% 0.67/0.86 number of clauses initially in problem: 326
% 0.67/0.86 percentage of clauses intially in UL: 90
% 0.67/0.86 percentage of distinct symbols occuring in initial UL: 100
% 0.67/0.86 percent of all initial clauses that are short: 100
% 0.67/0.86 absolute distinct symbol count: 53
% 0.67/0.86 distinct predicate count: 48
% 0.67/0.86 distinct function count: 0
% 0.67/0.86 distinct constant count: 5
% 0.67/0.86
% 0.67/0.86 ---------- no more Softie stats ----------
% 0.67/0.86
% 0.67/0.86
% 0.67/0.86
% 0.67/0.86 =========== start of search ===========
% 0.67/0.86
% 0.67/0.86 -------- PROOF --------
% 0.67/0.86 % SZS status Unsatisfiable
% 0.67/0.86 % SZS output start Refutation
% 0.67/0.86
% 0.67/0.86 ----> UNIT CONFLICT at 0.46 sec ----> 629 [binary,628.1,307.1] {+} $F.
% 0.67/0.86
% 0.67/0.86 Length of proof is 7. Level of proof is 6.
% 0.67/0.86
% 0.67/0.86 ---------------- PROOF ----------------
% 0.67/0.86 % SZS status Unsatisfiable
% 0.67/0.86 % SZS output start Refutation
% 0.67/0.86
% 0.67/0.86 1 [] {+} k1(A)| -n0(B,A).
% 0.67/0.86 109 [] {+} s1(A)| -p0(A,A).
% 0.67/0.86 110 [] {+} s1(A)| -q0(A,B)| -s1(C).
% 0.67/0.86 116 [] {+} l2(A,A)| -p0(B,B)| -s1(C)| -m0(D,C,A).
% 0.67/0.86 165 [] {+} q2(A,c,B)| -k1(B)| -l0(c)| -l2(B,A).
% 0.67/0.86 171 [] {+} s2(A)| -q2(b,A,b)| -s1(b).
% 0.67/0.86 251 [] {+} s3(A,B)| -q2(C,A,C)| -s2(A)| -m0(C,D,B).
% 0.67/0.86 307 [] {+} -s3(c,c).
% 0.67/0.86 314 [] {-} n0(d,b).
% 0.67/0.86 321 [] {-} p0(b,A).
% 0.67/0.86 324 [] {-} q0(A,d).
% 0.67/0.86 326 [] {-} m0(A,d,B).
% 0.67/0.86 330 [] {-} l0(c).
% 0.67/0.86 374 [hyper,314,1] {-} k1(b).
% 0.67/0.86 380 [hyper,321,109] {-} s1(b).
% 0.67/0.86 398 [hyper,324,110,380] {-} s1(A).
% 0.67/0.86 407 [hyper,326,116,321,398] {-} l2(A,A).
% 0.67/0.86 467 [hyper,407,165,374,330] {-} q2(b,c,b).
% 0.67/0.86 625 [hyper,467,171,398] {-} s2(c).
% 0.67/0.86 628 [hyper,625,251,467,326] {-} s3(c,A).
% 0.67/0.86 629 [binary,628.1,307.1] {+} $F.
% 0.67/0.86
% 0.67/0.86 % SZS output end Refutation
% 0.67/0.86 ------------ end of proof -------------
% 0.67/0.86
% 0.67/0.86
% 0.67/0.86 Search stopped by max_proofs option.
% 0.67/0.86
% 0.67/0.86
% 0.67/0.86 Search stopped by max_proofs option.
% 0.67/0.86
% 0.67/0.86 ============ end of search ============
% 0.67/0.86
% 0.67/0.86 That finishes the proof of the theorem.
% 0.67/0.86
% 0.67/0.86 Process 12948 finished Tue Jul 12 08:42:29 2022
%------------------------------------------------------------------------------