TSTP Solution File: SYN281-1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : SYN281-1 : TPTP v8.1.0. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n027.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:24 EDT 2022
% Result : Unsatisfiable 2.86s 3.04s
% Output : Refutation 2.86s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SYN281-1 : TPTP v8.1.0. Released v1.1.0.
% 0.03/0.13 % Command : sos-script %s
% 0.13/0.34 % Computer : n027.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 16:16:49 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.20/0.39 ----- Otter 3.2, August 2001 -----
% 0.20/0.39 The process was started by sandbox2 on n027.cluster.edu,
% 0.20/0.39 Mon Jul 11 16:16:49 2022
% 0.20/0.39 The command was "./sos". The process ID is 20578.
% 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.20/0.54
% 0.20/0.54 Model 1 (0.00 seconds, 0 Inserts)
% 0.20/0.54
% 0.20/0.54 Stopped by limit on number of solutions
% 0.20/0.54
% 0.20/0.54
% 0.20/0.54 -------------- Softie stats --------------
% 0.20/0.54
% 0.20/0.54 UPDATE_STOP: 300
% 0.20/0.54 SFINDER_TIME_LIMIT: 2
% 0.20/0.54 SHORT_CLAUSE_CUTOFF: 4
% 0.20/0.54 number of clauses in intial UL: 294
% 0.20/0.54 number of clauses initially in problem: 326
% 0.20/0.54 percentage of clauses intially in UL: 90
% 0.20/0.54 percentage of distinct symbols occuring in initial UL: 100
% 0.20/0.54 percent of all initial clauses that are short: 100
% 0.20/0.54 absolute distinct symbol count: 53
% 0.20/0.54 distinct predicate count: 48
% 0.20/0.54 distinct function count: 0
% 0.20/0.54 distinct constant count: 5
% 0.20/0.54
% 0.20/0.54 ---------- no more Softie stats ----------
% 0.20/0.54
% 0.20/0.54
% 0.20/0.54
% 0.20/0.54 Model 2 (0.00 seconds, 0 Inserts)
% 0.20/0.54
% 0.20/0.54 Stopped by limit on number of solutions
% 0.20/0.54
% 0.20/0.54 =========== start of search ===========
% 2.86/3.04
% 2.86/3.04 -------- PROOF --------
% 2.86/3.04 % SZS status Unsatisfiable
% 2.86/3.04 % SZS output start Refutation
% 2.86/3.04
% 2.86/3.04 Model 3 (0.00 seconds, 0 Inserts)
% 2.86/3.04
% 2.86/3.04 Stopped by limit on number of solutions
% 2.86/3.04
% 2.86/3.04 Model 4 (0.00 seconds, 0 Inserts)
% 2.86/3.04
% 2.86/3.04 Stopped by limit on number of solutions
% 2.86/3.04
% 2.86/3.04 Stopped by limit on insertions
% 2.86/3.04
% 2.86/3.04 Model 5 [ 2 2 8791 ] (0.00 seconds, 250000 Inserts)
% 2.86/3.04
% 2.86/3.04 Stopped by limit on insertions
% 2.86/3.04
% 2.86/3.04 Model 6 [ 3 3 10153 ] (0.00 seconds, 250000 Inserts)
% 2.86/3.04
% 2.86/3.04 Stopped by limit on insertions
% 2.86/3.04
% 2.86/3.04 Model 7 [ 4 3 10388 ] (0.00 seconds, 250000 Inserts)
% 2.86/3.04
% 2.86/3.04 Stopped by limit on insertions
% 2.86/3.04
% 2.86/3.04 Model 8 [ 2 3 12190 ] (0.00 seconds, 250000 Inserts)
% 2.86/3.04
% 2.86/3.04 Stopped by limit on insertions
% 2.86/3.04
% 2.86/3.04 Model 9 [ 3 2 8200 ] (0.00 seconds, 250000 Inserts)
% 2.86/3.04
% 2.86/3.04 Stopped by limit on insertions
% 2.86/3.04
% 2.86/3.04 Model 10 [ 3 2 10647 ] (0.00 seconds, 250000 Inserts)
% 2.86/3.04
% 2.86/3.04 Stopped by limit on insertions
% 2.86/3.04
% 2.86/3.04 Model 11 [ 6 2 13515 ] (0.00 seconds, 250000 Inserts)
% 2.86/3.04
% 2.86/3.04 Stopped by limit on insertions
% 2.86/3.04
% 2.86/3.04 Model 12 [ 9 2 3455 ] (0.00 seconds, 250000 Inserts)
% 2.86/3.04
% 2.86/3.04 Stopped by limit on insertions
% 2.86/3.04
% 2.86/3.04 Model 13 [ 6 2 3656 ] (0.00 seconds, 250000 Inserts)
% 2.86/3.04
% 2.86/3.04 Stopped by limit on insertions
% 2.86/3.04
% 2.86/3.04 Model 14 [ 12 2 2988 ] (0.00 seconds, 250000 Inserts)
% 2.86/3.04
% 2.86/3.04 Stopped by limit on insertions
% 2.86/3.04
% 2.86/3.04 Model 15 [ 5 2 10560 ] (0.00 seconds, 250000 Inserts)
% 2.86/3.04
% 2.86/3.04 Stopped by limit on insertions
% 2.86/3.04
% 2.86/3.04 Model 16 [ 10 2 8614 ] (0.00 seconds, 250000 Inserts)
% 2.86/3.04
% 2.86/3.04 Stopped by limit on insertions
% 2.86/3.04
% 2.86/3.04 Model 17 [ 15 1 6154 ] (0.00 seconds, 250000 Inserts)
% 2.86/3.04
% 2.86/3.04 ----> UNIT CONFLICT at 2.62 sec ----> 400 [binary,399.1,307.1] {-} $F.
% 2.86/3.04
% 2.86/3.04 Length of proof is 1. Level of proof is 1.
% 2.86/3.04
% 2.86/3.04 ---------------- PROOF ----------------
% 2.86/3.04 % SZS status Unsatisfiable
% 2.86/3.04 % SZS output start Refutation
% 2.86/3.04
% 2.86/3.04 86 [] {+} q1(A,B,B)| -p0(B,A).
% 2.86/3.04 307 [] {+} -q1(A,c,c).
% 2.86/3.04 325 [] {-} p0(c,b).
% 2.86/3.04 399 [hyper,325,86] {-} q1(b,c,c).
% 2.86/3.04 400 [binary,399.1,307.1] {-} $F.
% 2.86/3.04
% 2.86/3.04 % SZS output end Refutation
% 2.86/3.04 ------------ end of proof -------------
% 2.86/3.04
% 2.86/3.04
% 2.86/3.04 Search stopped by max_proofs option.
% 2.86/3.04
% 2.86/3.04
% 2.86/3.04 Search stopped by max_proofs option.
% 2.86/3.04
% 2.86/3.04 ============ end of search ============
% 2.86/3.04
% 2.86/3.04 ----------- soft-scott stats ----------
% 2.86/3.04
% 2.86/3.04 true clauses given 3 (15.0%)
% 2.86/3.04 false clauses given 17
% 2.86/3.04
% 2.86/3.04 FALSE TRUE
% 2.86/3.04 2 0 1
% 2.86/3.04 3 8 2
% 2.86/3.04 4 21 18
% 2.86/3.04 tot: 29 21 (42.0% true)
% 2.86/3.04
% 2.86/3.04
% 2.86/3.04 Model 17 [ 15 -23 6154 ] (0.00 seconds, 250000 Inserts)
% 2.86/3.04
% 2.86/3.04 That finishes the proof of the theorem.
% 2.86/3.04
% 2.86/3.04 Process 20578 finished Mon Jul 11 16:16:52 2022
%------------------------------------------------------------------------------