TSTP Solution File: PHI014+1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : PHI014+1 : TPTP v8.1.0. Released v7.2.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n023.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:49 EDT 2022
% Result : Theorem 0.75s 0.99s
% Output : Refutation 0.75s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : PHI014+1 : TPTP v8.1.0. Released v7.2.0.
% 0.11/0.12 % Command : sos-script %s
% 0.12/0.33 % Computer : n023.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 : Thu Jun 2 01:39:56 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 n023.cluster.edu,
% 0.12/0.35 Thu Jun 2 01:39:56 2022
% 0.12/0.35 The command was "./sos". The process ID is 2585.
% 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 formula_list(usable).
% 0.12/0.35
% 0.12/0.35 SCAN INPUT: prop=0, horn=0, equality=0, symmetry=0, max_lits=6.
% 0.12/0.35
% 0.12/0.35 This is a non-Horn set without equality. The strategy
% 0.12/0.35 will be ordered hyper_res, ur_res, unit deletion, and
% 0.12/0.35 factoring, with satellites in sos and nuclei in usable.
% 0.12/0.35
% 0.12/0.35 dependent: set(hyper_res).
% 0.12/0.35 dependent: set(factor).
% 0.12/0.35 dependent: set(unit_deletion).
% 0.12/0.35
% 0.12/0.35 ------------> process usable:
% 0.12/0.35
% 0.12/0.35 ------------> process sos:
% 0.12/0.35
% 0.12/0.35 ======= end of input processing =======
% 0.18/0.50
% 0.18/0.50 Model 1 (0.00 seconds, 0 Inserts)
% 0.18/0.50
% 0.18/0.50 Stopped by limit on number of solutions
% 0.18/0.50
% 0.18/0.50
% 0.18/0.50 -------------- Softie stats --------------
% 0.18/0.50
% 0.18/0.50 UPDATE_STOP: 300
% 0.18/0.50 SFINDER_TIME_LIMIT: 2
% 0.18/0.50 SHORT_CLAUSE_CUTOFF: 4
% 0.18/0.50 number of clauses in intial UL: 13
% 0.18/0.50 number of clauses initially in problem: 14
% 0.18/0.50 percentage of clauses intially in UL: 92
% 0.18/0.50 percentage of distinct symbols occuring in initial UL: 100
% 0.18/0.50 percent of all initial clauses that are short: 100
% 0.18/0.50 absolute distinct symbol count: 12
% 0.18/0.50 distinct predicate count: 5
% 0.18/0.50 distinct function count: 2
% 0.18/0.50 distinct constant count: 5
% 0.18/0.50
% 0.18/0.50 ---------- no more Softie stats ----------
% 0.18/0.50
% 0.18/0.50
% 0.18/0.50
% 0.18/0.50 Stopped by limit on insertions
% 0.18/0.50
% 0.18/0.50 =========== start of search ===========
% 0.75/0.99
% 0.75/0.99 -------- PROOF --------
% 0.75/0.99 % SZS status Theorem
% 0.75/0.99 % SZS output start Refutation
% 0.75/0.99
% 0.75/0.99 Stopped by limit on insertions
% 0.75/0.99
% 0.75/0.99 Model 2 [ 1 0 80 ] (0.00 seconds, 250000 Inserts)
% 0.75/0.99
% 0.75/0.99 Stopped by limit on insertions
% 0.75/0.99
% 0.75/0.99 Model 3 [ 1 0 142 ] (0.00 seconds, 250000 Inserts)
% 0.75/0.99
% 0.75/0.99 Stopped by limit on insertions
% 0.75/0.99
% 0.75/0.99 Model 4 [ 1 1 1536 ] (0.00 seconds, 250000 Inserts)
% 0.75/0.99
% 0.75/0.99 Stopped by limit on insertions
% 0.75/0.99
% 0.75/0.99 Model 5 [ 3 1 183 ] (0.00 seconds, 250000 Inserts)
% 0.75/0.99
% 0.75/0.99 Stopped by limit on insertions
% 0.75/0.99
% 0.75/0.99 Model 6 [ 2 0 146 ] (0.00 seconds, 250000 Inserts)
% 0.75/0.99
% 0.75/0.99 Stopped by limit on insertions
% 0.75/0.99
% 0.75/0.99 Model 7 [ 3 0 116 ] (0.00 seconds, 250000 Inserts)
% 0.75/0.99
% 0.75/0.99 -----> EMPTY CLAUSE at 0.62 sec ----> 26 [hyper,19,6,16,21,20,18] {-} $F.
% 0.75/0.99
% 0.75/0.99 Length of proof is 7. Level of proof is 2.
% 0.75/0.99
% 0.75/0.99 ---------------- PROOF ----------------
% 0.75/0.99 % SZS status Theorem
% 0.75/0.99 % SZS output start Refutation
% 0.75/0.99
% 0.75/0.99 1 [] {-} -property(A)| -object(B)| -is_the(B,A)| -object(C)| -is_the(C,A)|exemplifies_property(A,C).
% 0.75/0.99 2 [copy,1,factor_simp,factor_simp] {+} -property(A)| -object(B)| -is_the(B,A)|exemplifies_property(A,B).
% 0.75/0.99 3 [] {+} -is_the(A,B)|property(B).
% 0.75/0.99 4 [] {+} -is_the(A,B)|object(A).
% 0.75/0.99 6 [] {+} -object(A)| -exemplifies_property(none_greater,A)| -object(B)| -exemplifies_relation(greater_than,B,A)| -exemplifies_property(conceivable,B).
% 0.75/0.99 10 [] {+} -object(A)| -is_the(A,none_greater)|exemplifies_property(existence,A)|object($f2(A)).
% 0.75/0.99 11 [] {+} -object(A)| -is_the(A,none_greater)|exemplifies_property(existence,A)|exemplifies_relation(greater_than,$f2(A),A).
% 0.75/0.99 12 [] {+} -object(A)| -is_the(A,none_greater)|exemplifies_property(existence,A)|exemplifies_property(conceivable,$f2(A)).
% 0.75/0.99 13 [] {+} -exemplifies_property(existence,god).
% 0.75/0.99 15 [] {-} is_the(god,none_greater).
% 0.75/0.99 16 [hyper,15,4] {+} object(god).
% 0.75/0.99 17 [hyper,15,3] {+} property(none_greater).
% 0.75/0.99 18 [hyper,16,12,15,unit_del,13] {+} exemplifies_property(conceivable,$f2(god)).
% 0.75/0.99 19 [hyper,16,11,15,unit_del,13] {+} exemplifies_relation(greater_than,$f2(god),god).
% 0.75/0.99 20 [hyper,16,10,15,unit_del,13] {+} object($f2(god)).
% 0.75/0.99 21 [hyper,16,2,17,15] {+} exemplifies_property(none_greater,god).
% 0.75/0.99 26 [hyper,19,6,16,21,20,18] {-} $F.
% 0.75/0.99
% 0.75/0.99 % SZS output end Refutation
% 0.75/0.99 ------------ end of proof -------------
% 0.75/0.99
% 0.75/0.99
% 0.75/0.99 Search stopped by max_proofs option.
% 0.75/0.99
% 0.75/0.99
% 0.75/0.99 Search stopped by max_proofs option.
% 0.75/0.99
% 0.75/0.99 ============ end of search ============
% 0.75/0.99
% 0.75/0.99 ----------- soft-scott stats ----------
% 0.75/0.99
% 0.75/0.99 true clauses given 1 (12.5%)
% 0.75/0.99 false clauses given 7
% 0.75/0.99
% 0.75/0.99 FALSE TRUE
% 0.75/0.99 8 1 0
% 0.75/0.99 9 0 1
% 0.75/0.99 11 0 1
% 0.75/0.99 tot: 1 2 (66.7% true)
% 0.75/0.99
% 0.75/0.99
% 0.75/0.99 Model 7 [ 3 0 116 ] (0.00 seconds, 250000 Inserts)
% 0.75/0.99
% 0.75/0.99 That finishes the proof of the theorem.
% 0.75/0.99
% 0.75/0.99 Process 2585 finished Thu Jun 2 01:39:56 2022
%------------------------------------------------------------------------------