TSTP Solution File: SYN058+1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : SYN058+1 : TPTP v8.1.0. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n003.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:36 EDT 2022
% Result : Theorem 0.20s 0.39s
% Output : Refutation 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SYN058+1 : TPTP v8.1.0. Released v2.0.0.
% 0.12/0.12 % Command : sos-script %s
% 0.12/0.33 % Computer : n003.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Tue Jul 12 05:02:15 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.20/0.35 ----- Otter 3.2, August 2001 -----
% 0.20/0.35 The process was started by sandbox on n003.cluster.edu,
% 0.20/0.35 Tue Jul 12 05:02:15 2022
% 0.20/0.35 The command was "./sos". The process ID is 13805.
% 0.20/0.35
% 0.20/0.35 set(prolog_style_variables).
% 0.20/0.35 set(auto).
% 0.20/0.35 dependent: set(auto1).
% 0.20/0.35 dependent: set(process_input).
% 0.20/0.35 dependent: clear(print_kept).
% 0.20/0.35 dependent: clear(print_new_demod).
% 0.20/0.35 dependent: clear(print_back_demod).
% 0.20/0.35 dependent: clear(print_back_sub).
% 0.20/0.35 dependent: set(control_memory).
% 0.20/0.35 dependent: assign(max_mem, 12000).
% 0.20/0.35 dependent: assign(pick_given_ratio, 4).
% 0.20/0.35 dependent: assign(stats_level, 1).
% 0.20/0.35 dependent: assign(pick_semantic_ratio, 3).
% 0.20/0.35 dependent: assign(sos_limit, 5000).
% 0.20/0.35 dependent: assign(max_weight, 60).
% 0.20/0.35 clear(print_given).
% 0.20/0.35
% 0.20/0.35 formula_list(usable).
% 0.20/0.35
% 0.20/0.35 SCAN INPUT: prop=0, horn=1, equality=0, symmetry=0, max_lits=3.
% 0.20/0.35
% 0.20/0.35 This is a Horn set without equality. The strategy will
% 0.20/0.35 be hyperresolution, with satellites in sos and nuclei
% 0.20/0.35 in usable.
% 0.20/0.35
% 0.20/0.35 dependent: set(hyper_res).
% 0.20/0.35 dependent: clear(order_hyper).
% 0.20/0.35
% 0.20/0.35 ------------> process usable:
% 0.20/0.35
% 0.20/0.35 ------------> process sos:
% 0.20/0.35
% 0.20/0.35 ======= end of input processing =======
% 0.20/0.37
% 0.20/0.37 Model 1 (0.00 seconds, 0 Inserts)
% 0.20/0.37
% 0.20/0.37 Stopped by limit on number of solutions
% 0.20/0.37
% 0.20/0.37
% 0.20/0.37 -------------- Softie stats --------------
% 0.20/0.37
% 0.20/0.37 UPDATE_STOP: 300
% 0.20/0.37 SFINDER_TIME_LIMIT: 2
% 0.20/0.37 SHORT_CLAUSE_CUTOFF: 4
% 0.20/0.37 number of clauses in intial UL: 7
% 0.20/0.37 number of clauses initially in problem: 9
% 0.20/0.37 percentage of clauses intially in UL: 77
% 0.20/0.37 percentage of distinct symbols occuring in initial UL: 100
% 0.20/0.37 percent of all initial clauses that are short: 100
% 0.20/0.37 absolute distinct symbol count: 9
% 0.20/0.37 distinct predicate count: 6
% 0.20/0.37 distinct function count: 0
% 0.20/0.37 distinct constant count: 3
% 0.20/0.37
% 0.20/0.37 ---------- no more Softie stats ----------
% 0.20/0.37
% 0.20/0.37
% 0.20/0.37
% 0.20/0.37 =========== start of search ===========
% 0.20/0.39
% 0.20/0.39 -------- PROOF --------
% 0.20/0.39 % SZS status Theorem
% 0.20/0.39 % SZS output start Refutation
% 0.20/0.39
% 0.20/0.39 Model 2 (0.00 seconds, 0 Inserts)
% 0.20/0.39
% 0.20/0.39 Stopped by limit on number of solutions
% 0.20/0.39
% 0.20/0.39 Model 3 [ 1 0 27 ] (0.00 seconds, 21818 Inserts)
% 0.20/0.39
% 0.20/0.39 ----> UNIT CONFLICT at 0.03 sec ----> 13 [binary,12.1,7.1] {-} $F.
% 0.20/0.39
% 0.20/0.39 Length of proof is 3. Level of proof is 3.
% 0.20/0.39
% 0.20/0.39 ---------------- PROOF ----------------
% 0.20/0.39 % SZS status Theorem
% 0.20/0.39 % SZS output start Refutation
% 0.20/0.39
% 0.20/0.39 1 [] {+} -big_p(A)|big_q(B).
% 0.20/0.39 3 [] {+} -big_q($c1)|big_s($c2).
% 0.20/0.39 6 [] {+} -big_s(A)| -big_f(B)|big_g(B).
% 0.20/0.39 7 [] {+} -big_g($c3).
% 0.20/0.39 8 [] {+} big_p($c3).
% 0.20/0.39 9 [] {+} big_f($c3).
% 0.20/0.39 10 [hyper,8,1] {+} big_q(A).
% 0.20/0.39 11 [hyper,10,3] {+} big_s($c2).
% 0.20/0.39 12 [hyper,11,6,9] {-} big_g($c3).
% 0.20/0.39 13 [binary,12.1,7.1] {-} $F.
% 0.20/0.39
% 0.20/0.39 % SZS output end Refutation
% 0.20/0.39 ------------ end of proof -------------
% 0.20/0.39
% 0.20/0.39
% 0.20/0.39 Search stopped by max_proofs option.
% 0.20/0.39
% 0.20/0.39
% 0.20/0.39 Search stopped by max_proofs option.
% 0.20/0.39
% 0.20/0.39 ============ end of search ============
% 0.20/0.39
% 0.20/0.39 ----------- soft-scott stats ----------
% 0.20/0.39
% 0.20/0.39 true clauses given 2 (50.0%)
% 0.20/0.39 false clauses given 2
% 0.20/0.39
% 0.20/0.39 FALSE TRUE
% 0.20/0.39 tot: 0 0 (-nan% true)
% 0.20/0.39
% 0.20/0.39
% 0.20/0.39 Model 3 [ 1 0 27 ] (0.00 seconds, 21818 Inserts)
% 0.20/0.39
% 0.20/0.39 That finishes the proof of the theorem.
% 0.20/0.39
% 0.20/0.40 Process 13805 finished Tue Jul 12 05:02:15 2022
%------------------------------------------------------------------------------