TSTP Solution File: PHI009+1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : PHI009+1 : TPTP v8.1.0. Released v7.2.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n024.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 16:48:48 EDT 2022
% Result : Theorem 0.49s 0.73s
% Output : Refutation 0.49s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : PHI009+1 : TPTP v8.1.0. Released v7.2.0.
% 0.04/0.13 % Command : sos-script %s
% 0.12/0.34 % Computer : n024.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Thu Jun 2 01:26:06 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.12/0.36 ----- Otter 3.2, August 2001 -----
% 0.12/0.36 The process was started by sandbox2 on n024.cluster.edu,
% 0.12/0.36 Thu Jun 2 01:26:06 2022
% 0.12/0.36 The command was "./sos". The process ID is 2968.
% 0.12/0.36
% 0.12/0.36 set(prolog_style_variables).
% 0.12/0.36 set(auto).
% 0.12/0.36 dependent: set(auto1).
% 0.12/0.36 dependent: set(process_input).
% 0.12/0.36 dependent: clear(print_kept).
% 0.12/0.36 dependent: clear(print_new_demod).
% 0.12/0.36 dependent: clear(print_back_demod).
% 0.12/0.36 dependent: clear(print_back_sub).
% 0.12/0.36 dependent: set(control_memory).
% 0.12/0.36 dependent: assign(max_mem, 12000).
% 0.12/0.36 dependent: assign(pick_given_ratio, 4).
% 0.12/0.36 dependent: assign(stats_level, 1).
% 0.12/0.36 dependent: assign(pick_semantic_ratio, 3).
% 0.12/0.36 dependent: assign(sos_limit, 5000).
% 0.12/0.36 dependent: assign(max_weight, 60).
% 0.12/0.36 clear(print_given).
% 0.12/0.36
% 0.12/0.36 formula_list(usable).
% 0.12/0.36
% 0.12/0.36 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=8.
% 0.12/0.36
% 0.12/0.36 This ia a non-Horn set with equality. The strategy will be
% 0.12/0.36 Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.12/0.36 unit deletion, with positive clauses in sos and nonpositive
% 0.12/0.36 clauses in usable.
% 0.12/0.36
% 0.12/0.36 dependent: set(knuth_bendix).
% 0.12/0.36 dependent: set(para_from).
% 0.12/0.36 dependent: set(para_into).
% 0.12/0.36 dependent: clear(para_from_right).
% 0.12/0.36 dependent: clear(para_into_right).
% 0.12/0.36 dependent: set(para_from_vars).
% 0.12/0.36 dependent: set(eq_units_both_ways).
% 0.12/0.36 dependent: set(dynamic_demod_all).
% 0.12/0.36 dependent: set(dynamic_demod).
% 0.12/0.36 dependent: set(order_eq).
% 0.12/0.36 dependent: set(back_demod).
% 0.12/0.36 dependent: set(lrpo).
% 0.12/0.36 dependent: set(hyper_res).
% 0.12/0.36 dependent: set(unit_deletion).
% 0.12/0.36 dependent: set(factor).
% 0.12/0.36
% 0.12/0.36 ------------> process usable:
% 0.12/0.36
% 0.12/0.36 ------------> process sos:
% 0.12/0.36 Following clause subsumed by 33 during input processing: 0 [copy,33,flip.1] {-} A=A.
% 0.12/0.36
% 0.12/0.36 ======= 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: 29
% 0.20/0.41 number of clauses initially in problem: 33
% 0.20/0.41 percentage of clauses intially in UL: 87
% 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: 96
% 0.20/0.41 absolute distinct symbol count: 9
% 0.20/0.41 distinct predicate count: 5
% 0.20/0.41 distinct function count: 2
% 0.20/0.41 distinct constant count: 2
% 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.49/0.73
% 0.49/0.73 -------- PROOF --------
% 0.49/0.73 % SZS status Theorem
% 0.49/0.73 % SZS output start Refutation
% 0.49/0.73
% 0.49/0.73 Model 3 (0.00 seconds, 0 Inserts)
% 0.49/0.73
% 0.49/0.73 Stopped by limit on number of solutions
% 0.49/0.73
% 0.49/0.73 Stopped by limit on insertions
% 0.49/0.73
% 0.49/0.73 Model 4 [ 1 1 372 ] (0.00 seconds, 250000 Inserts)
% 0.49/0.73
% 0.49/0.73 Stopped by limit on insertions
% 0.49/0.73
% 0.49/0.73 Model 5 [ 1 1 1603 ] (0.00 seconds, 250000 Inserts)
% 0.49/0.73
% 0.49/0.73 Stopped by limit on insertions
% 0.49/0.73
% 0.49/0.73 Model 6 [ 1 0 526 ] (0.00 seconds, 250000 Inserts)
% 0.49/0.73
% 0.49/0.73 -----> EMPTY CLAUSE at 0.33 sec ----> 197 [hyper,160,12,31] {-} $F.
% 0.49/0.73
% 0.49/0.73 Length of proof is 11. Level of proof is 6.
% 0.49/0.73
% 0.49/0.73 ---------------- PROOF ----------------
% 0.49/0.73 % SZS status Theorem
% 0.49/0.73 % SZS output start Refutation
% 0.49/0.73
% 0.49/0.73 5 [] {+} -property(A)| -property(B)| -object(C)|is_the(C,A)| -object(D)| -exemplifies_property(A,D)|object($f2(A,B,C,D))| -exemplifies_property(B,D).
% 0.49/0.73 6 [] {+} -property(A)| -property(B)| -object(C)|is_the(C,A)| -object(D)| -exemplifies_property(A,D)|exemplifies_property(A,$f2(A,B,C,D))| -exemplifies_property(B,D).
% 0.49/0.73 7 [] {+} -property(A)| -property(B)| -object(C)|is_the(C,A)| -object(D)| -exemplifies_property(A,D)|$f2(A,B,C,D)!=D| -exemplifies_property(B,D).
% 0.49/0.73 11 [] {+} -object(A)| -exemplifies_property($c2,A)|A=$c1.
% 0.49/0.73 12 [] {+} -object(A)| -is_the(A,$c2).
% 0.49/0.73 18 [factor,5.1.2,factor_simp] {+} -property(A)| -object(B)|is_the(B,A)| -object(C)| -exemplifies_property(A,C)|object($f2(A,A,B,C)).
% 0.49/0.73 20 [factor,6.1.2,factor_simp] {+} -property(A)| -object(B)|is_the(B,A)| -object(C)| -exemplifies_property(A,C)|exemplifies_property(A,$f2(A,A,B,C)).
% 0.49/0.73 22 [factor,7.1.2,factor_simp] {+} -property(A)| -object(B)|is_the(B,A)| -object(C)| -exemplifies_property(A,C)|$f2(A,A,B,C)!=C.
% 0.49/0.73 27 [factor,18.2.4] {+} -property(A)| -object(B)|is_the(B,A)| -exemplifies_property(A,B)|object($f2(A,A,B,B)).
% 0.49/0.73 28 [factor,20.2.4] {+} -property(A)| -object(B)|is_the(B,A)| -exemplifies_property(A,B)|exemplifies_property(A,$f2(A,A,B,B)).
% 0.49/0.73 29 [factor,22.2.4] {+} -property(A)| -object(B)|is_the(B,A)| -exemplifies_property(A,B)|$f2(A,A,B,B)!=B.
% 0.49/0.73 30 [] {+} property($c2).
% 0.49/0.73 31 [] {+} object($c1).
% 0.49/0.73 32 [] {+} exemplifies_property($c2,$c1).
% 0.49/0.73 33 [] {+} A=A.
% 0.49/0.73 47 [hyper,31,28,30,32] {-} is_the($c1,$c2)|exemplifies_property($c2,$f2($c2,$c2,$c1,$c1)).
% 0.49/0.73 48 [hyper,31,27,30,32] {-} is_the($c1,$c2)|object($f2($c2,$c2,$c1,$c1)).
% 0.49/0.73 52 [hyper,47,12,31] {+} exemplifies_property($c2,$f2($c2,$c2,$c1,$c1)).
% 0.49/0.73 118 [hyper,48,11,52] {+} is_the($c1,$c2)|$f2($c2,$c2,$c1,$c1)=$c1.
% 0.49/0.73 160 [para_from,118.2.1,29.5.1,unit_del,30,31,32,33,factor_simp] {-} is_the($c1,$c2).
% 0.49/0.73 197 [hyper,160,12,31] {-} $F.
% 0.49/0.73
% 0.49/0.73 % SZS output end Refutation
% 0.49/0.73 ------------ end of proof -------------
% 0.49/0.73
% 0.49/0.73
% 0.49/0.73 Search stopped by max_proofs option.
% 0.49/0.73
% 0.49/0.73
% 0.49/0.73 Search stopped by max_proofs option.
% 0.49/0.73
% 0.49/0.73 ============ end of search ============
% 0.49/0.73
% 0.49/0.73 ----------- soft-scott stats ----------
% 0.49/0.73
% 0.49/0.73 true clauses given 4 (33.3%)
% 0.49/0.73 false clauses given 8
% 0.49/0.73
% 0.49/0.73 FALSE TRUE
% 0.49/0.73 7 1 0
% 0.49/0.73 8 0 1
% 0.49/0.73 10 0 1
% 0.49/0.73 12 0 4
% 0.49/0.73 13 1 2
% 0.49/0.73 14 0 3
% 0.49/0.73 15 0 1
% 0.49/0.73 16 0 1
% 0.49/0.73 17 0 1
% 0.49/0.73 18 0 6
% 0.49/0.73 19 0 2
% 0.49/0.73 20 0 6
% 0.49/0.73 21 0 4
% 0.49/0.73 22 0 2
% 0.49/0.73 23 0 9
% 0.49/0.73 24 0 1
% 0.49/0.73 25 0 13
% 0.49/0.73 26 0 1
% 0.49/0.73 27 0 6
% 0.49/0.73 29 0 2
% 0.49/0.73 31 0 10
% 0.49/0.73 32 0 1
% 0.49/0.73 33 0 3
% 0.49/0.73 34 0 2
% 0.49/0.73 36 0 15
% 0.49/0.73 37 0 1
% 0.49/0.73 38 0 8
% 0.49/0.73 40 0 1
% 0.49/0.73 41 0 1
% 0.49/0.73 42 0 3
% 0.49/0.73 44 0 1
% 0.49/0.73 tot: 2 112 (98.2% true)
% 0.49/0.73
% 0.49/0.73
% 0.49/0.73 Model 6 [ 1 0 526 ] (0.00 seconds, 250000 Inserts)
% 0.49/0.73
% 0.49/0.73 That finishes the proof of the theorem.
% 0.49/0.73
% 0.49/0.73 Process 2968 finished Thu Jun 2 01:26:06 2022
%------------------------------------------------------------------------------