%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : PLA003-1 : TPTP v8.1.0. Released v1.0.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 17:32:10 EDT 2022
% Result : Unsatisfiable 0.12s 0.37s
% Output : Refutation 0.12s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : PLA003-1 : TPTP v8.1.0. Released v1.0.0.
% 0.06/0.12 % Command : sos-script %s
% 0.12/0.33 % Computer : n021.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 May 31 20:47:00 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.12/0.35 ----- Otter 3.2, August 2001 -----
% 0.12/0.35 The process was started by sandbox2 on n021.cluster.edu,
% 0.12/0.35 Tue May 31 20:47:00 2022
% 0.12/0.35 The command was "./sos". The process ID is 27205.
% 0.12/0.35
% 0.12/0.35 set(prolog_style_variables).
% 0.12/0.35 set(auto).
% 0.12/0.35 dependent: set(auto1).
% 0.12/0.35 dependent: set(process_input).
% 0.12/0.35 dependent: clear(print_kept).
% 0.12/0.35 dependent: clear(print_new_demod).
% 0.12/0.35 dependent: clear(print_back_demod).
% 0.12/0.35 dependent: clear(print_back_sub).
% 0.12/0.35 dependent: set(control_memory).
% 0.12/0.35 dependent: assign(max_mem, 12000).
% 0.12/0.35 dependent: assign(pick_given_ratio, 4).
% 0.12/0.35 dependent: assign(stats_level, 1).
% 0.12/0.35 dependent: assign(pick_semantic_ratio, 3).
% 0.12/0.35 dependent: assign(sos_limit, 5000).
% 0.12/0.35 dependent: assign(max_weight, 60).
% 0.12/0.35 clear(print_given).
% 0.12/0.35
% 0.12/0.35 list(usable).
% 0.12/0.35
% 0.12/0.35 SCAN INPUT: prop=0, horn=1, equality=0, symmetry=0, max_lits=2.
% 0.12/0.35
% 0.12/0.35 This is a Horn set without equality. The strategy will
% 0.12/0.35 be hyperresolution, with satellites in sos and nuclei
% 0.12/0.35 in usable.
% 0.12/0.35
% 0.12/0.35 dependent: set(hyper_res).
% 0.12/0.35 dependent: clear(order_hyper).
% 0.12/0.35
% 0.12/0.35 ------------> process usable:
% 0.12/0.35 10 back subsumes 7.
% 0.12/0.35 10 back subsumes 4.
% 0.12/0.35
% 0.12/0.35 ------------> process sos:
% 0.12/0.35
% 0.12/0.35 ======= end of input processing =======
% 0.12/0.37
% 0.12/0.37 Model 1 (0.00 seconds, 0 Inserts)
% 0.12/0.37
% 0.12/0.37 Stopped by limit on number of solutions
% 0.12/0.37
% 0.12/0.37
% 0.12/0.37 -------------- Softie stats --------------
% 0.12/0.37
% 0.12/0.37 UPDATE_STOP: 300
% 0.12/0.37 SFINDER_TIME_LIMIT: 2
% 0.12/0.37 SHORT_CLAUSE_CUTOFF: 4
% 0.12/0.37 number of clauses in intial UL: 8
% 0.12/0.37 number of clauses initially in problem: 9
% 0.12/0.37 percentage of clauses intially in UL: 88
% 0.12/0.37 percentage of distinct symbols occuring in initial UL: 75
% 0.12/0.37 percent of all initial clauses that are short: 100
% 0.12/0.37 absolute distinct symbol count: 12
% 0.12/0.37 distinct predicate count: 1
% 0.12/0.37 distinct function count: 3
% 0.12/0.37 distinct constant count: 8
% 0.12/0.37
% 0.12/0.37 ---------- no more Softie stats ----------
% 0.12/0.37
% 0.12/0.37
% 0.12/0.37
% 0.12/0.37 =========== start of search ===========
% 0.12/0.37
% 0.12/0.37 -------- PROOF --------
% 0.12/0.37 % SZS status Unsatisfiable
% 0.12/0.37 % SZS output start Refutation
% 0.12/0.37
% 0.12/0.37 ----> UNIT CONFLICT at 0.01 sec ----> 20 [binary,19.1,10.1] {-} $F.
% 0.12/0.37
% 0.12/0.37 Length of proof is 6. Level of proof is 6.
% 0.12/0.37
% 0.12/0.37 ---------------- PROOF ----------------
% 0.12/0.37 % SZS status Unsatisfiable
% 0.12/0.37 % SZS output start Refutation
% 0.12/0.37
% 0.12/0.37 1 [] {+} can(monkey(A,ceiling,nothing),ladder(A,floor),B)| -can(monkey(A,floor,nothing),ladder(A,floor),B).
% 0.12/0.37 3 [] {+} can(monkey(A,floor,the_ladder),ladder(A,floor),B)| -can(monkey(C,floor,the_ladder),ladder(C,floor),B).
% 0.12/0.37 5 [] {+} can(monkey(A,floor,nothing),B,C)| -can(monkey(D,floor,nothing),B,C).
% 0.12/0.37 6 [] {+} can(monkey(A,B,nothing),ladder(A,floor),C)| -can(monkey(A,B,the_ladder),ladder(A,D),C).
% 0.12/0.37 8 [] {+} can(monkey(A,B,the_bananas),C,bananas(A,B))| -can(monkey(A,B,nothing),C,bananas(A,B)).
% 0.12/0.37 9 [] {+} can(monkey(A,B,the_ladder),ladder(A,B),C)| -can(monkey(A,B,nothing),ladder(A,B),C).
% 0.12/0.37 10 [] {+} -can(monkey(A,B,the_bananas),C,D).
% 0.12/0.37 11 [] {-} can(monkey(l0,floor,nothing),ladder(l1,floor),bananas(l2,ceiling)).
% 0.12/0.37 12 [hyper,11,5] {-} can(monkey(A,floor,nothing),ladder(l1,floor),bananas(l2,ceiling)).
% 0.12/0.37 13 [hyper,12,9] {-} can(monkey(l1,floor,the_ladder),ladder(l1,floor),bananas(l2,ceiling)).
% 0.12/0.37 15 [hyper,13,3] {-} can(monkey(A,floor,the_ladder),ladder(A,floor),bananas(l2,ceiling)).
% 0.12/0.37 16 [hyper,15,6] {-} can(monkey(A,floor,nothing),ladder(A,floor),bananas(l2,ceiling)).
% 0.12/0.37 18 [hyper,16,1] {-} can(monkey(A,ceiling,nothing),ladder(A,floor),bananas(l2,ceiling)).
% 0.12/0.37 19 [hyper,18,8] {-} can(monkey(l2,ceiling,the_bananas),ladder(l2,floor),bananas(l2,ceiling)).
% 0.12/0.37 20 [binary,19.1,10.1] {-} $F.
% 0.12/0.37
% 0.12/0.37 % SZS output end Refutation
% 0.12/0.37 ------------ end of proof -------------
% 0.12/0.37
% 0.12/0.37
% 0.12/0.37 Search stopped by max_proofs option.
% 0.12/0.37
% 0.12/0.37
% 0.12/0.37 Search stopped by max_proofs option.
% 0.12/0.37
% 0.12/0.37 ============ end of search ============
% 0.12/0.37
% 0.12/0.37 ----------- soft-scott stats ----------
% 0.12/0.37
% 0.12/0.37 true clauses given 0 (0.0%)
% 0.12/0.37 false clauses given 8
% 0.12/0.37
% 0.12/0.37 FALSE TRUE
% 0.12/0.37 tot: 0 0 (-nan% true)
% 0.12/0.37
% 0.12/0.37
% 0.12/0.37 Model 1 (0.00 seconds, 0 Inserts)
% 0.12/0.37
% 0.12/0.37 That finishes the proof of the theorem.
% 0.12/0.37
% 0.12/0.37 Process 27205 finished Tue May 31 20:47:00 2022
%------------------------------------------------------------------------------