TSTP Solution File: SYN347+1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : SYN347+1 : TPTP v8.1.0. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n016.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:12:02 EDT 2022
% Result : Theorem 0.92s 1.10s
% Output : Refutation 0.92s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : SYN347+1 : TPTP v8.1.0. Released v2.0.0.
% 0.10/0.13 % Command : sos-script %s
% 0.14/0.34 % Computer : n016.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 600
% 0.14/0.34 % DateTime : Mon Jul 11 21:11:28 EDT 2022
% 0.14/0.34 % CPUTime :
% 0.14/0.36 ----- Otter 3.2, August 2001 -----
% 0.14/0.36 The process was started by sandbox2 on n016.cluster.edu,
% 0.14/0.36 Mon Jul 11 21:11:28 2022
% 0.14/0.36 The command was "./sos". The process ID is 25416.
% 0.14/0.36
% 0.14/0.36 set(prolog_style_variables).
% 0.14/0.36 set(auto).
% 0.14/0.36 dependent: set(auto1).
% 0.14/0.36 dependent: set(process_input).
% 0.14/0.36 dependent: clear(print_kept).
% 0.14/0.36 dependent: clear(print_new_demod).
% 0.14/0.36 dependent: clear(print_back_demod).
% 0.14/0.36 dependent: clear(print_back_sub).
% 0.14/0.36 dependent: set(control_memory).
% 0.14/0.36 dependent: assign(max_mem, 12000).
% 0.14/0.36 dependent: assign(pick_given_ratio, 4).
% 0.14/0.36 dependent: assign(stats_level, 1).
% 0.14/0.36 dependent: assign(pick_semantic_ratio, 3).
% 0.14/0.36 dependent: assign(sos_limit, 5000).
% 0.14/0.36 dependent: assign(max_weight, 60).
% 0.14/0.36 clear(print_given).
% 0.14/0.36
% 0.14/0.36 formula_list(usable).
% 0.14/0.36
% 0.14/0.36 SCAN INPUT: prop=0, horn=0, equality=0, symmetry=0, max_lits=3.
% 0.14/0.36
% 0.14/0.36 This is a non-Horn set without equality. The strategy
% 0.14/0.36 will be ordered hyper_res, ur_res, unit deletion, and
% 0.14/0.36 factoring, with satellites in sos and nuclei in usable.
% 0.14/0.36
% 0.14/0.36 dependent: set(hyper_res).
% 0.14/0.36 dependent: set(factor).
% 0.14/0.36 dependent: set(unit_deletion).
% 0.14/0.36
% 0.14/0.36 ------------> process usable:
% 0.14/0.36
% 0.14/0.36 ------------> process sos:
% 0.14/0.36
% 0.14/0.36 ======= end of input processing =======
% 0.14/0.39
% 0.14/0.39 Model 1 (0.00 seconds, 0 Inserts)
% 0.14/0.39
% 0.14/0.39 Stopped by limit on number of solutions
% 0.14/0.39
% 0.14/0.39
% 0.14/0.39 -------------- Softie stats --------------
% 0.14/0.39
% 0.14/0.39 UPDATE_STOP: 300
% 0.14/0.39 SFINDER_TIME_LIMIT: 2
% 0.14/0.39 SHORT_CLAUSE_CUTOFF: 4
% 0.14/0.39 number of clauses in intial UL: 7
% 0.14/0.39 number of clauses initially in problem: 8
% 0.14/0.39 percentage of clauses intially in UL: 87
% 0.14/0.39 percentage of distinct symbols occuring in initial UL: 100
% 0.14/0.39 percent of all initial clauses that are short: 100
% 0.14/0.39 absolute distinct symbol count: 4
% 0.14/0.39 distinct predicate count: 1
% 0.14/0.39 distinct function count: 1
% 0.14/0.39 distinct constant count: 2
% 0.14/0.39
% 0.14/0.39 ---------- no more Softie stats ----------
% 0.14/0.39
% 0.14/0.39
% 0.14/0.39
% 0.14/0.39 =========== start of search ===========
% 0.92/1.10
% 0.92/1.10 -------- PROOF --------
% 0.92/1.10 % SZS status Theorem
% 0.92/1.10 % SZS output start Refutation
% 0.92/1.10
% 0.92/1.10 Stopped by limit on insertions
% 0.92/1.10
% 0.92/1.10 Model 2 [ 1 1 349 ] (0.00 seconds, 250000 Inserts)
% 0.92/1.10
% 0.92/1.10 Stopped by limit on insertions
% 0.92/1.10
% 0.92/1.10 Model 3 [ 1 12 183005 ] (0.00 seconds, 250000 Inserts)
% 0.92/1.10
% 0.92/1.10 Model 4 [ 3 0 769 ] (0.00 seconds, 156470 Inserts)
% 0.92/1.10
% 0.92/1.10 -----> EMPTY CLAUSE at 0.71 sec ----> 34 [hyper,32,7,25] {-} $F.
% 0.92/1.10
% 0.92/1.10 Length of proof is 8. Level of proof is 4.
% 0.92/1.10
% 0.92/1.10 ---------------- PROOF ----------------
% 0.92/1.10 % SZS status Theorem
% 0.92/1.10 % SZS output start Refutation
% 0.92/1.10
% 0.92/1.10 1 [] {+} -big_f(A,$f1(A,B))|big_f(B,$f1(A,B))|big_f($c2,$c1).
% 0.92/1.10 2 [] {+} big_f(A,$f1(A,B))| -big_f(B,$f1(A,B))|big_f($c2,$c1).
% 0.92/1.10 3 [] {+} big_f(A,$f1(A,B))|big_f(B,$f1(A,B))| -big_f($c2,$c1).
% 0.92/1.10 4 [] {+} -big_f(A,$f1(A,B))| -big_f(B,$f1(A,B))| -big_f($c2,$c1).
% 0.92/1.10 5 [] {+} -big_f($c2,$f1(A,B))| -big_f($c1,$f1(A,B)).
% 0.92/1.10 6 [factor,3.1.2] {+} big_f(A,$f1(A,A))| -big_f($c2,$c1).
% 0.92/1.10 7 [factor,4.1.2] {+} -big_f(A,$f1(A,A))| -big_f($c2,$c1).
% 0.92/1.10 8 [] {-} big_f($c2,$f1(A,B))|big_f($c1,$f1(A,B)).
% 0.92/1.10 10 [hyper,8,1] {-} big_f($c1,$f1($c2,A))|big_f(A,$f1($c2,A))|big_f($c2,$c1).
% 0.92/1.10 11 [hyper,8,2] {-} big_f($c2,$f1(A,$c1))|big_f(A,$f1(A,$c1))|big_f($c2,$c1).
% 0.92/1.10 14 [factor,10.1.2] {-} big_f($c1,$f1($c2,$c1))|big_f($c2,$c1).
% 0.92/1.10 15 [factor,11.1.2] {-} big_f($c2,$f1($c2,$c1))|big_f($c2,$c1).
% 0.92/1.10 25 [hyper,15,5,14,factor_simp] {-} big_f($c2,$c1).
% 0.92/1.10 32 [hyper,25,6] {+} big_f(A,$f1(A,A)).
% 0.92/1.10 34 [hyper,32,7,25] {-} $F.
% 0.92/1.10
% 0.92/1.10 % SZS output end Refutation
% 0.92/1.10 ------------ end of proof -------------
% 0.92/1.10
% 0.92/1.10
% 0.92/1.10 Search stopped by max_proofs option.
% 0.92/1.10
% 0.92/1.10
% 0.92/1.10 Search stopped by max_proofs option.
% 0.92/1.10
% 0.92/1.10 ============ end of search ============
% 0.92/1.10
% 0.92/1.10 ----------- soft-scott stats ----------
% 0.92/1.10
% 0.92/1.10 true clauses given 0 (0.0%)
% 0.92/1.10 false clauses given 8
% 0.92/1.10
% 0.92/1.10 FALSE TRUE
% 0.92/1.10 10 1 0
% 0.92/1.10 tot: 1 0 (0.0% true)
% 0.92/1.10
% 0.92/1.10
% 0.92/1.10 Model 4 [ 3 0 769 ] (0.00 seconds, 156470 Inserts)
% 0.92/1.10
% 0.92/1.10 That finishes the proof of the theorem.
% 0.92/1.10
% 0.92/1.10 Process 25416 finished Mon Jul 11 21:11:29 2022
%------------------------------------------------------------------------------