TSTP Solution File: PUZ001-1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : PUZ001-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 18:26:56 EDT 2022
% Result : Unsatisfiable 0.20s 0.57s
% Output : Refutation 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : PUZ001-1 : TPTP v8.1.0. Released v1.0.0.
% 0.07/0.12 % 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.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Sat May 28 22:18:57 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 Sat May 28 22:18:57 2022
% 0.13/0.35 The command was "./sos". The process ID is 17603.
% 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 list(usable).
% 0.13/0.35
% 0.13/0.35 SCAN INPUT: prop=0, horn=0, equality=0, symmetry=0, max_lits=3.
% 0.13/0.35
% 0.13/0.35 This is a non-Horn set without equality. The strategy
% 0.13/0.35 will be ordered hyper_res, ur_res, unit deletion, and
% 0.13/0.35 factoring, with satellites in sos and nuclei in usable.
% 0.13/0.35
% 0.13/0.35 dependent: set(hyper_res).
% 0.13/0.35 dependent: set(factor).
% 0.13/0.35 dependent: set(unit_deletion).
% 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.20/0.41
% 0.20/0.41 Model 1 (0.00 seconds, 0 Inserts)
% 0.20/0.41
% 0.20/0.41 Stopped by limit on number of solutions
% 0.20/0.41
% 0.20/0.41
% 0.20/0.41 -------------- Softie stats --------------
% 0.20/0.41
% 0.20/0.41 UPDATE_STOP: 300
% 0.20/0.41 SFINDER_TIME_LIMIT: 2
% 0.20/0.41 SHORT_CLAUSE_CUTOFF: 4
% 0.20/0.41 number of clauses in intial UL: 6
% 0.20/0.41 number of clauses initially in problem: 12
% 0.20/0.41 percentage of clauses intially in UL: 50
% 0.20/0.41 percentage of distinct symbols occuring in initial UL: 100
% 0.20/0.41 percent of all initial clauses that are short: 100
% 0.20/0.41 absolute distinct symbol count: 7
% 0.20/0.41 distinct predicate count: 4
% 0.20/0.41 distinct function count: 0
% 0.20/0.41 distinct constant count: 3
% 0.20/0.41
% 0.20/0.41 ---------- no more Softie stats ----------
% 0.20/0.41
% 0.20/0.41
% 0.20/0.41
% 0.20/0.41 Model 2 (0.00 seconds, 0 Inserts)
% 0.20/0.41
% 0.20/0.41 Stopped by limit on number of solutions
% 0.20/0.41
% 0.20/0.41 =========== start of search ===========
% 0.20/0.57
% 0.20/0.57 -------- PROOF --------
% 0.20/0.57 % SZS status Unsatisfiable
% 0.20/0.57 % SZS output start Refutation
% 0.20/0.57
% 0.20/0.57 Model 3 (0.00 seconds, 0 Inserts)
% 0.20/0.57
% 0.20/0.57 Stopped by limit on number of solutions
% 0.20/0.57
% 0.20/0.57 Model 4 (0.00 seconds, 0 Inserts)
% 0.20/0.57
% 0.20/0.57 Stopped by limit on number of solutions
% 0.20/0.57
% 0.20/0.57 Model 5 (0.00 seconds, 0 Inserts)
% 0.20/0.57
% 0.20/0.57 Stopped by limit on number of solutions
% 0.20/0.57
% 0.20/0.57 Model 6 (0.00 seconds, 0 Inserts)
% 0.20/0.57
% 0.20/0.57 Stopped by limit on number of solutions
% 0.20/0.57
% 0.20/0.57 Stopped by limit on insertions
% 0.20/0.57
% 0.20/0.57 Model 7 [ 1 0 331 ] (0.00 seconds, 250000 Inserts)
% 0.20/0.57
% 0.20/0.57 -----> EMPTY CLAUSE at 0.17 sec ----> 23 [hyper,21,2,10] {-} $F.
% 0.20/0.57
% 0.20/0.57 Length of proof is 6. Level of proof is 3.
% 0.20/0.57
% 0.20/0.57 ---------------- PROOF ----------------
% 0.20/0.57 % SZS status Unsatisfiable
% 0.20/0.57 % SZS output start Refutation
% 0.20/0.57
% 0.20/0.57 1 [] {+} -killed(A,B)| -richer(A,B).
% 0.20/0.57 2 [] {+} -hates(agatha,A)| -hates(charles,A).
% 0.20/0.57 3 [] {+} -hates(A,agatha)| -hates(A,butler)| -hates(A,charles).
% 0.20/0.57 4 [] {+} -killed(A,B)|hates(A,B).
% 0.20/0.57 5 [] {+} -hates(agatha,A)|hates(butler,A).
% 0.20/0.57 6 [] {+} -lives(A)|richer(A,agatha)|hates(butler,A).
% 0.20/0.57 8 [] {+} lives(butler).
% 0.20/0.57 10 [] {+} hates(agatha,agatha).
% 0.20/0.57 11 [] {+} hates(agatha,charles).
% 0.20/0.57 12 [] {-} killed(butler,agatha)|killed(charles,agatha).
% 0.20/0.57 14 [hyper,8,6] {+} richer(butler,agatha)|hates(butler,butler).
% 0.20/0.57 15 [hyper,10,5] {+} hates(butler,agatha).
% 0.20/0.57 17 [hyper,11,5] {+} hates(butler,charles).
% 0.20/0.57 18 [hyper,12,4] {-} killed(butler,agatha)|hates(charles,agatha).
% 0.20/0.57 19 [hyper,14,1,18] {-} hates(butler,butler)|hates(charles,agatha).
% 0.20/0.57 21 [hyper,19,3,15,17] {+} hates(charles,agatha).
% 0.20/0.57 23 [hyper,21,2,10] {-} $F.
% 0.20/0.57
% 0.20/0.57 % SZS output end Refutation
% 0.20/0.57 ------------ end of proof -------------
% 0.20/0.57
% 0.20/0.57
% 0.20/0.57 Search stopped by max_proofs option.
% 0.20/0.57
% 0.20/0.57
% 0.20/0.57 Search stopped by max_proofs option.
% 0.20/0.57
% 0.20/0.57 ============ end of search ============
% 0.20/0.57
% 0.20/0.57 ----------- soft-scott stats ----------
% 0.20/0.57
% 0.20/0.57 true clauses given 3 (25.0%)
% 0.20/0.57 false clauses given 9
% 0.20/0.57
% 0.20/0.57 FALSE TRUE
% 0.20/0.57 3 0 1
% 0.20/0.57 tot: 0 1 (100.0% true)
% 0.20/0.57
% 0.20/0.57
% 0.20/0.57 Model 7 [ 1 0 331 ] (0.00 seconds, 250000 Inserts)
% 0.20/0.57
% 0.20/0.57 That finishes the proof of the theorem.
% 0.20/0.57
% 0.20/0.57 Process 17603 finished Sat May 28 22:18:57 2022
%------------------------------------------------------------------------------