TSTP Solution File: SYN084+1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : SYN084+1 : TPTP v8.1.0. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n009.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:57 EDT 2022
% Result : Theorem 0.19s 0.43s
% Output : Refutation 0.19s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SYN084+1 : TPTP v8.1.0. Released v2.0.0.
% 0.11/0.13 % Command : sos-script %s
% 0.12/0.34 % Computer : n009.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Mon Jul 11 12:49:37 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.12/0.36 ----- Otter 3.2, August 2001 -----
% 0.12/0.36 The process was started by sandbox on n009.cluster.edu,
% 0.12/0.36 Mon Jul 11 12:49:37 2022
% 0.12/0.36 The command was "./sos". The process ID is 12355.
% 0.12/0.36
% 0.12/0.36 set(prolog_style_variables).
% 0.12/0.36 set(auto).
% 0.12/0.36 dependent: set(auto1).
% 0.12/0.36 dependent: set(process_input).
% 0.12/0.36 dependent: clear(print_kept).
% 0.12/0.36 dependent: clear(print_new_demod).
% 0.12/0.36 dependent: clear(print_back_demod).
% 0.12/0.36 dependent: clear(print_back_sub).
% 0.12/0.36 dependent: set(control_memory).
% 0.12/0.36 dependent: assign(max_mem, 12000).
% 0.12/0.36 dependent: assign(pick_given_ratio, 4).
% 0.12/0.36 dependent: assign(stats_level, 1).
% 0.12/0.36 dependent: assign(pick_semantic_ratio, 3).
% 0.12/0.36 dependent: assign(sos_limit, 5000).
% 0.12/0.36 dependent: assign(max_weight, 60).
% 0.12/0.36 clear(print_given).
% 0.12/0.36
% 0.12/0.36 formula_list(usable).
% 0.12/0.36
% 0.12/0.36 SCAN INPUT: prop=0, horn=0, equality=0, symmetry=0, max_lits=5.
% 0.12/0.36
% 0.12/0.36 This is a non-Horn set without equality. The strategy
% 0.12/0.36 will be ordered hyper_res, ur_res, unit deletion, and
% 0.12/0.36 factoring, with satellites in sos and nuclei in usable.
% 0.12/0.36
% 0.12/0.36 dependent: set(hyper_res).
% 0.12/0.36 dependent: set(factor).
% 0.12/0.36 dependent: set(unit_deletion).
% 0.12/0.36
% 0.12/0.36 ------------> process usable:
% 0.12/0.36 Following clause subsumed by 2 during input processing: 0 [] {-} big_p(A)|big_p(f(f(A)))| -big_p(a)| -big_p(f(B))|big_p(f(f(B))).
% 0.12/0.36 Following clause subsumed by 2 during input processing: 0 [] {-} -big_p(f(A))|big_p(f(f(A)))| -big_p(a)|big_p(B)|big_p(f(f(B))).
% 0.12/0.36
% 0.12/0.36 ------------> process sos:
% 0.12/0.36
% 0.12/0.36 ======= end of input processing =======
% 0.12/0.39
% 0.12/0.39 Model 1 (0.00 seconds, 0 Inserts)
% 0.12/0.39
% 0.12/0.39 Stopped by limit on number of solutions
% 0.12/0.39
% 0.12/0.39
% 0.12/0.39 -------------- Softie stats --------------
% 0.12/0.39
% 0.12/0.39 UPDATE_STOP: 300
% 0.12/0.39 SFINDER_TIME_LIMIT: 2
% 0.12/0.39 SHORT_CLAUSE_CUTOFF: 4
% 0.12/0.39 number of clauses in intial UL: 6
% 0.12/0.39 number of clauses initially in problem: 7
% 0.12/0.39 percentage of clauses intially in UL: 85
% 0.12/0.39 percentage of distinct symbols occuring in initial UL: 100
% 0.12/0.39 percent of all initial clauses that are short: 100
% 0.12/0.39 absolute distinct symbol count: 5
% 0.12/0.39 distinct predicate count: 1
% 0.12/0.39 distinct function count: 1
% 0.12/0.39 distinct constant count: 3
% 0.12/0.39
% 0.12/0.39 ---------- no more Softie stats ----------
% 0.12/0.39
% 0.12/0.39
% 0.12/0.39
% 0.12/0.39 =========== start of search ===========
% 0.19/0.43
% 0.19/0.43 -------- PROOF --------
% 0.19/0.43 % SZS status Theorem
% 0.19/0.43 % SZS output start Refutation
% 0.19/0.43
% 0.19/0.43 Model 2 [ 1 1 59 ] (0.00 seconds, 548 Inserts)
% 0.19/0.43
% 0.19/0.43 Model 3 [ 1 0 189 ] (0.00 seconds, 640 Inserts)
% 0.19/0.43
% 0.19/0.43 Model 4 [ 1 0 35 ] (0.00 seconds, 553 Inserts)
% 0.19/0.43
% 0.19/0.43 Model 5 [ 3 0 102 ] (0.00 seconds, 761 Inserts)
% 0.19/0.43
% 0.19/0.43 -----> EMPTY CLAUSE at 0.04 sec ----> 93 [hyper,92,8,71] {-} $F.
% 0.19/0.43
% 0.19/0.43 Length of proof is 15. Level of proof is 11.
% 0.19/0.43
% 0.19/0.43 ---------------- PROOF ----------------
% 0.19/0.43 % SZS status Theorem
% 0.19/0.43 % SZS output start Refutation
% 0.19/0.43
% 0.19/0.43 1 [] {-} big_p(A)|big_p(f(f(A)))| -big_p(a)|big_p(B)|big_p(f(f(B))).
% 0.19/0.43 2 [copy,1,factor_simp,factor_simp] {+} big_p(A)|big_p(f(f(A)))| -big_p(a).
% 0.19/0.43 3 [] {-} -big_p(f(A))|big_p(f(f(A)))| -big_p(a)| -big_p(f(B))|big_p(f(f(B))).
% 0.19/0.43 4 [copy,3,factor_simp,factor_simp] {+} -big_p(f(A))|big_p(f(f(A)))| -big_p(a).
% 0.19/0.43 5 [] {+} -big_p($c1)|big_p(f($c1))| -big_p($c2)|big_p(f($c2)).
% 0.19/0.43 6 [] {+} -big_p($c1)|big_p(f($c1))| -big_p(f(f($c2))).
% 0.19/0.43 7 [] {+} -big_p(f(f($c1)))| -big_p($c2)|big_p(f($c2)).
% 0.19/0.43 8 [] {+} -big_p(f(f($c1)))| -big_p(f(f($c2))).
% 0.19/0.43 9 [] {-} big_p(a).
% 0.19/0.43 10 [hyper,9,2] {+} big_p(A)|big_p(f(f(A))).
% 0.19/0.43 22 [hyper,10,8,10] {+} big_p($c2)|big_p($c1).
% 0.19/0.43 38 [hyper,22,7,10,factor_simp] {+} big_p($c1)|big_p(f($c2)).
% 0.19/0.43 40 [hyper,22,6,10,factor_simp] {+} big_p($c2)|big_p(f($c1)).
% 0.19/0.43 45 [hyper,38,4,9] {+} big_p($c1)|big_p(f(f($c2))).
% 0.19/0.43 46 [hyper,40,5,38,factor_simp,factor_simp] {+} big_p(f($c1))|big_p(f($c2)).
% 0.19/0.43 51 [hyper,45,8,10,factor_simp] {+} big_p($c1).
% 0.19/0.43 64 [hyper,46,4,9] {-} big_p(f($c1))|big_p(f(f($c2))).
% 0.19/0.43 68 [hyper,64,6,51,factor_simp] {+} big_p(f($c1)).
% 0.19/0.43 71 [hyper,68,4,9] {+} big_p(f(f($c1))).
% 0.19/0.43 74 [hyper,71,8,10] {+} big_p($c2).
% 0.19/0.43 86 [hyper,74,7,71] {+} big_p(f($c2)).
% 0.19/0.43 92 [hyper,86,4,9] {+} big_p(f(f($c2))).
% 0.19/0.43 93 [hyper,92,8,71] {-} $F.
% 0.19/0.43
% 0.19/0.43 % SZS output end Refutation
% 0.19/0.43 ------------ end of proof -------------
% 0.19/0.43
% 0.19/0.43
% 0.19/0.43 Search stopped by max_proofs option.
% 0.19/0.43
% 0.19/0.43
% 0.19/0.43 Search stopped by max_proofs option.
% 0.19/0.43
% 0.19/0.43 ============ end of search ============
% 0.19/0.43
% 0.19/0.43 ----------- soft-scott stats ----------
% 0.19/0.43
% 0.19/0.43 true clauses given 12 (50.0%)
% 0.19/0.43 false clauses given 12
% 0.19/0.43
% 0.19/0.43 FALSE TRUE
% 0.19/0.43 tot: 0 0 (-nan% true)
% 0.19/0.43
% 0.19/0.43
% 0.19/0.43 Model 5 [ 3 0 102 ] (0.00 seconds, 761 Inserts)
% 0.19/0.43
% 0.19/0.43 That finishes the proof of the theorem.
% 0.19/0.43
% 0.19/0.43 Process 12355 finished Mon Jul 11 12:49:37 2022
%------------------------------------------------------------------------------