TSTP Solution File: SYN289-1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : SYN289-1 : TPTP v8.1.0. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n014.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:11:27 EDT 2022
% Result : Unsatisfiable 4.98s 5.17s
% Output : Refutation 4.98s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SYN289-1 : TPTP v8.1.0. Released v1.1.0.
% 0.07/0.13 % Command : sos-script %s
% 0.13/0.34 % Computer : n014.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 Jul 11 13:51:34 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.20/0.38 ----- Otter 3.2, August 2001 -----
% 0.20/0.38 The process was started by sandbox on n014.cluster.edu,
% 0.20/0.38 Mon Jul 11 13:51:34 2022
% 0.20/0.38 The command was "./sos". The process ID is 12061.
% 0.20/0.38
% 0.20/0.38 set(prolog_style_variables).
% 0.20/0.38 set(auto).
% 0.20/0.38 dependent: set(auto1).
% 0.20/0.38 dependent: set(process_input).
% 0.20/0.38 dependent: clear(print_kept).
% 0.20/0.38 dependent: clear(print_new_demod).
% 0.20/0.38 dependent: clear(print_back_demod).
% 0.20/0.38 dependent: clear(print_back_sub).
% 0.20/0.38 dependent: set(control_memory).
% 0.20/0.38 dependent: assign(max_mem, 12000).
% 0.20/0.38 dependent: assign(pick_given_ratio, 4).
% 0.20/0.38 dependent: assign(stats_level, 1).
% 0.20/0.38 dependent: assign(pick_semantic_ratio, 3).
% 0.20/0.38 dependent: assign(sos_limit, 5000).
% 0.20/0.38 dependent: assign(max_weight, 60).
% 0.20/0.38 clear(print_given).
% 0.20/0.38
% 0.20/0.38 list(usable).
% 0.20/0.38
% 0.20/0.38 SCAN INPUT: prop=0, horn=1, equality=0, symmetry=0, max_lits=5.
% 0.20/0.38
% 0.20/0.38 This is a Horn set without equality. The strategy will
% 0.20/0.38 be hyperresolution, with satellites in sos and nuclei
% 0.20/0.38 in usable.
% 0.20/0.38
% 0.20/0.38 dependent: set(hyper_res).
% 0.20/0.38 dependent: clear(order_hyper).
% 0.20/0.38
% 0.20/0.38 ------------> process usable:
% 0.20/0.38 Following clause subsumed by 13 during input processing: 0 [] {-} m1(A,A,A)| -q0(B,C)| -q0(B,A).
% 0.20/0.38 Following clause subsumed by 14 during input processing: 0 [] {-} m1(A,A,A)| -m0(B,C,A).
% 0.20/0.38 Following clause subsumed by 14 during input processing: 0 [] {-} m1(A,A,A)| -l0(A)| -k0(A)| -m0(A,A,A).
% 0.20/0.38 Following clause subsumed by 12 during input processing: 0 [] {-} m1(e,e,e)| -r0(e).
% 0.20/0.38 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.38 Following clause subsumed by 64 during input processing: 0 [] {-} p1(A,A,B)| -p0(B,A)| -r0(A).
% 0.20/0.38 Following clause subsumed by 63 during input processing: 0 [] {-} p1(e,e,e)| -r0(e)| -k0(e).
% 0.20/0.38 Following clause subsumed by 88 during input processing: 0 [] {-} q1(A,A,A)| -s0(A)| -m0(B,B,C).
% 0.20/0.38 Following clause subsumed by 88 during input processing: 0 [] {-} q1(A,A,A)| -s0(A).
% 0.20/0.38 Following clause subsumed by 88 during input processing: 0 [] {-} q1(d,d,d)| -k0(e)| -s0(d).
% 0.20/0.38 Following clause subsumed by 105 during input processing: 0 [] {-} q1(b,b,b)| -r0(b).
% 0.20/0.38 Following clause subsumed by 99 during input processing: 0 [] {-} q1(A,A,A)| -m0(B,C,A).
% 0.20/0.38 Following clause subsumed by 99 during input processing: 0 [] {-} q1(A,A,A)| -m0(A,B,A).
% 0.20/0.38 Following clause subsumed by 105 during input processing: 0 [] {-} q1(A,A,A)| -m0(c,A,A)| -r0(A).
% 0.20/0.38 Following clause subsumed by 142 during input processing: 0 [] {-} p2(A,A,A)| -s1(A)| -k1(A).
% 0.20/0.38 Following clause subsumed by 224 during input processing: 0 [] {-} p3(A,A,A)| -n2(A)| -q2(B,C,A)| -s1(B).
% 0.20/0.38 Following clause subsumed by 224 during input processing: 0 [] {-} p3(A,A,A)| -k1(A)| -n2(A).
% 0.20/0.38 13 back subsumes 9.
% 0.20/0.38 14 back subsumes 6.
% 0.20/0.38 28 back subsumes 21.
% 0.20/0.38 28 back subsumes 17.
% 0.20/0.38 40 back subsumes 39.
% 0.20/0.38 52 back subsumes 51.
% 0.20/0.38 77 back subsumes 68.
% 0.20/0.38 77 back subsumes 65.
% 0.20/0.38 142 back subsumes 134.
% 0.20/0.38 194 back subsumes 180.
% 0.20/0.38 216 back subsumes 213.
% 0.20/0.38 216 back subsumes 212.
% 0.20/0.38 244 back subsumes 239.
% 0.20/0.38
% 0.20/0.38 ------------> process sos:
% 0.20/0.38 Following clause subsumed by 321 during input processing: 0 [] {-} p0(b,c).
% 0.20/0.38 Following clause subsumed by 324 during input processing: 0 [] {-} q0(d,d).
% 0.20/0.38 321 back subsumes 317.
% 0.20/0.38 324 back subsumes 309.
% 0.20/0.38 326 back subsumes 315.
% 0.20/0.38 326 back subsumes 311.
% 0.20/0.38
% 0.20/0.38 ======= end of input processing =======
% 0.20/0.51
% 0.20/0.51 Model 1 (0.00 seconds, 0 Inserts)
% 0.20/0.51
% 0.20/0.51 Stopped by limit on number of solutions
% 0.20/0.51
% 0.20/0.51
% 0.20/0.51 -------------- Softie stats --------------
% 0.20/0.51
% 0.20/0.51 UPDATE_STOP: 300
% 0.20/0.51 SFINDER_TIME_LIMIT: 2
% 0.20/0.51 SHORT_CLAUSE_CUTOFF: 4
% 0.20/0.51 number of clauses in intial UL: 294
% 0.20/0.51 number of clauses initially in problem: 326
% 0.20/0.51 percentage of clauses intially in UL: 90
% 0.20/0.51 percentage of distinct symbols occuring in initial UL: 100
% 0.20/0.51 percent of all initial clauses that are short: 100
% 0.20/0.51 absolute distinct symbol count: 53
% 0.20/0.51 distinct predicate count: 48
% 0.20/0.51 distinct function count: 0
% 0.20/0.51 distinct constant count: 5
% 0.20/0.51
% 0.20/0.51 ---------- no more Softie stats ----------
% 0.20/0.51
% 0.20/0.51
% 0.20/0.51
% 0.20/0.51 Model 2 (0.00 seconds, 0 Inserts)
% 0.20/0.51
% 0.20/0.51 Stopped by limit on number of solutions
% 0.20/0.51
% 0.20/0.51 =========== start of search ===========
% 4.98/5.17
% 4.98/5.17 -------- PROOF --------
% 4.98/5.17 % SZS status Unsatisfiable
% 4.98/5.17 % SZS output start Refutation
% 4.98/5.17
% 4.98/5.17 Model 3 (0.00 seconds, 0 Inserts)
% 4.98/5.17
% 4.98/5.17 Stopped by limit on number of solutions
% 4.98/5.17
% 4.98/5.17 Stopped by limit on insertions
% 4.98/5.17
% 4.98/5.17 Model 4 [ 1 2 6663 ] (0.00 seconds, 250000 Inserts)
% 4.98/5.17
% 4.98/5.17 Stopped by limit on insertions
% 4.98/5.17
% 4.98/5.17 Stopped by limit on insertions
% 4.98/5.17
% 4.98/5.17 Model 5 [ 1 3 10734 ] (0.00 seconds, 250000 Inserts)
% 4.98/5.17
% 4.98/5.17 Stopped by limit on insertions
% 4.98/5.17
% 4.98/5.17 Model 6 [ 4 2 5064 ] (0.00 seconds, 250000 Inserts)
% 4.98/5.17
% 4.98/5.17 Stopped by limit on insertions
% 4.98/5.17
% 4.98/5.17 Stopped by limit on insertions
% 4.98/5.17
% 4.98/5.17 Model 7 [ 4 2 8644 ] (0.00 seconds, 250000 Inserts)
% 4.98/5.17
% 4.98/5.17 Stopped by limit on insertions
% 4.98/5.17
% 4.98/5.17 Model 8 [ 5 3 8868 ] (0.00 seconds, 250000 Inserts)
% 4.98/5.17
% 4.98/5.17 Stopped by limit on insertions
% 4.98/5.17
% 4.98/5.17 Model 9 [ 7 1 2968 ] (0.00 seconds, 250000 Inserts)
% 4.98/5.17
% 4.98/5.17 Stopped by limit on insertions
% 4.98/5.17
% 4.98/5.17 Model 10 [ 3 3 11706 ] (0.00 seconds, 250000 Inserts)
% 4.98/5.17
% 4.98/5.17 Stopped by limit on insertions
% 4.98/5.17
% 4.98/5.17 Model 11 [ 9 2 5592 ] (0.00 seconds, 250000 Inserts)
% 4.98/5.17
% 4.98/5.17 Stopped by limit on insertions
% 4.98/5.17
% 4.98/5.17 Model 12 [ 7 2 3672 ] (0.00 seconds, 250000 Inserts)
% 4.98/5.17
% 4.98/5.17 Stopped by limit on insertions
% 4.98/5.17
% 4.98/5.17 Stopped by limit on insertions
% 4.98/5.17
% 4.98/5.17 Model 13 [ 10 2 9301 ] (0.00 seconds, 250000 Inserts)
% 4.98/5.17
% 4.98/5.17 Stopped by limit on insertions
% 4.98/5.17
% 4.98/5.17 Model 14 [ 11 2 7197 ] (0.00 seconds, 250000 Inserts)
% 4.98/5.17
% 4.98/5.17 Stopped by limit on insertions
% 4.98/5.17
% 4.98/5.17 Model 15 [ 10 2 7644 ] (0.00 seconds, 250000 Inserts)
% 4.98/5.17
% 4.98/5.17 Stopped by limit on insertions
% 4.98/5.17
% 4.98/5.17 Model 16 [ 11 2 4830 ] (0.00 seconds, 250000 Inserts)
% 4.98/5.17
% 4.98/5.17 Stopped by limit on insertions
% 4.98/5.17
% 4.98/5.17 Model 17 [ 12 2 7286 ] (0.00 seconds, 250000 Inserts)
% 4.98/5.17
% 4.98/5.17 Stopped by limit on insertions
% 4.98/5.17
% 4.98/5.17 Model 18 [ 8 3 11515 ] (0.00 seconds, 250000 Inserts)
% 4.98/5.17
% 4.98/5.17 Stopped by limit on insertions
% 4.98/5.17
% 4.98/5.17 Model 19 [ 13 2 8763 ] (0.00 seconds, 250000 Inserts)
% 4.98/5.17
% 4.98/5.17 Stopped by limit on insertions
% 4.98/5.17
% 4.98/5.17 Model 20 [ 19 2 9229 ] (0.00 seconds, 250000 Inserts)
% 4.98/5.17
% 4.98/5.17 Stopped by limit on insertions
% 4.98/5.17
% 4.98/5.17 Model 21 [ 13 2 8070 ] (0.00 seconds, 250000 Inserts)
% 4.98/5.17
% 4.98/5.17 Stopped by limit on insertions
% 4.98/5.17
% 4.98/5.17 Stopped by limit on insertions
% 4.98/5.17
% 4.98/5.17 Model 22 [ 20 2 6835 ] (0.00 seconds, 250000 Inserts)
% 4.98/5.17
% 4.98/5.17 Stopped by limit on insertions
% 4.98/5.17
% 4.98/5.17 Model 23 [ 15 3 7592 ] (0.00 seconds, 250000 Inserts)
% 4.98/5.17
% 4.98/5.17 ----> UNIT CONFLICT at 4.75 sec ----> 415 [binary,414.1,307.1] {-} $F.
% 4.98/5.17
% 4.98/5.17 Length of proof is 1. Level of proof is 1.
% 4.98/5.17
% 4.98/5.17 ---------------- PROOF ----------------
% 4.98/5.17 % SZS status Unsatisfiable
% 4.98/5.17 % SZS output start Refutation
% 4.98/5.17
% 4.98/5.17 83 [] {+} q1(A,B,A)| -n0(C,B)| -p0(D,A).
% 4.98/5.17 307 [] {+} -q1(b,d,b).
% 4.98/5.17 325 [] {+} p0(c,b).
% 4.98/5.17 339 [] {+} n0(c,d).
% 4.98/5.17 414 [hyper,339,83,325] {-} q1(b,d,b).
% 4.98/5.17 415 [binary,414.1,307.1] {-} $F.
% 4.98/5.17
% 4.98/5.17 % SZS output end Refutation
% 4.98/5.17 ------------ end of proof -------------
% 4.98/5.17
% 4.98/5.17
% 4.98/5.17 Search stopped by max_proofs option.
% 4.98/5.17
% 4.98/5.17
% 4.98/5.17 Search stopped by max_proofs option.
% 4.98/5.17
% 4.98/5.17 ============ end of search ============
% 4.98/5.17
% 4.98/5.17 ----------- soft-scott stats ----------
% 4.98/5.17
% 4.98/5.17 true clauses given 2 (7.1%)
% 4.98/5.17 false clauses given 26
% 4.98/5.17
% 4.98/5.17 FALSE TRUE
% 4.98/5.17 2 1 1
% 4.98/5.17 3 1 5
% 4.98/5.17 4 13 33
% 4.98/5.17 tot: 15 39 (72.2% true)
% 4.98/5.17
% 4.98/5.17
% 4.98/5.17 Model 23 [ 15 3 7592 ] (0.00 seconds, 250000 Inserts)
% 4.98/5.17
% 4.98/5.17 That finishes the proof of the theorem.
% 4.98/5.17
% 4.98/5.17 Process 12061 finished Mon Jul 11 13:51:39 2022
%------------------------------------------------------------------------------