TSTP Solution File: SYN070-1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : SYN070-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n025.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:09:46 EDT 2022
% Result : Unsatisfiable 0.59s 0.85s
% Output : Refutation 0.59s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SYN070-1 : TPTP v8.1.0. Released v1.0.0.
% 0.07/0.13 % Command : sos-script %s
% 0.13/0.34 % Computer : n025.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 14:10:47 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 sandbox2 on n025.cluster.edu,
% 0.13/0.36 Mon Jul 11 14:10:47 2022
% 0.13/0.36 The command was "./sos". The process ID is 29982.
% 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 list(usable).
% 0.13/0.36
% 0.13/0.36 SCAN INPUT: prop=0, horn=0, equality=0, symmetry=0, max_lits=5.
% 0.13/0.36
% 0.13/0.36 This is a non-Horn set without equality. The strategy
% 0.13/0.36 will be ordered hyper_res, ur_res, unit deletion, and
% 0.13/0.36 factoring, with satellites in sos and nuclei in usable.
% 0.13/0.36
% 0.13/0.36 dependent: set(hyper_res).
% 0.13/0.36 dependent: set(factor).
% 0.13/0.36 dependent: set(unit_deletion).
% 0.13/0.36
% 0.13/0.36 ------------> process usable:
% 0.13/0.36
% 0.13/0.36 ------------> process sos:
% 0.13/0.36
% 0.13/0.36 ======= end of input processing =======
% 0.13/0.40
% 0.13/0.40 Model 1 (0.00 seconds, 0 Inserts)
% 0.13/0.40
% 0.13/0.40 Stopped by limit on number of solutions
% 0.13/0.40
% 0.13/0.40
% 0.13/0.40 -------------- Softie stats --------------
% 0.13/0.40
% 0.13/0.40 UPDATE_STOP: 300
% 0.13/0.40 SFINDER_TIME_LIMIT: 2
% 0.13/0.40 SHORT_CLAUSE_CUTOFF: 4
% 0.13/0.40 number of clauses in intial UL: 9
% 0.13/0.40 number of clauses initially in problem: 10
% 0.13/0.40 percentage of clauses intially in UL: 90
% 0.13/0.40 percentage of distinct symbols occuring in initial UL: 100
% 0.13/0.40 percent of all initial clauses that are short: 100
% 0.13/0.40 absolute distinct symbol count: 7
% 0.13/0.40 distinct predicate count: 4
% 0.13/0.40 distinct function count: 1
% 0.13/0.40 distinct constant count: 2
% 0.13/0.40
% 0.13/0.40 ---------- no more Softie stats ----------
% 0.13/0.40
% 0.13/0.40
% 0.13/0.40
% 0.13/0.40 =========== start of search ===========
% 0.59/0.85
% 0.59/0.85 -------- PROOF --------
% 0.59/0.85 % SZS status Unsatisfiable
% 0.59/0.85 % SZS output start Refutation
% 0.59/0.85
% 0.59/0.85 Stopped by limit on insertions
% 0.59/0.85
% 0.59/0.85 Model 2 [ 1 0 36 ] (0.00 seconds, 250000 Inserts)
% 0.59/0.85
% 0.59/0.85 Model 3 [ 1 0 40 ] (0.00 seconds, 58987 Inserts)
% 0.59/0.85
% 0.59/0.85 Stopped by limit on insertions
% 0.59/0.85
% 0.59/0.85 Model 4 [ 3 0 35 ] (0.00 seconds, 250000 Inserts)
% 0.59/0.85
% 0.59/0.85 Model 5 [ 1 0 1145 ] (0.00 seconds, 3140 Inserts)
% 0.59/0.85
% 0.59/0.85 Stopped by limit on insertions
% 0.59/0.85
% 0.59/0.86 Model 6 [ 1 1 1011 ] (0.00 seconds, 250000 Inserts)
% 0.59/0.86
% 0.59/0.86 Model 7 [ 1 1 136 ] (0.00 seconds, 66961 Inserts)
% 0.59/0.86
% 0.59/0.86 Stopped by limit on insertions
% 0.59/0.86
% 0.59/0.86 Model 8 [ 1 1 23282 ] (0.00 seconds, 250000 Inserts)
% 0.59/0.86
% 0.59/0.86 Model 9 [ 1 3 57713 ] (0.00 seconds, 58213 Inserts)
% 0.59/0.86
% 0.59/0.86 Stopped by limit on insertions
% 0.59/0.86
% 0.59/0.86 Model 10 [ 2 1 29215 ] (0.00 seconds, 250000 Inserts)
% 0.59/0.86
% 0.59/0.86 -----> EMPTY CLAUSE at 0.47 sec ----> 42 [hyper,41,8,25,13,31] {-} $F.
% 0.59/0.86
% 0.59/0.86 Length of proof is 9. Level of proof is 6.
% 0.59/0.86
% 0.59/0.86 ---------------- PROOF ----------------
% 0.59/0.86 % SZS status Unsatisfiable
% 0.59/0.86 % SZS output start Refutation
% 0.59/0.86
% 0.59/0.86 1 [] {+} -big_f(A)|big_f(f(A))|big_g(A).
% 0.59/0.86 2 [] {+} -big_f(A)|big_h(f(A),A)|big_g(A).
% 0.59/0.86 3 [] {+} -big_f(A)| -big_g(f(A))|big_g(A).
% 0.59/0.86 4 [] {+} -big_f(A)|big_g(A)|big_f(a).
% 0.59/0.86 5 [] {+} -big_f(A)|big_g(A)| -big_g(a).
% 0.59/0.86 6 [] {-} -big_f(A)|big_g(A)| -big_f(B)|big_g(B)|big_j(a,B).
% 0.59/0.86 7 [copy,6,factor_simp,factor_simp] {+} -big_f(A)|big_g(A)|big_j(a,A).
% 0.59/0.86 8 [] {+} -big_f(A)| -big_f(B)| -big_h(A,B)| -big_j(B,A).
% 0.59/0.86 9 [] {+} -big_g(b).
% 0.59/0.86 11 [] {-} big_f(b).
% 0.59/0.86 13 [hyper,11,4,unit_del,9] {+} big_f(a).
% 0.59/0.86 17 [hyper,13,2] {+} big_h(f(a),a)|big_g(a).
% 0.59/0.86 18 [hyper,13,1] {+} big_f(f(a))|big_g(a).
% 0.59/0.86 25 [hyper,18,5,11,unit_del,9] {+} big_f(f(a)).
% 0.59/0.86 26 [hyper,25,7] {+} big_g(f(a))|big_j(a,f(a)).
% 0.59/0.86 31 [hyper,17,5,11,unit_del,9] {+} big_h(f(a),a).
% 0.59/0.86 38 [hyper,26,3,13] {+} big_j(a,f(a))|big_g(a).
% 0.59/0.86 41 [hyper,38,5,11,unit_del,9] {+} big_j(a,f(a)).
% 0.59/0.86 42 [hyper,41,8,25,13,31] {-} $F.
% 0.59/0.86
% 0.59/0.86 % SZS output end Refutation
% 0.59/0.86 ------------ end of proof -------------
% 0.59/0.86
% 0.59/0.86
% 0.59/0.86 Search stopped by max_proofs option.
% 0.59/0.86
% 0.59/0.86
% 0.59/0.86 Search stopped by max_proofs option.
% 0.59/0.86
% 0.59/0.86 ============ end of search ============
% 0.59/0.86
% 0.59/0.86 ----------- soft-scott stats ----------
% 0.59/0.86
% 0.59/0.86 true clauses given 10 (50.0%)
% 0.59/0.86 false clauses given 10
% 0.59/0.86
% 0.59/0.86 FALSE TRUE
% 0.59/0.86 7 0 1
% 0.59/0.86 9 0 3
% 0.59/0.86 12 0 1
% 0.59/0.86 tot: 0 5 (100.0% true)
% 0.59/0.86
% 0.59/0.86
% 0.59/0.86 Model 10 [ 2 1 29215 ] (0.00 seconds, 250000 Inserts)
% 0.59/0.86
% 0.59/0.86 That finishes the proof of the theorem.
% 0.59/0.86
% 0.59/0.86 Process 29982 finished Mon Jul 11 14:10:48 2022
%------------------------------------------------------------------------------