TSTP Solution File: SYN328+1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : SYN328+1 : TPTP v8.1.0. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n008.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:48 EDT 2022
% Result : Theorem 0.20s 0.52s
% Output : Refutation 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : SYN328+1 : TPTP v8.1.0. Released v2.0.0.
% 0.10/0.13 % Command : sos-script %s
% 0.13/0.34 % Computer : n008.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 : Tue Jul 12 06:28:53 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 n008.cluster.edu,
% 0.13/0.36 Tue Jul 12 06:28:53 2022
% 0.13/0.36 The command was "./sos". The process ID is 8722.
% 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 formula_list(usable).
% 0.13/0.36
% 0.13/0.36 SCAN INPUT: prop=0, horn=0, equality=0, symmetry=0, max_lits=3.
% 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: 11
% 0.13/0.40 percentage of clauses intially in UL: 81
% 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: 5
% 0.13/0.40 distinct predicate count: 3
% 0.13/0.40 distinct function count: 2
% 0.13/0.40 distinct constant count: 0
% 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.20/0.52
% 0.20/0.52 -------- PROOF --------
% 0.20/0.52 % SZS status Theorem
% 0.20/0.52 % SZS output start Refutation
% 0.20/0.52
% 0.20/0.52 Model 2 [ 5 1 229 ] (0.00 seconds, 413 Inserts)
% 0.20/0.52
% 0.20/0.52 Model 3 [ 31 1 49 ] (0.00 seconds, 325 Inserts)
% 0.20/0.52
% 0.20/0.52 Model 4 [ 30 0 159 ] (0.00 seconds, 667 Inserts)
% 0.20/0.52
% 0.20/0.52 Model 5 [ 34 0 177 ] (0.00 seconds, 748 Inserts)
% 0.20/0.52
% 0.20/0.52 -----> EMPTY CLAUSE at 0.14 sec ----> 72 [hyper,71,9,69,68] {-} $F.
% 0.20/0.52
% 0.20/0.52 Length of proof is 22. Level of proof is 12.
% 0.20/0.52
% 0.20/0.52 ---------------- PROOF ----------------
% 0.20/0.52 % SZS status Theorem
% 0.20/0.52 % SZS output start Refutation
% 0.20/0.52
% 0.20/0.52 1 [] {+} -big_g($f2(A))|big_f(A).
% 0.20/0.52 2 [] {+} -big_f($f2(A))|big_g($f2(A))| -big_f(A).
% 0.20/0.52 3 [] {+} -big_h($f2(A))|big_g(A).
% 0.20/0.52 4 [] {+} -big_f($f2(A))|big_h($f2(A))| -big_g(A).
% 0.20/0.52 5 [] {+} -big_f($f2(A))|big_g($f2(A))|big_h(A).
% 0.20/0.52 6 [] {+} -big_h($f2(A))|big_h(A).
% 0.20/0.52 9 [] {+} -big_f($f1(A))| -big_g($f1(A))| -big_h($f1(A)).
% 0.20/0.52 10 [] {-} big_f($f2(A))|big_f(A).
% 0.20/0.52 11 [] {-} big_f($f2(A))|big_g(A).
% 0.20/0.52 12 [hyper,10,5] {-} big_f(A)|big_g($f2(A))|big_h(A).
% 0.20/0.52 13 [hyper,11,1] {-} big_f($f2($f2(A)))|big_f(A).
% 0.20/0.52 20 [hyper,12,6] {-} big_f($f2(A))|big_g($f2($f2(A)))|big_h(A).
% 0.20/0.52 22 [hyper,20,9,10,11,factor_simp,factor_simp] {-} big_f($f2($f1(A)))|big_g($f2($f2($f1(A)))).
% 0.20/0.52 24 [hyper,20,3] {-} big_f($f2($f2(A)))|big_g($f2($f2($f2(A))))|big_g(A).
% 0.20/0.52 27 [hyper,22,1,factor_simp] {+} big_f($f2($f1(A))).
% 0.20/0.52 37 [hyper,24,1,factor_simp] {-} big_f($f2($f2(A)))|big_g(A).
% 0.20/0.52 42 [hyper,37,4,10,factor_simp] {-} big_f($f2($f2(A)))|big_h($f2(A)).
% 0.20/0.52 43 [hyper,37,1] {-} big_f($f2($f2($f2(A))))|big_f(A).
% 0.20/0.52 47 [hyper,42,6] {-} big_f($f2($f2(A)))|big_h(A).
% 0.20/0.52 48 [hyper,47,9,13,37,factor_simp,factor_simp] {-} big_f($f2($f2($f1(A)))).
% 0.20/0.52 49 [hyper,47,6] {-} big_f($f2($f2($f2(A))))|big_h(A).
% 0.20/0.52 50 [hyper,47,3] {-} big_f($f2($f2($f2(A))))|big_g(A).
% 0.20/0.52 52 [hyper,48,2,27] {-} big_g($f2($f2($f1(A)))).
% 0.20/0.52 60 [hyper,50,9,43,49,factor_simp,factor_simp] {-} big_f($f2($f2($f2($f1(A))))).
% 0.20/0.52 63 [hyper,60,4,52] {-} big_h($f2($f2($f2($f1(A))))).
% 0.20/0.52 65 [hyper,63,6] {-} big_h($f2($f2($f1(A)))).
% 0.20/0.52 66 [hyper,65,6] {-} big_h($f2($f1(A))).
% 0.20/0.52 67 [hyper,65,3] {+} big_g($f2($f1(A))).
% 0.20/0.52 68 [hyper,66,6] {+} big_h($f1(A)).
% 0.20/0.52 69 [hyper,66,3] {+} big_g($f1(A)).
% 0.20/0.52 71 [hyper,67,1] {+} big_f($f1(A)).
% 0.20/0.52 72 [hyper,71,9,69,68] {-} $F.
% 0.20/0.52
% 0.20/0.52 % SZS output end Refutation
% 0.20/0.52 ------------ end of proof -------------
% 0.20/0.52
% 0.20/0.52
% 0.20/0.52 Search stopped by max_proofs option.
% 0.20/0.52
% 0.20/0.52
% 0.20/0.52 Search stopped by max_proofs option.
% 0.20/0.52
% 0.20/0.52 ============ end of search ============
% 0.20/0.52
% 0.20/0.52 ----------- soft-scott stats ----------
% 0.20/0.52
% 0.20/0.52 true clauses given 2 (6.1%)
% 0.20/0.52 false clauses given 31
% 0.20/0.52
% 0.20/0.52 FALSE TRUE
% 0.20/0.52 6 2 0
% 0.20/0.52 7 1 0
% 0.20/0.52 8 3 0
% 0.20/0.52 tot: 6 0 (0.0% true)
% 0.20/0.52
% 0.20/0.52
% 0.20/0.52 Model 5 [ 34 0 177 ] (0.00 seconds, 748 Inserts)
% 0.20/0.52
% 0.20/0.52 That finishes the proof of the theorem.
% 0.20/0.52
% 0.20/0.52 Process 8722 finished Tue Jul 12 06:28:53 2022
%------------------------------------------------------------------------------