TSTP Solution File: PHI010+1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : PHI010+1 : TPTP v8.1.0. Released v7.2.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n017.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.19s 0.43s
% Output : Refutation 0.19s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : PHI010+1 : TPTP v8.1.0. Released v7.2.0.
% 0.07/0.13 % Command : sos-script %s
% 0.13/0.34 % Computer : n017.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 00:21:42 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.13/0.36 ----- Otter 3.2, August 2001 -----
% 0.13/0.36 The process was started by sandbox2 on n017.cluster.edu,
% 0.13/0.36 Thu Jun 2 00:21:42 2022
% 0.13/0.36 The command was "./sos". The process ID is 32273.
% 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=8.
% 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 46 during input processing: 0 [copy,46,flip.1] {-} A=A.
% 0.13/0.36 46 back subsumes 35.
% 0.13/0.36 46 back subsumes 33.
% 0.13/0.36 46 back subsumes 31.
% 0.13/0.36
% 0.13/0.36 ======= end of input processing =======
% 0.19/0.40
% 0.19/0.40 Model 1 (0.00 seconds, 0 Inserts)
% 0.19/0.40
% 0.19/0.40 Stopped by limit on number of solutions
% 0.19/0.40
% 0.19/0.40
% 0.19/0.40 -------------- Softie stats --------------
% 0.19/0.40
% 0.19/0.40 UPDATE_STOP: 300
% 0.19/0.40 SFINDER_TIME_LIMIT: 2
% 0.19/0.40 SHORT_CLAUSE_CUTOFF: 4
% 0.19/0.40 number of clauses in intial UL: 36
% 0.19/0.40 number of clauses initially in problem: 42
% 0.19/0.40 percentage of clauses intially in UL: 85
% 0.19/0.40 percentage of distinct symbols occuring in initial UL: 90
% 0.19/0.40 percent of all initial clauses that are short: 100
% 0.19/0.40 absolute distinct symbol count: 10
% 0.19/0.40 distinct predicate count: 5
% 0.19/0.40 distinct function count: 2
% 0.19/0.40 distinct constant count: 3
% 0.19/0.40
% 0.19/0.40 ---------- no more Softie stats ----------
% 0.19/0.40
% 0.19/0.40
% 0.19/0.40
% 0.19/0.40 Model 2 (0.00 seconds, 0 Inserts)
% 0.19/0.40
% 0.19/0.40 Stopped by limit on number of solutions
% 0.19/0.40
% 0.19/0.40 =========== start of search ===========
% 0.19/0.43
% 0.19/0.43 -------- PROOF --------
% 0.19/0.43 % SZS status Theorem
% 0.19/0.43 % SZS output start Refutation
% 0.19/0.43
% 0.19/0.43 Model 3 (0.00 seconds, 0 Inserts)
% 0.19/0.43
% 0.19/0.43 Stopped by limit on number of solutions
% 0.19/0.43
% 0.19/0.43 Model 4 (0.00 seconds, 0 Inserts)
% 0.19/0.43
% 0.19/0.43 Stopped by limit on number of solutions
% 0.19/0.43
% 0.19/0.43 ----> UNIT CONFLICT at 0.05 sec ----> 96 [binary,95.1,16.1] {+} $F.
% 0.19/0.43
% 0.19/0.43 Length of proof is 5. Level of proof is 3.
% 0.19/0.43
% 0.19/0.43 ---------------- PROOF ----------------
% 0.19/0.43 % SZS status Theorem
% 0.19/0.43 % SZS output start Refutation
% 0.19/0.43
% 0.19/0.43 7 [] {+} -property(A)| -object(B)| -object(C)| -is_the(B,A)|B!=C|exemplifies_property(A,$f1(A,B,C)).
% 0.19/0.43 9 [] {+} -property(A)| -object(B)| -object(C)| -is_the(B,A)|B!=C|$f1(A,B,C)=C.
% 0.19/0.43 16 [] {+} -exemplifies_property($c2,$c1).
% 0.19/0.43 18 [factor,7.2.3] {+} -property(A)| -object(B)| -is_the(B,A)|B!=B|exemplifies_property(A,$f1(A,B,B)).
% 0.19/0.43 21 [factor,9.2.3] {+} -property(A)| -object(B)| -is_the(B,A)|B!=B|$f1(A,B,B)=B.
% 0.19/0.43 41 [] {+} property($c2).
% 0.19/0.43 42 [] {+} object($c1).
% 0.19/0.43 43 [] {-} is_the($c3,$c2).
% 0.19/0.43 45,44 [] {+} $c3=$c1.
% 0.19/0.43 46 [] {+} A=A.
% 0.19/0.43 47 [back_demod,43,demod,45] {-} is_the($c1,$c2).
% 0.19/0.43 94,93 [hyper,46,21,41,42,47] {-} $f1($c2,$c1,$c1)=$c1.
% 0.19/0.43 95 [hyper,46,18,41,42,47,demod,94] {-} exemplifies_property($c2,$c1).
% 0.19/0.43 96 [binary,95.1,16.1] {+} $F.
% 0.19/0.43
% 0.19/0.43 % SZS output end Refutation
% 0.19/0.43 ------------ end of proof -------------
% 0.19/0.43
% 0.19/0.43
% 0.19/0.43 Search stopped by max_proofs option.
% 0.19/0.43
% 0.19/0.43
% 0.19/0.43 Search stopped by max_proofs option.
% 0.19/0.43
% 0.19/0.43 ============ end of search ============
% 0.19/0.43
% 0.19/0.43 ----------- soft-scott stats ----------
% 0.19/0.43
% 0.19/0.43 true clauses given 1 (20.0%)
% 0.19/0.43 false clauses given 4
% 0.19/0.43
% 0.19/0.43 FALSE TRUE
% 0.19/0.43 15 0 2
% 0.19/0.43 16 0 5
% 0.19/0.43 17 0 6
% 0.19/0.43 18 0 4
% 0.19/0.43 19 0 2
% 0.19/0.43 20 0 3
% 0.19/0.43 21 0 9
% 0.19/0.43 22 0 8
% 0.19/0.43 23 0 4
% 0.19/0.43 24 0 2
% 0.19/0.43 tot: 0 45 (100.0% true)
% 0.19/0.43
% 0.19/0.43
% 0.19/0.43 Model 4 (0.00 seconds, 0 Inserts)
% 0.19/0.43
% 0.19/0.43 That finishes the proof of the theorem.
% 0.19/0.43
% 0.19/0.43 Process 32273 finished Thu Jun 2 00:21:42 2022
%------------------------------------------------------------------------------