TSTP Solution File: PUZ060+1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : PUZ060+1 : TPTP v8.1.0. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n021.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 : Mon Jul 18 18:27:05 EDT 2022
% Result : Theorem 0.40s 0.61s
% Output : Refutation 0.40s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : PUZ060+1 : TPTP v8.1.0. Released v3.1.0.
% 0.03/0.13 % Command : sos-script %s
% 0.13/0.33 % Computer : n021.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % 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 : Sun May 29 00:55:27 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.13/0.35 ----- Otter 3.2, August 2001 -----
% 0.13/0.35 The process was started by sandbox2 on n021.cluster.edu,
% 0.13/0.35 Sun May 29 00:55:27 2022
% 0.13/0.35 The command was "./sos". The process ID is 11806.
% 0.13/0.35
% 0.13/0.35 set(prolog_style_variables).
% 0.13/0.35 set(auto).
% 0.13/0.35 dependent: set(auto1).
% 0.13/0.35 dependent: set(process_input).
% 0.13/0.35 dependent: clear(print_kept).
% 0.13/0.35 dependent: clear(print_new_demod).
% 0.13/0.35 dependent: clear(print_back_demod).
% 0.13/0.35 dependent: clear(print_back_sub).
% 0.13/0.35 dependent: set(control_memory).
% 0.13/0.35 dependent: assign(max_mem, 12000).
% 0.13/0.35 dependent: assign(pick_given_ratio, 4).
% 0.13/0.35 dependent: assign(stats_level, 1).
% 0.13/0.35 dependent: assign(pick_semantic_ratio, 3).
% 0.13/0.35 dependent: assign(sos_limit, 5000).
% 0.13/0.35 dependent: assign(max_weight, 60).
% 0.13/0.35 clear(print_given).
% 0.13/0.35
% 0.13/0.35 formula_list(usable).
% 0.13/0.35
% 0.13/0.35 SCAN INPUT: prop=0, horn=1, equality=0, symmetry=0, max_lits=3.
% 0.13/0.35
% 0.13/0.35 This is a Horn set without equality. The strategy will
% 0.13/0.35 be hyperresolution, with satellites in sos and nuclei
% 0.13/0.35 in usable.
% 0.13/0.35
% 0.13/0.35 dependent: set(hyper_res).
% 0.13/0.35 dependent: clear(order_hyper).
% 0.13/0.35
% 0.13/0.35 ------------> process usable:
% 0.13/0.35
% 0.13/0.35 ------------> process sos:
% 0.13/0.35
% 0.13/0.35 ======= end of input processing =======
% 0.19/0.39
% 0.19/0.39 Model 1 (0.00 seconds, 0 Inserts)
% 0.19/0.39
% 0.19/0.39 Stopped by limit on number of solutions
% 0.19/0.39
% 0.19/0.39
% 0.19/0.39 -------------- Softie stats --------------
% 0.19/0.39
% 0.19/0.39 UPDATE_STOP: 300
% 0.19/0.39 SFINDER_TIME_LIMIT: 2
% 0.19/0.39 SHORT_CLAUSE_CUTOFF: 4
% 0.19/0.39 number of clauses in intial UL: 5
% 0.19/0.39 number of clauses initially in problem: 9
% 0.19/0.39 percentage of clauses intially in UL: 55
% 0.19/0.39 percentage of distinct symbols occuring in initial UL: 81
% 0.19/0.39 percent of all initial clauses that are short: 100
% 0.19/0.39 absolute distinct symbol count: 11
% 0.19/0.39 distinct predicate count: 5
% 0.19/0.39 distinct function count: 0
% 0.19/0.39 distinct constant count: 6
% 0.19/0.39
% 0.19/0.39 ---------- no more Softie stats ----------
% 0.19/0.39
% 0.19/0.39
% 0.19/0.39
% 0.19/0.39 Model 2 (0.00 seconds, 0 Inserts)
% 0.19/0.39
% 0.19/0.39 Stopped by limit on number of solutions
% 0.19/0.39
% 0.19/0.39 =========== start of search ===========
% 0.40/0.61
% 0.40/0.61 -------- PROOF --------
% 0.40/0.61 % SZS status Theorem
% 0.40/0.61 % SZS output start Refutation
% 0.40/0.61
% 0.40/0.61 Model 3 (0.00 seconds, 0 Inserts)
% 0.40/0.61
% 0.40/0.61 Stopped by limit on number of solutions
% 0.40/0.61
% 0.40/0.61 Stopped by limit on insertions
% 0.40/0.61
% 0.40/0.61 Model 4 [ 1 0 70 ] (0.00 seconds, 250000 Inserts)
% 0.40/0.61
% 0.40/0.61 Stopped by limit on insertions
% 0.40/0.61
% 0.40/0.61 Model 5 [ 1 0 65 ] (0.00 seconds, 250000 Inserts)
% 0.40/0.61
% 0.40/0.61 Stopped by limit on insertions
% 0.40/0.61
% 0.40/0.61 Model 6 [ 1 1 73 ] (0.00 seconds, 250000 Inserts)
% 0.40/0.61
% 0.40/0.61 ----> UNIT CONFLICT at 0.22 sec ----> 16 [binary,15.1,5.1] {-} $F.
% 0.40/0.61
% 0.40/0.61 Length of proof is 3. Level of proof is 3.
% 0.40/0.61
% 0.40/0.61 ---------------- PROOF ----------------
% 0.40/0.61 % SZS status Theorem
% 0.40/0.61 % SZS output start Refutation
% 0.40/0.61
% 0.40/0.61 1 [] {+} -food(A)|likes($c5,A).
% 0.40/0.61 2 [] {+} -eats(A,B)| -not_killed_by(A,B)|food(B).
% 0.40/0.61 4 [] {+} -alive(A)|not_killed_by(A,B).
% 0.40/0.61 5 [] {+} -likes($c5,$c6).
% 0.40/0.61 8 [] {+} eats($c4,$c6).
% 0.40/0.61 9 [] {+} alive($c4).
% 0.40/0.61 11 [hyper,9,4] {+} not_killed_by($c4,A).
% 0.40/0.61 14 [hyper,11,2,8] {-} food($c6).
% 0.40/0.61 15 [hyper,14,1] {-} likes($c5,$c6).
% 0.40/0.61 16 [binary,15.1,5.1] {-} $F.
% 0.40/0.61
% 0.40/0.61 % SZS output end Refutation
% 0.40/0.61 ------------ end of proof -------------
% 0.40/0.61
% 0.40/0.61
% 0.40/0.61 Search stopped by max_proofs option.
% 0.40/0.61
% 0.40/0.61
% 0.40/0.61 Search stopped by max_proofs option.
% 0.40/0.61
% 0.40/0.61 ============ end of search ============
% 0.40/0.61
% 0.40/0.61 ----------- soft-scott stats ----------
% 0.40/0.61
% 0.40/0.61 true clauses given 1 (14.3%)
% 0.40/0.61 false clauses given 6
% 0.40/0.61
% 0.40/0.61 FALSE TRUE
% 0.40/0.61 3 1 1
% 0.40/0.61 tot: 1 1 (50.0% true)
% 0.40/0.61
% 0.40/0.61
% 0.40/0.61 Model 6 [ 1 -5 73 ] (0.00 seconds, 250000 Inserts)
% 0.40/0.61
% 0.40/0.61 That finishes the proof of the theorem.
% 0.40/0.61
% 0.40/0.61 Process 11806 finished Sun May 29 00:55:27 2022
%------------------------------------------------------------------------------