TSTP Solution File: SYN078+1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : SYN078+1 : TPTP v8.1.0. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n015.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 : Thu Jul 21 12:09:52 EDT 2022
% Result : Theorem 0.13s 0.35s
% Output : Refutation 0.13s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.08 % Problem : SYN078+1 : TPTP v8.1.0. Released v2.0.0.
% 0.00/0.08 % Command : sos-script %s
% 0.08/0.28 % Computer : n015.cluster.edu
% 0.08/0.28 % Model : x86_64 x86_64
% 0.08/0.28 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.28 % Memory : 8042.1875MB
% 0.08/0.28 % OS : Linux 3.10.0-693.el7.x86_64
% 0.08/0.28 % CPULimit : 300
% 0.08/0.28 % WCLimit : 600
% 0.08/0.28 % DateTime : Mon Jul 11 12:23:54 EDT 2022
% 0.13/0.28 % CPUTime :
% 0.13/0.29 ----- Otter 3.2, August 2001 -----
% 0.13/0.29 The process was started by sandbox2 on n015.cluster.edu,
% 0.13/0.29 Mon Jul 11 12:23:54 2022
% 0.13/0.29 The command was "./sos". The process ID is 31400.
% 0.13/0.29
% 0.13/0.29 set(prolog_style_variables).
% 0.13/0.29 set(auto).
% 0.13/0.29 dependent: set(auto1).
% 0.13/0.29 dependent: set(process_input).
% 0.13/0.29 dependent: clear(print_kept).
% 0.13/0.29 dependent: clear(print_new_demod).
% 0.13/0.29 dependent: clear(print_back_demod).
% 0.13/0.29 dependent: clear(print_back_sub).
% 0.13/0.29 dependent: set(control_memory).
% 0.13/0.29 dependent: assign(max_mem, 12000).
% 0.13/0.29 dependent: assign(pick_given_ratio, 4).
% 0.13/0.29 dependent: assign(stats_level, 1).
% 0.13/0.29 dependent: assign(pick_semantic_ratio, 3).
% 0.13/0.29 dependent: assign(sos_limit, 5000).
% 0.13/0.29 dependent: assign(max_weight, 60).
% 0.13/0.29 clear(print_given).
% 0.13/0.29
% 0.13/0.29 formula_list(usable).
% 0.13/0.29
% 0.13/0.29 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=5.
% 0.13/0.29
% 0.13/0.29 This ia a non-Horn set with equality. The strategy will be
% 0.13/0.29 Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.13/0.29 unit deletion, with positive clauses in sos and nonpositive
% 0.13/0.29 clauses in usable.
% 0.13/0.29
% 0.13/0.29 dependent: set(knuth_bendix).
% 0.13/0.29 dependent: set(para_from).
% 0.13/0.29 dependent: set(para_into).
% 0.13/0.29 dependent: clear(para_from_right).
% 0.13/0.29 dependent: clear(para_into_right).
% 0.13/0.29 dependent: set(para_from_vars).
% 0.13/0.29 dependent: set(eq_units_both_ways).
% 0.13/0.29 dependent: set(dynamic_demod_all).
% 0.13/0.29 dependent: set(dynamic_demod).
% 0.13/0.29 dependent: set(order_eq).
% 0.13/0.29 dependent: set(back_demod).
% 0.13/0.29 dependent: set(lrpo).
% 0.13/0.29 dependent: set(hyper_res).
% 0.13/0.29 dependent: set(unit_deletion).
% 0.13/0.29 dependent: set(factor).
% 0.13/0.29
% 0.13/0.29 ------------> process usable:
% 0.13/0.29
% 0.13/0.29 ------------> process sos:
% 0.13/0.29 Following clause subsumed by 13 during input processing: 0 [copy,13,flip.1] {-} A=A.
% 0.13/0.29
% 0.13/0.29 ======= end of input processing =======
% 0.13/0.32
% 0.13/0.32 Model 1 (0.00 seconds, 0 Inserts)
% 0.13/0.32
% 0.13/0.32 Stopped by limit on number of solutions
% 0.13/0.32
% 0.13/0.32
% 0.13/0.32 -------------- Softie stats --------------
% 0.13/0.32
% 0.13/0.32 UPDATE_STOP: 300
% 0.13/0.32 SFINDER_TIME_LIMIT: 2
% 0.13/0.32 SHORT_CLAUSE_CUTOFF: 4
% 0.13/0.32 number of clauses in intial UL: 8
% 0.13/0.32 number of clauses initially in problem: 11
% 0.13/0.32 percentage of clauses intially in UL: 72
% 0.13/0.32 percentage of distinct symbols occuring in initial UL: 100
% 0.13/0.32 percent of all initial clauses that are short: 100
% 0.13/0.32 absolute distinct symbol count: 6
% 0.13/0.32 distinct predicate count: 2
% 0.13/0.32 distinct function count: 1
% 0.13/0.32 distinct constant count: 3
% 0.13/0.32
% 0.13/0.32 ---------- no more Softie stats ----------
% 0.13/0.32
% 0.13/0.32
% 0.13/0.32
% 0.13/0.32 Model 2 (0.00 seconds, 0 Inserts)
% 0.13/0.32
% 0.13/0.32 Stopped by limit on number of solutions
% 0.13/0.32
% 0.13/0.32 =========== start of search ===========
% 0.13/0.35
% 0.13/0.35 -------- PROOF --------
% 0.13/0.35 % SZS status Theorem
% 0.13/0.35 % SZS output start Refutation
% 0.13/0.35
% 0.13/0.35 Model 3 [ 4 0 280 ] (0.00 seconds, 791 Inserts)
% 0.13/0.35
% 0.13/0.35 Model 4 [ 4 1 338 ] (0.00 seconds, 697 Inserts)
% 0.13/0.35
% 0.13/0.35 -----> EMPTY CLAUSE at 0.04 sec ----> 30 [hyper,28,6,21] {-} $F.
% 0.13/0.35
% 0.13/0.35 Length of proof is 11. Level of proof is 8.
% 0.13/0.35
% 0.13/0.35 ---------------- PROOF ----------------
% 0.13/0.35 % SZS status Theorem
% 0.13/0.35 % SZS output start Refutation
% 0.13/0.35
% 0.13/0.35 1 [] {+} -big_p(A)|B!=f(A)|big_p(B)| -big_p(C)|big_p(f(C)).
% 0.13/0.35 2 [] {+} big_p($c1)| -big_p(f($c3)).
% 0.13/0.35 3 [] {-} $c2=f($c1)| -big_p(f($c3)).
% 0.13/0.35 4 [copy,3,flip.1] {+} f($c1)=$c2| -big_p(f($c3)).
% 0.13/0.35 5 [] {+} -big_p($c2)|big_p($c3).
% 0.13/0.35 6 [] {+} -big_p($c2)| -big_p(f($c3)).
% 0.13/0.35 7 [factor,1.1.4] {+} -big_p(A)|B!=f(A)|big_p(B)|big_p(f(A)).
% 0.13/0.35 9 [factor,7.3.4] {+} -big_p(A)|f(A)!=f(A)|big_p(f(A)).
% 0.13/0.35 10 [] {+} big_p($c1)|big_p($c3).
% 0.13/0.35 11 [] {-} $c2=f($c1)|big_p($c3).
% 0.13/0.35 12 [copy,11,flip.1] {-} f($c1)=$c2|big_p($c3).
% 0.13/0.35 13 [] {+} A=A.
% 0.13/0.35 17 [para_from,12.1.1,9.3.1,unit_del,13] {-} -big_p($c1)|big_p($c2)|big_p($c3).
% 0.13/0.35 19 [hyper,17,10,factor_simp] {-} big_p($c2)|big_p($c3).
% 0.13/0.35 20 [hyper,19,5,factor_simp] {-} big_p($c3).
% 0.13/0.35 21 [hyper,13,9,20] {-} big_p(f($c3)).
% 0.13/0.35 24,23 [hyper,21,4] {+} f($c1)=$c2.
% 0.13/0.35 25 [hyper,21,2] {+} big_p($c1).
% 0.13/0.35 28 [para_from,23.1.1,9.3.1,demod,24,24,unit_del,25,13] {-} big_p($c2).
% 0.13/0.35 30 [hyper,28,6,21] {-} $F.
% 0.13/0.35
% 0.13/0.35 % SZS output end Refutation
% 0.13/0.35 ------------ end of proof -------------
% 0.13/0.35
% 0.13/0.35
% 0.13/0.35 Search stopped by max_proofs option.
% 0.13/0.35
% 0.13/0.35
% 0.13/0.35 Search stopped by max_proofs option.
% 0.13/0.35
% 0.13/0.35 ============ end of search ============
% 0.13/0.35
% 0.13/0.35 ----------- soft-scott stats ----------
% 0.13/0.35
% 0.13/0.35 true clauses given 1 (10.0%)
% 0.13/0.35 false clauses given 9
% 0.13/0.35
% 0.13/0.35 FALSE TRUE
% 0.13/0.35 4 1 0
% 0.13/0.35 tot: 1 0 (0.0% true)
% 0.13/0.35
% 0.13/0.35
% 0.13/0.35 Model 4 [ 4 0 338 ] (0.00 seconds, 697 Inserts)
% 0.13/0.35
% 0.13/0.35 That finishes the proof of the theorem.
% 0.13/0.35
% 0.13/0.35 Process 31400 finished Mon Jul 11 12:23:54 2022
%------------------------------------------------------------------------------