TSTP Solution File: SYN005-1.010 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : SYN005-1.010 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n028.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:02 EDT 2022
% Result : Unsatisfiable 0.78s 0.99s
% Output : Refutation 0.78s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SYN005-1.010 : TPTP v8.1.0. Released v1.0.0.
% 0.03/0.13 % Command : sos-script %s
% 0.13/0.34 % Computer : n028.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 04:50:44 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.19/0.35 ----- Otter 3.2, August 2001 -----
% 0.19/0.35 The process was started by sandbox on n028.cluster.edu,
% 0.19/0.35 Tue Jul 12 04:50:44 2022
% 0.19/0.35 The command was "./sos". The process ID is 4002.
% 0.19/0.35
% 0.19/0.35 set(prolog_style_variables).
% 0.19/0.35 set(auto).
% 0.19/0.35 dependent: set(auto1).
% 0.19/0.35 dependent: set(process_input).
% 0.19/0.35 dependent: clear(print_kept).
% 0.19/0.35 dependent: clear(print_new_demod).
% 0.19/0.35 dependent: clear(print_back_demod).
% 0.19/0.35 dependent: clear(print_back_sub).
% 0.19/0.35 dependent: set(control_memory).
% 0.19/0.35 dependent: assign(max_mem, 12000).
% 0.19/0.35 dependent: assign(pick_given_ratio, 4).
% 0.19/0.35 dependent: assign(stats_level, 1).
% 0.19/0.35 dependent: assign(pick_semantic_ratio, 3).
% 0.19/0.35 dependent: assign(sos_limit, 5000).
% 0.19/0.35 dependent: assign(max_weight, 60).
% 0.19/0.35 clear(print_given).
% 0.19/0.35
% 0.19/0.35 list(usable).
% 0.19/0.35
% 0.19/0.35 SCAN INPUT: prop=0, horn=1, equality=0, symmetry=0, max_lits=10.
% 0.19/0.35
% 0.19/0.35 This is a Horn set without equality. The strategy will
% 0.19/0.35 be hyperresolution, with satellites in sos and nuclei
% 0.19/0.35 in usable.
% 0.19/0.35
% 0.19/0.35 dependent: set(hyper_res).
% 0.19/0.35 dependent: clear(order_hyper).
% 0.19/0.35
% 0.19/0.35 ------------> process usable:
% 0.19/0.35
% 0.19/0.35 ------------> process sos:
% 0.19/0.35
% 0.19/0.35 ======= end of input processing =======
% 0.19/0.45
% 0.19/0.45 Model 1 (0.00 seconds, 0 Inserts)
% 0.19/0.45
% 0.19/0.45 Stopped by limit on number of solutions
% 0.19/0.45
% 0.19/0.45
% 0.19/0.45 -------------- Softie stats --------------
% 0.19/0.45
% 0.19/0.45 UPDATE_STOP: 300
% 0.19/0.45 SFINDER_TIME_LIMIT: 2
% 0.19/0.45 SHORT_CLAUSE_CUTOFF: 4
% 0.19/0.45 number of clauses in intial UL: 1
% 0.19/0.45 number of clauses initially in problem: 11
% 0.19/0.45 percentage of clauses intially in UL: 9
% 0.19/0.45 percentage of distinct symbols occuring in initial UL: 90
% 0.19/0.45 percent of all initial clauses that are short: 90
% 0.19/0.45 absolute distinct symbol count: 11
% 0.19/0.45 distinct predicate count: 10
% 0.19/0.45 distinct function count: 0
% 0.19/0.45 distinct constant count: 1
% 0.19/0.45
% 0.19/0.45 ---------- no more Softie stats ----------
% 0.19/0.45
% 0.19/0.45
% 0.19/0.45
% 0.19/0.45 Model 2 (0.00 seconds, 0 Inserts)
% 0.19/0.45
% 0.19/0.45 Stopped by limit on number of solutions
% 0.19/0.45
% 0.19/0.45 =========== start of search ===========
% 0.78/0.99
% 0.78/0.99 -------- PROOF --------
% 0.78/0.99 % SZS status Unsatisfiable
% 0.78/0.99 % SZS output start Refutation
% 0.78/0.99
% 0.78/0.99 Model 3 (0.00 seconds, 0 Inserts)
% 0.78/0.99
% 0.78/0.99 Stopped by limit on number of solutions
% 0.78/0.99
% 0.78/0.99 Model 4 (0.00 seconds, 0 Inserts)
% 0.78/0.99
% 0.78/0.99 Stopped by limit on number of solutions
% 0.78/0.99
% 0.78/0.99 Model 5 (0.00 seconds, 0 Inserts)
% 0.78/0.99
% 0.78/0.99 Stopped by limit on number of solutions
% 0.78/0.99
% 0.78/0.99 Model 6 (0.00 seconds, 0 Inserts)
% 0.78/0.99
% 0.78/0.99 Stopped by limit on number of solutions
% 0.78/0.99
% 0.78/0.99 Model 7 (0.00 seconds, 0 Inserts)
% 0.78/0.99
% 0.78/0.99 Stopped by limit on number of solutions
% 0.78/0.99
% 0.78/0.99 Model 8 (0.00 seconds, 0 Inserts)
% 0.78/0.99
% 0.78/0.99 Stopped by limit on number of solutions
% 0.78/0.99
% 0.78/0.99 Model 9 (0.00 seconds, 0 Inserts)
% 0.78/0.99
% 0.78/0.99 Stopped by limit on number of solutions
% 0.78/0.99
% 0.78/0.99 Stopped by limit on insertions
% 0.78/0.99
% 0.78/0.99 Model 10 [ 2 1 112 ] (0.00 seconds, 250000 Inserts)
% 0.78/0.99
% 0.78/0.99 -----> EMPTY CLAUSE at 0.46 sec ----> 12 [hyper,10,1,2,3,4,5,6,7,8,9,11] {-} $F.
% 0.78/0.99
% 0.78/0.99 Length of proof is 0. Level of proof is 0.
% 0.78/0.99
% 0.78/0.99 ---------------- PROOF ----------------
% 0.78/0.99 % SZS status Unsatisfiable
% 0.78/0.99 % SZS output start Refutation
% 0.78/0.99
% 0.78/0.99 1 [] {+} -p_1(A,B)| -p_2(B,C)| -p_3(C,D)| -p_4(D,E)| -p_5(E,F)| -p_6(F,G)| -p_7(G,H)| -p_8(H,I)| -p_9(I,J)| -p_10(J,A).
% 0.78/0.99 2 [] {+} p_1(a,a).
% 0.78/0.99 3 [] {+} p_2(a,a).
% 0.78/0.99 4 [] {+} p_3(a,a).
% 0.78/0.99 5 [] {+} p_4(a,a).
% 0.78/0.99 6 [] {+} p_5(a,a).
% 0.78/0.99 7 [] {+} p_6(a,a).
% 0.78/0.99 8 [] {+} p_7(a,a).
% 0.78/0.99 9 [] {+} p_8(a,a).
% 0.78/0.99 10 [] {+} p_9(a,a).
% 0.78/0.99 11 [] {+} p_10(a,a).
% 0.78/0.99 12 [hyper,10,1,2,3,4,5,6,7,8,9,11] {-} $F.
% 0.78/0.99
% 0.78/0.99 % SZS output end Refutation
% 0.78/0.99 ------------ end of proof -------------
% 0.78/0.99
% 0.78/0.99
% 0.78/0.99 Search stopped by max_proofs option.
% 0.78/0.99
% 0.78/0.99
% 0.78/0.99 Search stopped by max_proofs option.
% 0.78/0.99
% 0.78/0.99 ============ end of search ============
% 0.78/0.99
% 0.78/0.99 ----------- soft-scott stats ----------
% 0.78/0.99
% 0.78/0.99 true clauses given 1 (10.0%)
% 0.78/0.99 false clauses given 9
% 0.78/0.99
% 0.78/0.99 FALSE TRUE
% 0.78/0.99 tot: 0 0 (-nan% true)
% 0.78/0.99
% 0.78/0.99
% 0.78/0.99 Model 10 [ 2 1 112 ] (0.00 seconds, 250000 Inserts)
% 0.78/0.99
% 0.78/0.99 That finishes the proof of the theorem.
% 0.78/0.99
% 0.78/0.99 Process 4002 finished Tue Jul 12 04:50:45 2022
%------------------------------------------------------------------------------