TSTP Solution File: SYN986+1.003 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : SYN986+1.003 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n018.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:16:50 EDT 2022
% Result : Theorem 0.20s 0.41s
% Output : Refutation 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : SYN986+1.003 : TPTP v8.1.0. Released v4.0.0.
% 0.03/0.13 % Command : sos-script %s
% 0.13/0.34 % Computer : n018.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 15:49:29 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.20/0.36 ----- Otter 3.2, August 2001 -----
% 0.20/0.36 The process was started by sandbox on n018.cluster.edu,
% 0.20/0.36 Mon Jul 11 15:49:29 2022
% 0.20/0.36 The command was "./sos". The process ID is 26361.
% 0.20/0.36
% 0.20/0.36 set(prolog_style_variables).
% 0.20/0.36 set(auto).
% 0.20/0.36 dependent: set(auto1).
% 0.20/0.36 dependent: set(process_input).
% 0.20/0.36 dependent: clear(print_kept).
% 0.20/0.36 dependent: clear(print_new_demod).
% 0.20/0.36 dependent: clear(print_back_demod).
% 0.20/0.36 dependent: clear(print_back_sub).
% 0.20/0.36 dependent: set(control_memory).
% 0.20/0.36 dependent: assign(max_mem, 12000).
% 0.20/0.36 dependent: assign(pick_given_ratio, 4).
% 0.20/0.36 dependent: assign(stats_level, 1).
% 0.20/0.36 dependent: assign(pick_semantic_ratio, 3).
% 0.20/0.36 dependent: assign(sos_limit, 5000).
% 0.20/0.36 dependent: assign(max_weight, 60).
% 0.20/0.36 clear(print_given).
% 0.20/0.36
% 0.20/0.36 formula_list(usable).
% 0.20/0.36
% 0.20/0.36 SCAN INPUT: prop=0, horn=1, equality=0, symmetry=0, max_lits=4.
% 0.20/0.36
% 0.20/0.36 This is a Horn set without equality. The strategy will
% 0.20/0.36 be hyperresolution, with satellites in sos and nuclei
% 0.20/0.36 in usable.
% 0.20/0.36
% 0.20/0.36 dependent: set(hyper_res).
% 0.20/0.36 dependent: clear(order_hyper).
% 0.20/0.36
% 0.20/0.36 ------------> process usable:
% 0.20/0.36
% 0.20/0.36 ------------> process sos:
% 0.20/0.36
% 0.20/0.36 ======= end of input processing =======
% 0.20/0.41
% 0.20/0.41 Model 1 (0.00 seconds, 0 Inserts)
% 0.20/0.41
% 0.20/0.41 Stopped by limit on number of solutions
% 0.20/0.41
% 0.20/0.41
% 0.20/0.41 -------------- Softie stats --------------
% 0.20/0.41
% 0.20/0.41 UPDATE_STOP: 300
% 0.20/0.41 SFINDER_TIME_LIMIT: 2
% 0.20/0.41 SHORT_CLAUSE_CUTOFF: 4
% 0.20/0.41 number of clauses in intial UL: 2
% 0.20/0.41 number of clauses initially in problem: 3
% 0.20/0.41 percentage of clauses intially in UL: 66
% 0.20/0.41 percentage of distinct symbols occuring in initial UL: 100
% 0.20/0.41 percent of all initial clauses that are short: 100
% 0.20/0.41 absolute distinct symbol count: 3
% 0.20/0.41 distinct predicate count: 1
% 0.20/0.41 distinct function count: 1
% 0.20/0.41 distinct constant count: 1
% 0.20/0.41
% 0.20/0.41 ---------- no more Softie stats ----------
% 0.20/0.41
% 0.20/0.41
% 0.20/0.41
% 0.20/0.41 =========== start of search ===========
% 0.20/0.41
% 0.20/0.41 -------- PROOF --------
% 0.20/0.41 % SZS status Theorem
% 0.20/0.41 % SZS output start Refutation
% 0.20/0.41
% 0.20/0.41 -----> EMPTY CLAUSE at 0.02 sec ----> 8 [hyper,7,2,3,4,5] {-} $F.
% 0.20/0.41
% 0.20/0.41 Length of proof is 4. Level of proof is 4.
% 0.20/0.41
% 0.20/0.41 ---------------- PROOF ----------------
% 0.20/0.41 % SZS status Theorem
% 0.20/0.41 % SZS output start Refutation
% 0.20/0.41
% 0.20/0.41 1 [] {+} -r(A,B,C)| -r(C,B,D)|r(A,succ(B),D).
% 0.20/0.41 2 [] {+} -r(zero,zero,A)| -r(zero,A,B)| -r(zero,B,C)| -r(zero,C,D).
% 0.20/0.41 3 [] {-} r(A,zero,succ(A)).
% 0.20/0.41 4 [hyper,3,1,3] {-} r(A,succ(zero),succ(succ(A))).
% 0.20/0.41 5 [hyper,4,1,4] {-} r(A,succ(succ(zero)),succ(succ(succ(succ(A))))).
% 0.20/0.41 6 [hyper,5,1,5] {-} r(A,succ(succ(succ(zero))),succ(succ(succ(succ(succ(succ(succ(succ(A))))))))).
% 0.20/0.41 7 [hyper,6,1,6] {-} r(A,succ(succ(succ(succ(zero)))),succ(succ(succ(succ(succ(succ(succ(succ(succ(succ(succ(succ(succ(succ(succ(succ(A))))))))))))))))).
% 0.20/0.41 8 [hyper,7,2,3,4,5] {-} $F.
% 0.20/0.41
% 0.20/0.41 % SZS output end Refutation
% 0.20/0.41 ------------ end of proof -------------
% 0.20/0.41
% 0.20/0.41
% 0.20/0.41 Search stopped by max_proofs option.
% 0.20/0.41
% 0.20/0.41
% 0.20/0.41 Search stopped by max_proofs option.
% 0.20/0.41
% 0.20/0.41 ============ end of search ============
% 0.20/0.41
% 0.20/0.41 ----------- soft-scott stats ----------
% 0.20/0.41
% 0.20/0.41 true clauses given 0 (0.0%)
% 0.20/0.41 false clauses given 5
% 0.20/0.41
% 0.20/0.41 FALSE TRUE
% 0.20/0.41 tot: 0 0 (-nan% true)
% 0.20/0.41
% 0.20/0.41
% 0.20/0.41 Model 1 (0.00 seconds, 0 Inserts)
% 0.20/0.41
% 0.20/0.41 That finishes the proof of the theorem.
% 0.20/0.41
% 0.20/0.41 Process 26361 finished Mon Jul 11 15:49:29 2022
%------------------------------------------------------------------------------