TSTP Solution File: PHI012+1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : PHI012+1 : TPTP v8.1.0. Released v7.2.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 16:48:49 EDT 2022
% Result : Theorem 0.71s 0.89s
% Output : Refutation 0.71s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.13 % Problem : PHI012+1 : TPTP v8.1.0. Released v7.2.0.
% 0.11/0.13 % Command : sos-script %s
% 0.13/0.34 % Computer : n021.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Thu Jun 2 01:32:16 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.13/0.36 ----- Otter 3.2, August 2001 -----
% 0.13/0.36 The process was started by sandbox on n021.cluster.edu,
% 0.13/0.36 Thu Jun 2 01:32:16 2022
% 0.13/0.36 The command was "./sos". The process ID is 10804.
% 0.13/0.36
% 0.13/0.36 set(prolog_style_variables).
% 0.13/0.36 set(auto).
% 0.13/0.36 dependent: set(auto1).
% 0.13/0.36 dependent: set(process_input).
% 0.13/0.36 dependent: clear(print_kept).
% 0.13/0.36 dependent: clear(print_new_demod).
% 0.13/0.36 dependent: clear(print_back_demod).
% 0.13/0.36 dependent: clear(print_back_sub).
% 0.13/0.36 dependent: set(control_memory).
% 0.13/0.36 dependent: assign(max_mem, 12000).
% 0.13/0.36 dependent: assign(pick_given_ratio, 4).
% 0.13/0.36 dependent: assign(stats_level, 1).
% 0.13/0.36 dependent: assign(pick_semantic_ratio, 3).
% 0.13/0.36 dependent: assign(sos_limit, 5000).
% 0.13/0.36 dependent: assign(max_weight, 60).
% 0.13/0.36 clear(print_given).
% 0.13/0.36
% 0.13/0.36 formula_list(usable).
% 0.13/0.36
% 0.13/0.36 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=5.
% 0.13/0.36
% 0.13/0.36 This ia a non-Horn set with equality. The strategy will be
% 0.13/0.36 Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.13/0.36 unit deletion, with positive clauses in sos and nonpositive
% 0.13/0.36 clauses in usable.
% 0.13/0.36
% 0.13/0.36 dependent: set(knuth_bendix).
% 0.13/0.36 dependent: set(para_from).
% 0.13/0.36 dependent: set(para_into).
% 0.13/0.36 dependent: clear(para_from_right).
% 0.13/0.36 dependent: clear(para_into_right).
% 0.13/0.36 dependent: set(para_from_vars).
% 0.13/0.36 dependent: set(eq_units_both_ways).
% 0.13/0.36 dependent: set(dynamic_demod_all).
% 0.13/0.36 dependent: set(dynamic_demod).
% 0.13/0.36 dependent: set(order_eq).
% 0.13/0.36 dependent: set(back_demod).
% 0.13/0.36 dependent: set(lrpo).
% 0.13/0.36 dependent: set(hyper_res).
% 0.13/0.36 dependent: set(unit_deletion).
% 0.13/0.36 dependent: set(factor).
% 0.13/0.36
% 0.13/0.36 ------------> process usable:
% 0.13/0.36
% 0.13/0.36 ------------> process sos:
% 0.13/0.36 Following clause subsumed by 14 during input processing: 0 [copy,14,flip.1] {-} A=A.
% 0.13/0.36 14 back subsumes 11.
% 0.13/0.36
% 0.13/0.36 ======= end of input processing =======
% 0.13/0.40
% 0.13/0.40 Model 1 (0.00 seconds, 0 Inserts)
% 0.13/0.40
% 0.13/0.40 Stopped by limit on number of solutions
% 0.13/0.40
% 0.13/0.40
% 0.13/0.40 -------------- Softie stats --------------
% 0.13/0.40
% 0.13/0.40 UPDATE_STOP: 300
% 0.13/0.40 SFINDER_TIME_LIMIT: 2
% 0.13/0.40 SHORT_CLAUSE_CUTOFF: 4
% 0.13/0.40 number of clauses in intial UL: 10
% 0.13/0.40 number of clauses initially in problem: 13
% 0.13/0.40 percentage of clauses intially in UL: 76
% 0.13/0.40 percentage of distinct symbols occuring in initial UL: 90
% 0.13/0.40 percent of all initial clauses that are short: 100
% 0.13/0.40 absolute distinct symbol count: 10
% 0.13/0.40 distinct predicate count: 4
% 0.13/0.40 distinct function count: 2
% 0.13/0.40 distinct constant count: 4
% 0.13/0.40
% 0.13/0.40 ---------- no more Softie stats ----------
% 0.13/0.40
% 0.13/0.40
% 0.13/0.40
% 0.13/0.40 Model 2 (0.00 seconds, 0 Inserts)
% 0.13/0.40
% 0.13/0.40 Stopped by limit on number of solutions
% 0.13/0.40
% 0.13/0.40 =========== start of search ===========
% 0.71/0.89
% 0.71/0.89 -------- PROOF --------
% 0.71/0.89 % SZS status Theorem
% 0.71/0.89 % SZS output start Refutation
% 0.71/0.89
% 0.71/0.89 Stopped by limit on insertions
% 0.71/0.89
% 0.71/0.89 Model 3 [ 1 1 65 ] (0.00 seconds, 250000 Inserts)
% 0.71/0.89
% 0.71/0.89 Stopped by limit on insertions
% 0.71/0.89
% 0.71/0.89 Stopped by limit on insertions
% 0.71/0.89
% 0.71/0.89 Model 4 [ 1 1 139 ] (0.00 seconds, 250000 Inserts)
% 0.71/0.89
% 0.71/0.89 Stopped by limit on insertions
% 0.71/0.89
% 0.71/0.89 Model 5 [ 2 1 80 ] (0.00 seconds, 250000 Inserts)
% 0.71/0.89
% 0.71/0.89 Stopped by limit on insertions
% 0.71/0.89
% 0.71/0.89 Model 6 [ 2 0 65 ] (0.00 seconds, 250000 Inserts)
% 0.71/0.89
% 0.71/0.89 -----> EMPTY CLAUSE at 0.49 sec ----> 110 [hyper,108,2,12,13,16,26] {-} $F.
% 0.71/0.89
% 0.71/0.89 Length of proof is 7. Level of proof is 4.
% 0.71/0.89
% 0.71/0.89 ---------------- PROOF ----------------
% 0.71/0.89 % SZS status Theorem
% 0.71/0.89 % SZS output start Refutation
% 0.71/0.89
% 0.71/0.89 1 [] {+} -object(A)| -exemplifies_property(none_greater,A)|exemplifies_property(conceivable,A).
% 0.71/0.89 2 [] {+} -object(A)| -exemplifies_property(none_greater,A)| -object(B)| -exemplifies_relation(greater_than,B,A)| -exemplifies_property(conceivable,B).
% 0.71/0.89 6 [] {+} -object(A)| -object(B)|exemplifies_relation(greater_than,A,B)|exemplifies_relation(greater_than,B,A)|A=B.
% 0.71/0.89 7 [] {+} -object(A)| -exemplifies_property(none_greater,A)|object($f2(A)).
% 0.71/0.89 8 [] {+} -object(A)| -exemplifies_property(none_greater,A)|exemplifies_property(none_greater,$f2(A)).
% 0.71/0.89 9 [] {+} -object(A)| -exemplifies_property(none_greater,A)|$f2(A)!=A.
% 0.71/0.89 12 [] {+} object($c1).
% 0.71/0.89 13 [] {+} exemplifies_property(none_greater,$c1).
% 0.71/0.89 15 [hyper,13,8,12] {+} exemplifies_property(none_greater,$f2($c1)).
% 0.71/0.89 16 [hyper,13,7,12] {-} object($f2($c1)).
% 0.71/0.89 17 [hyper,13,1,12] {+} exemplifies_property(conceivable,$c1).
% 0.71/0.89 20 [hyper,16,6,12,flip.3] {-} exemplifies_relation(greater_than,$c1,$f2($c1))|exemplifies_relation(greater_than,$f2($c1),$c1)|$f2($c1)=$c1.
% 0.71/0.89 26 [hyper,15,1,16] {+} exemplifies_property(conceivable,$f2($c1)).
% 0.71/0.89 103 [hyper,20,9,12,13] {-} exemplifies_relation(greater_than,$c1,$f2($c1))|exemplifies_relation(greater_than,$f2($c1),$c1).
% 0.71/0.89 108 [hyper,103,2,16,15,12,17] {+} exemplifies_relation(greater_than,$f2($c1),$c1).
% 0.71/0.89 110 [hyper,108,2,12,13,16,26] {-} $F.
% 0.71/0.89
% 0.71/0.89 % SZS output end Refutation
% 0.71/0.89 ------------ end of proof -------------
% 0.71/0.89
% 0.71/0.89
% 0.71/0.89 Search stopped by max_proofs option.
% 0.71/0.89
% 0.71/0.89
% 0.71/0.89 Search stopped by max_proofs option.
% 0.71/0.89
% 0.71/0.89 ============ end of search ============
% 0.71/0.89
% 0.71/0.89 ----------- soft-scott stats ----------
% 0.71/0.89
% 0.71/0.89 true clauses given 4 (21.1%)
% 0.71/0.89 false clauses given 15
% 0.71/0.89
% 0.71/0.89 FALSE TRUE
% 0.71/0.89 5 1 0
% 0.71/0.89 6 0 1
% 0.71/0.89 13 0 1
% 0.71/0.89 14 0 3
% 0.71/0.89 15 3 4
% 0.71/0.89 16 1 4
% 0.71/0.89 17 1 5
% 0.71/0.89 20 0 3
% 0.71/0.89 23 0 31
% 0.71/0.89 25 0 17
% 0.71/0.89 26 1 0
% 0.71/0.89 27 0 2
% 0.71/0.89 tot: 7 71 (91.0% true)
% 0.71/0.89
% 0.71/0.89
% 0.71/0.89 Model 6 [ 2 0 65 ] (0.00 seconds, 250000 Inserts)
% 0.71/0.89
% 0.71/0.89 That finishes the proof of the theorem.
% 0.71/0.89
% 0.71/0.89 Process 10804 finished Thu Jun 2 01:32:16 2022
%------------------------------------------------------------------------------