TSTP Solution File: PUZ130+1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : PUZ130+1 : TPTP v8.1.0. Released v4.1.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 : Mon Jul 18 18:27:09 EDT 2022
% Result : Theorem 0.60s 0.81s
% Output : Refutation 0.60s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : PUZ130+1 : TPTP v8.1.0. Released v4.1.0.
% 0.03/0.12 % Command : sos-script %s
% 0.12/0.33 % Computer : n018.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 : Sat May 28 22:55:25 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.19/0.35 ----- Otter 3.2, August 2001 -----
% 0.19/0.35 The process was started by sandbox2 on n018.cluster.edu,
% 0.19/0.35 Sat May 28 22:55:25 2022
% 0.19/0.35 The command was "./sos". The process ID is 25842.
% 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 formula_list(usable).
% 0.19/0.35
% 0.19/0.35 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=4.
% 0.19/0.35
% 0.19/0.35 This ia a non-Horn set with equality. The strategy will be
% 0.19/0.35 Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.19/0.35 unit deletion, with positive clauses in sos and nonpositive
% 0.19/0.35 clauses in usable.
% 0.19/0.35
% 0.19/0.35 dependent: set(knuth_bendix).
% 0.19/0.35 dependent: set(para_from).
% 0.19/0.35 dependent: set(para_into).
% 0.19/0.35 dependent: clear(para_from_right).
% 0.19/0.35 dependent: clear(para_into_right).
% 0.19/0.35 dependent: set(para_from_vars).
% 0.19/0.35 dependent: set(eq_units_both_ways).
% 0.19/0.35 dependent: set(dynamic_demod_all).
% 0.19/0.35 dependent: set(dynamic_demod).
% 0.19/0.35 dependent: set(order_eq).
% 0.19/0.35 dependent: set(back_demod).
% 0.19/0.35 dependent: set(lrpo).
% 0.19/0.35 dependent: set(hyper_res).
% 0.19/0.35 dependent: set(unit_deletion).
% 0.19/0.35 dependent: set(factor).
% 0.19/0.35
% 0.19/0.35 ------------> process usable:
% 0.19/0.35
% 0.19/0.35 ------------> process sos:
% 0.19/0.35 Following clause subsumed by 24 during input processing: 0 [copy,24,flip.1] {-} A=A.
% 0.19/0.35
% 0.19/0.35 ======= end of input processing =======
% 0.19/0.38
% 0.19/0.38 Model 1 (0.00 seconds, 0 Inserts)
% 0.19/0.38
% 0.19/0.38 Stopped by limit on number of solutions
% 0.19/0.38
% 0.19/0.38
% 0.19/0.38 -------------- Softie stats --------------
% 0.19/0.38
% 0.19/0.38 UPDATE_STOP: 300
% 0.19/0.38 SFINDER_TIME_LIMIT: 2
% 0.19/0.38 SHORT_CLAUSE_CUTOFF: 4
% 0.19/0.38 number of clauses in intial UL: 11
% 0.19/0.38 number of clauses initially in problem: 24
% 0.19/0.38 percentage of clauses intially in UL: 45
% 0.19/0.38 percentage of distinct symbols occuring in initial UL: 78
% 0.19/0.38 percent of all initial clauses that are short: 100
% 0.19/0.38 absolute distinct symbol count: 19
% 0.19/0.38 distinct predicate count: 8
% 0.19/0.38 distinct function count: 4
% 0.19/0.38 distinct constant count: 7
% 0.19/0.38
% 0.19/0.38 ---------- no more Softie stats ----------
% 0.19/0.38
% 0.19/0.38
% 0.19/0.38
% 0.19/0.38 Model 2 (0.00 seconds, 0 Inserts)
% 0.19/0.38
% 0.19/0.38 Stopped by limit on number of solutions
% 0.19/0.38
% 0.19/0.38 =========== start of search ===========
% 0.60/0.81
% 0.60/0.81 -------- PROOF --------
% 0.60/0.81 % SZS status Theorem
% 0.60/0.81 % SZS output start Refutation
% 0.60/0.81
% 0.60/0.81 Model 3 (0.00 seconds, 0 Inserts)
% 0.60/0.81
% 0.60/0.81 Stopped by limit on number of solutions
% 0.60/0.81
% 0.60/0.81 Model 4 (0.00 seconds, 0 Inserts)
% 0.60/0.81
% 0.60/0.81 Stopped by limit on number of solutions
% 0.60/0.81
% 0.60/0.81 Model 5 (0.00 seconds, 0 Inserts)
% 0.60/0.81
% 0.60/0.81 Stopped by limit on number of solutions
% 0.60/0.81
% 0.60/0.81 Model 6 (0.00 seconds, 0 Inserts)
% 0.60/0.81
% 0.60/0.81 Stopped by limit on number of solutions
% 0.60/0.81
% 0.60/0.81 Model 7 (0.00 seconds, 0 Inserts)
% 0.60/0.81
% 0.60/0.81 Stopped by limit on number of solutions
% 0.60/0.81
% 0.60/0.81 Stopped by limit on insertions
% 0.60/0.81
% 0.60/0.81 Model 8 [ 1 1 812 ] (0.00 seconds, 250000 Inserts)
% 0.60/0.81
% 0.60/0.81 Model 9 (0.00 seconds, 250000 Inserts)
% 0.60/0.81
% 0.60/0.81 Stopped by limit on number of solutions
% 0.60/0.81
% 0.60/0.81 Stopped by limit on insertions
% 0.60/0.81
% 0.60/0.81 Model 10 [ 1 0 434 ] (0.00 seconds, 250000 Inserts)
% 0.60/0.81
% 0.60/0.81 Stopped by limit on insertions
% 0.60/0.81
% 0.60/0.81 Model 11 [ 2 1 428 ] (0.00 seconds, 250000 Inserts)
% 0.60/0.81
% 0.60/0.81 Stopped by limit on insertions
% 0.60/0.81
% 0.60/0.81 Model 12 [ 3 0 701 ] (0.00 seconds, 250000 Inserts)
% 0.60/0.81
% 0.60/0.81 Stopped by limit on insertions
% 0.60/0.81
% 0.60/0.81 Model 13 [ 2 0 291 ] (0.00 seconds, 250000 Inserts)
% 0.60/0.81
% 0.60/0.81 ----> UNIT CONFLICT at 0.45 sec ----> 147 [binary,146.1,11.1] {-} $F.
% 0.60/0.81
% 0.60/0.81 Length of proof is 7. Level of proof is 4.
% 0.60/0.81
% 0.60/0.81 ---------------- PROOF ----------------
% 0.60/0.81 % SZS status Theorem
% 0.60/0.81 % SZS output start Refutation
% 0.60/0.81
% 0.60/0.81 1 [] {+} -dog(A)|pet(A).
% 0.60/0.81 2 [] {+} -cat(A)|pet(A).
% 0.60/0.81 8 [] {+} -cat(A)| -dog(B)| -chased(B,A)|hates(owner_of(A),owner_of(B)).
% 0.60/0.81 9 [] {+} -human(A)| -pet(B)| -owner(A,B)|A=owner_of(B).
% 0.60/0.81 11 [] {+} -hates(jon,jon).
% 0.60/0.81 13 [] {+} cat(garfield).
% 0.60/0.81 15 [] {+} dog(odie).
% 0.60/0.81 18 [] {+} human(jon).
% 0.60/0.81 19 [] {+} owner(jon,odie).
% 0.60/0.81 20 [] {+} owner(jon,garfield).
% 0.60/0.81 23 [] {+} chased(odie,garfield).
% 0.60/0.81 28 [hyper,13,2] {+} pet(garfield).
% 0.60/0.81 31 [hyper,15,1] {+} pet(odie).
% 0.60/0.81 53 [hyper,23,8,13,15] {+} hates(owner_of(garfield),owner_of(odie)).
% 0.60/0.81 84,83 [hyper,28,9,18,20,flip.1] {-} owner_of(garfield)=jon.
% 0.60/0.81 87 [back_demod,53,demod,84] {-} hates(jon,owner_of(odie)).
% 0.60/0.81 133,132 [hyper,31,9,18,19,flip.1] {-} owner_of(odie)=jon.
% 0.60/0.81 146 [back_demod,87,demod,133] {-} hates(jon,jon).
% 0.60/0.81 147 [binary,146.1,11.1] {-} $F.
% 0.60/0.81
% 0.60/0.81 % SZS output end Refutation
% 0.60/0.81 ------------ end of proof -------------
% 0.60/0.81
% 0.60/0.81
% 0.60/0.81 Search stopped by max_proofs option.
% 0.60/0.81
% 0.60/0.81
% 0.60/0.81 Search stopped by max_proofs option.
% 0.60/0.81
% 0.60/0.81 ============ end of search ============
% 0.60/0.81
% 0.60/0.81 ----------- soft-scott stats ----------
% 0.60/0.81
% 0.60/0.81 true clauses given 5 (29.4%)
% 0.60/0.81 false clauses given 12
% 0.60/0.81
% 0.60/0.81 FALSE TRUE
% 0.60/0.81 2 0 1
% 0.60/0.81 3 0 7
% 0.60/0.81 4 0 4
% 0.60/0.81 5 0 8
% 0.60/0.81 6 0 19
% 0.60/0.81 7 0 15
% 0.60/0.81 8 0 9
% 0.60/0.81 9 0 6
% 0.60/0.81 10 0 14
% 0.60/0.81 11 0 5
% 0.60/0.81 12 0 2
% 0.60/0.81 13 0 1
% 0.60/0.81 15 0 6
% 0.60/0.81 tot: 0 97 (100.0% true)
% 0.60/0.81
% 0.60/0.81
% 0.60/0.81 Model 13 [ 2 0 291 ] (0.00 seconds, 250000 Inserts)
% 0.60/0.81
% 0.60/0.81 That finishes the proof of the theorem.
% 0.60/0.81
% 0.60/0.81 Process 25842 finished Sat May 28 22:55:25 2022
%------------------------------------------------------------------------------