TSTP Solution File: PUZ129+2 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : PUZ129+2 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n020.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.86s 1.07s
% Output : Refutation 0.86s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.14 % Problem : PUZ129+2 : TPTP v8.1.0. Released v4.0.0.
% 0.14/0.15 % Command : sos-script %s
% 0.14/0.36 % Computer : n020.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 600
% 0.14/0.36 % DateTime : Sat May 28 21:13:54 EDT 2022
% 0.14/0.37 % CPUTime :
% 0.14/0.39 ----- Otter 3.2, August 2001 -----
% 0.14/0.39 The process was started by sandbox on n020.cluster.edu,
% 0.14/0.39 Sat May 28 21:13:54 2022
% 0.14/0.39 The command was "./sos". The process ID is 29153.
% 0.14/0.39
% 0.14/0.39 set(prolog_style_variables).
% 0.14/0.39 set(auto).
% 0.14/0.39 dependent: set(auto1).
% 0.14/0.39 dependent: set(process_input).
% 0.14/0.39 dependent: clear(print_kept).
% 0.14/0.39 dependent: clear(print_new_demod).
% 0.14/0.39 dependent: clear(print_back_demod).
% 0.14/0.39 dependent: clear(print_back_sub).
% 0.14/0.39 dependent: set(control_memory).
% 0.14/0.39 dependent: assign(max_mem, 12000).
% 0.14/0.39 dependent: assign(pick_given_ratio, 4).
% 0.14/0.39 dependent: assign(stats_level, 1).
% 0.14/0.39 dependent: assign(pick_semantic_ratio, 3).
% 0.14/0.39 dependent: assign(sos_limit, 5000).
% 0.14/0.39 dependent: assign(max_weight, 60).
% 0.14/0.39 clear(print_given).
% 0.14/0.39
% 0.14/0.39 formula_list(usable).
% 0.14/0.39
% 0.14/0.39 SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=4.
% 0.14/0.39
% 0.14/0.39 This is a Horn set with equality. The strategy will be
% 0.14/0.39 Knuth-Bendix and hyper_res, with positive clauses in
% 0.14/0.39 sos and nonpositive clauses in usable.
% 0.14/0.39
% 0.14/0.39 dependent: set(knuth_bendix).
% 0.14/0.39 dependent: set(para_from).
% 0.14/0.39 dependent: set(para_into).
% 0.14/0.39 dependent: clear(para_from_right).
% 0.14/0.39 dependent: clear(para_into_right).
% 0.14/0.39 dependent: set(para_from_vars).
% 0.14/0.39 dependent: set(eq_units_both_ways).
% 0.14/0.39 dependent: set(dynamic_demod_all).
% 0.14/0.39 dependent: set(dynamic_demod).
% 0.14/0.39 dependent: set(order_eq).
% 0.14/0.39 dependent: set(back_demod).
% 0.14/0.39 dependent: set(lrpo).
% 0.14/0.39 dependent: set(hyper_res).
% 0.14/0.39 dependent: clear(order_hyper).
% 0.14/0.39
% 0.14/0.39 ------------> process usable:
% 0.14/0.39
% 0.14/0.39 ------------> process sos:
% 0.14/0.39 Following clause subsumed by 26 during input processing: 0 [copy,26,flip.1] {-} A=A.
% 0.14/0.39
% 0.14/0.39 ======= end of input processing =======
% 0.40/0.57
% 0.40/0.57 Model 1 (0.00 seconds, 0 Inserts)
% 0.40/0.57
% 0.40/0.57 Stopped by limit on number of solutions
% 0.40/0.57
% 0.40/0.57
% 0.40/0.57 -------------- Softie stats --------------
% 0.40/0.57
% 0.40/0.57 UPDATE_STOP: 300
% 0.40/0.57 SFINDER_TIME_LIMIT: 2
% 0.40/0.57 SHORT_CLAUSE_CUTOFF: 4
% 0.40/0.57 number of clauses in intial UL: 15
% 0.40/0.57 number of clauses initially in problem: 20
% 0.40/0.57 percentage of clauses intially in UL: 75
% 0.40/0.57 percentage of distinct symbols occuring in initial UL: 89
% 0.40/0.57 percent of all initial clauses that are short: 100
% 0.40/0.57 absolute distinct symbol count: 19
% 0.40/0.57 distinct predicate count: 5
% 0.40/0.57 distinct function count: 6
% 0.40/0.57 distinct constant count: 8
% 0.40/0.57
% 0.40/0.57 ---------- no more Softie stats ----------
% 0.40/0.57
% 0.40/0.57
% 0.40/0.57
% 0.40/0.57 Stopped by limit on insertions
% 0.40/0.57
% 0.40/0.57 =========== start of search ===========
% 0.86/1.07
% 0.86/1.07 -------- PROOF --------
% 0.86/1.07 % SZS status Theorem
% 0.86/1.07 % SZS output start Refutation
% 0.86/1.07
% 0.86/1.07 Stopped by limit on insertions
% 0.86/1.07
% 0.86/1.07 Stopped by limit on insertions
% 0.86/1.07
% 0.86/1.07 Model 2 [ 1 0 194 ] (0.00 seconds, 250000 Inserts)
% 0.86/1.07
% 0.86/1.07 Stopped by limit on insertions
% 0.86/1.07
% 0.86/1.07 Model 3 [ 1 0 95 ] (0.00 seconds, 250000 Inserts)
% 0.86/1.07
% 0.86/1.07 Stopped by limit on insertions
% 0.86/1.07
% 0.86/1.07 Model 4 [ 1 1 116 ] (0.00 seconds, 250000 Inserts)
% 0.86/1.07
% 0.86/1.07 Stopped by limit on insertions
% 0.86/1.07
% 0.86/1.07 Model 5 [ 1 0 199 ] (0.00 seconds, 250000 Inserts)
% 0.86/1.07
% 0.86/1.07 Stopped by limit on insertions
% 0.86/1.07
% 0.86/1.07 Model 6 [ 1 0 366 ] (0.00 seconds, 250000 Inserts)
% 0.86/1.07
% 0.86/1.07 -----> EMPTY CLAUSE at 0.66 sec ----> 42 [hyper,41,4,27,26] {-} $F.
% 0.86/1.07
% 0.86/1.07 Length of proof is 13. Level of proof is 7.
% 0.86/1.07
% 0.86/1.07 ---------------- PROOF ----------------
% 0.86/1.07 % SZS status Theorem
% 0.86/1.07 % SZS output start Refutation
% 0.86/1.07
% 0.86/1.07 1 [] {+} -person(A)| -property1(A,honest,pos)| -property1(A,industrious,pos)|property1($f1(A),healthy,pos).
% 0.86/1.07 2 [] {-} -person(A)| -property1(A,honest,pos)| -property1(A,industrious,pos)|A=$f1(A).
% 0.86/1.07 3 [copy,2,flip.4] {+} -person(A)| -property1(A,honest,pos)| -property1(A,industrious,pos)|$f1(A)=A.
% 0.86/1.07 4 [] {+} -grocer(A)| -property1(B,healthy,pos)|A!=B.
% 0.86/1.07 5 [] {+} -grocer(A)| -property1(A,industrious,pos)|property1($f2(A),honest,pos).
% 0.86/1.07 6 [] {-} -grocer(A)| -property1(A,industrious,pos)|A=$f2(A).
% 0.86/1.07 7 [copy,6,flip.3] {+} -grocer(A)| -property1(A,industrious,pos)|$f2(A)=A.
% 0.86/1.07 8 [] {+} -cyclist(A)|property1($f3(A),industrious,pos).
% 0.86/1.07 9 [] {-} -cyclist(A)|A=$f3(A).
% 0.86/1.07 10 [copy,9,flip.2] {+} -cyclist(A)|$f3(A)=A.
% 0.86/1.07 19 [] {+} -cyclist(A)|person($f6(A)).
% 0.86/1.07 20 [] {-} -cyclist(A)|A=$f6(A).
% 0.86/1.07 21 [copy,20,flip.2] {+} -cyclist(A)|$f6(A)=A.
% 0.86/1.07 22 [] {-} grocer($c2).
% 0.86/1.07 23 [] {-} cyclist($c1).
% 0.86/1.07 25,24 [] {+} $c2=$c1.
% 0.86/1.07 26 [] {+} A=A.
% 0.86/1.07 27 [back_demod,22,demod,25] {-} grocer($c1).
% 0.86/1.07 29,28 [hyper,23,21] {+} $f6($c1)=$c1.
% 0.86/1.07 30 [hyper,23,19,demod,29] {+} person($c1).
% 0.86/1.07 32,31 [hyper,23,10] {+} $f3($c1)=$c1.
% 0.86/1.07 33 [hyper,23,8,demod,32] {+} property1($c1,industrious,pos).
% 0.86/1.07 37,36 [hyper,33,7,27] {+} $f2($c1)=$c1.
% 0.86/1.07 38 [hyper,33,5,27,demod,37] {+} property1($c1,honest,pos).
% 0.86/1.07 40,39 [hyper,38,3,30,33] {+} $f1($c1)=$c1.
% 0.86/1.07 41 [hyper,38,1,30,33,demod,40] {+} property1($c1,healthy,pos).
% 0.86/1.07 42 [hyper,41,4,27,26] {-} $F.
% 0.86/1.07
% 0.86/1.07 % SZS output end Refutation
% 0.86/1.07 ------------ end of proof -------------
% 0.86/1.07
% 0.86/1.07
% 0.86/1.07 Search stopped by max_proofs option.
% 0.86/1.07
% 0.86/1.07
% 0.86/1.07 Search stopped by max_proofs option.
% 0.86/1.07
% 0.86/1.07 ============ end of search ============
% 0.86/1.07
% 0.86/1.07 ----------- soft-scott stats ----------
% 0.86/1.07
% 0.86/1.07 true clauses given 6 (46.2%)
% 0.86/1.07 false clauses given 7
% 0.86/1.07
% 0.86/1.07 FALSE TRUE
% 0.86/1.07 tot: 0 0 (-nan% true)
% 0.86/1.07
% 0.86/1.07
% 0.86/1.07 Model 6 [ 1 0 366 ] (0.00 seconds, 250000 Inserts)
% 0.86/1.07
% 0.86/1.07 That finishes the proof of the theorem.
% 0.86/1.07
% 0.86/1.07 Process 29153 finished Sat May 28 21:13:55 2022
%------------------------------------------------------------------------------