TSTP Solution File: SYN072-1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : SYN072-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n010.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:48 EDT 2022
% Result : Unsatisfiable 0.19s 0.41s
% Output : Refutation 0.19s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : SYN072-1 : TPTP v8.1.0. Released v1.0.0.
% 0.06/0.13 % Command : sos-script %s
% 0.13/0.34 % Computer : n010.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 : Tue Jul 12 04:01:15 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.13/0.35 ----- Otter 3.2, August 2001 -----
% 0.13/0.35 The process was started by sandbox2 on n010.cluster.edu,
% 0.13/0.35 Tue Jul 12 04:01:15 2022
% 0.13/0.35 The command was "./sos". The process ID is 18540.
% 0.13/0.35
% 0.13/0.35 set(prolog_style_variables).
% 0.13/0.35 set(auto).
% 0.13/0.35 dependent: set(auto1).
% 0.13/0.35 dependent: set(process_input).
% 0.13/0.35 dependent: clear(print_kept).
% 0.13/0.35 dependent: clear(print_new_demod).
% 0.13/0.35 dependent: clear(print_back_demod).
% 0.13/0.35 dependent: clear(print_back_sub).
% 0.13/0.35 dependent: set(control_memory).
% 0.13/0.35 dependent: assign(max_mem, 12000).
% 0.13/0.35 dependent: assign(pick_given_ratio, 4).
% 0.13/0.35 dependent: assign(stats_level, 1).
% 0.13/0.35 dependent: assign(pick_semantic_ratio, 3).
% 0.13/0.35 dependent: assign(sos_limit, 5000).
% 0.13/0.35 dependent: assign(max_weight, 60).
% 0.13/0.35 clear(print_given).
% 0.13/0.35
% 0.13/0.35 list(usable).
% 0.13/0.35
% 0.13/0.35 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=2.
% 0.13/0.35
% 0.13/0.35 This ia a non-Horn set with equality. The strategy will be
% 0.13/0.35 Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.13/0.35 unit deletion, with positive clauses in sos and nonpositive
% 0.13/0.35 clauses in usable.
% 0.13/0.35
% 0.13/0.35 dependent: set(knuth_bendix).
% 0.13/0.35 dependent: set(para_from).
% 0.13/0.35 dependent: set(para_into).
% 0.13/0.35 dependent: clear(para_from_right).
% 0.13/0.35 dependent: clear(para_into_right).
% 0.13/0.35 dependent: set(para_from_vars).
% 0.13/0.35 dependent: set(eq_units_both_ways).
% 0.13/0.35 dependent: set(dynamic_demod_all).
% 0.13/0.35 dependent: set(dynamic_demod).
% 0.13/0.35 dependent: set(order_eq).
% 0.13/0.35 dependent: set(back_demod).
% 0.13/0.35 dependent: set(lrpo).
% 0.13/0.35 dependent: set(hyper_res).
% 0.13/0.35 dependent: set(unit_deletion).
% 0.13/0.35 dependent: set(factor).
% 0.13/0.35
% 0.13/0.35 ------------> process usable:
% 0.13/0.35
% 0.13/0.35 ------------> process sos:
% 0.13/0.35 Following clause subsumed by 7 during input processing: 0 [copy,7,flip.1] {-} A=A.
% 0.13/0.35
% 0.13/0.35 ======= end of input processing =======
% 0.13/0.39
% 0.13/0.39 Model 1 (0.00 seconds, 0 Inserts)
% 0.13/0.39
% 0.13/0.39 Stopped by limit on number of solutions
% 0.13/0.39
% 0.13/0.39
% 0.13/0.39 -------------- Softie stats --------------
% 0.13/0.39
% 0.13/0.39 UPDATE_STOP: 300
% 0.13/0.39 SFINDER_TIME_LIMIT: 2
% 0.13/0.39 SHORT_CLAUSE_CUTOFF: 4
% 0.13/0.39 number of clauses in intial UL: 2
% 0.13/0.39 number of clauses initially in problem: 6
% 0.13/0.39 percentage of clauses intially in UL: 33
% 0.13/0.39 percentage of distinct symbols occuring in initial UL: 71
% 0.13/0.39 percent of all initial clauses that are short: 100
% 0.13/0.39 absolute distinct symbol count: 7
% 0.13/0.39 distinct predicate count: 2
% 0.13/0.39 distinct function count: 0
% 0.13/0.39 distinct constant count: 5
% 0.13/0.39
% 0.13/0.39 ---------- no more Softie stats ----------
% 0.13/0.39
% 0.13/0.39
% 0.13/0.39
% 0.13/0.39 =========== start of search ===========
% 0.19/0.41
% 0.19/0.41 -------- PROOF --------
% 0.19/0.41 % SZS status Unsatisfiable
% 0.19/0.41 % SZS output start Refutation
% 0.19/0.41
% 0.19/0.41 Model 2 [ 1 1 23 ] (0.00 seconds, 297 Inserts)
% 0.19/0.41
% 0.19/0.41 Model 3 [ 1 0 19 ] (0.00 seconds, 162 Inserts)
% 0.19/0.41
% 0.19/0.41 Model 4 [ 1 1 66 ] (0.00 seconds, 120 Inserts)
% 0.19/0.41
% 0.19/0.41 Model 5 [ 1 0 49 ] (0.00 seconds, 92 Inserts)
% 0.19/0.41
% 0.19/0.41 -----> EMPTY CLAUSE at 0.03 sec ----> 39 [back_demod,28,demod,36,38,34,34,unit_del,2,7] {-} $F.
% 0.19/0.41
% 0.19/0.41 Length of proof is 15. Level of proof is 5.
% 0.19/0.41
% 0.19/0.41 ---------------- PROOF ----------------
% 0.19/0.41 % SZS status Unsatisfiable
% 0.19/0.41 % SZS output start Refutation
% 0.19/0.41
% 0.19/0.41 1 [] {-} a!=b.
% 0.19/0.41 2 [copy,1,flip.1] {+} b!=a.
% 0.19/0.41 3 [] {+} -big_p(e).
% 0.19/0.41 4 [] {-} A=c|A=d.
% 0.19/0.41 5 [] {+} big_p(a).
% 0.19/0.41 6 [] {+} big_p(b).
% 0.19/0.41 7 [] {+} A=A.
% 0.19/0.41 8 [para_from,4.1.1,3.1.1] {+} -big_p(c)|e=d.
% 0.19/0.41 9 [para_from,4.1.1,2.1.1,flip.2] {+} c!=a|d=b.
% 0.19/0.41 10 [para_from,4.2.1,3.1.1] {+} -big_p(d)|e=c.
% 0.19/0.41 12 [para_into,5.1.1,4.2.1,flip.2] {-} big_p(d)|c=a.
% 0.19/0.41 13 [para_into,5.1.1,4.1.1,flip.2] {+} big_p(c)|d=a.
% 0.19/0.41 15 [para_into,6.1.1,4.1.1,flip.2] {-} big_p(c)|d=b.
% 0.19/0.41 18 [hyper,10,12] {-} e=c|c=a.
% 0.19/0.41 23 [para_from,18.1.1,3.1.1] {+} -big_p(c)|c=a.
% 0.19/0.41 28 [para_from,9.2.1,10.1.1,unit_del,6] {-} e=c|c!=a.
% 0.19/0.41 29 [para_from,23.2.1,9.1.1,unit_del,7] {+} d=b| -big_p(c).
% 0.19/0.41 32 [para_into,15.2.1,13.2.1,unit_del,2,factor_simp] {+} big_p(c).
% 0.19/0.41 34,33 [hyper,32,23] {-} c=a.
% 0.19/0.41 36,35 [hyper,32,8] {-} e=d.
% 0.19/0.41 38,37 [back_demod,29,demod,34,unit_del,5] {-} d=b.
% 0.19/0.41 39 [back_demod,28,demod,36,38,34,34,unit_del,2,7] {-} $F.
% 0.19/0.41
% 0.19/0.41 % SZS output end Refutation
% 0.19/0.41 ------------ end of proof -------------
% 0.19/0.41
% 0.19/0.41
% 0.19/0.41 Search stopped by max_proofs option.
% 0.19/0.41
% 0.19/0.41
% 0.19/0.41 Search stopped by max_proofs option.
% 0.19/0.41
% 0.19/0.41 ============ end of search ============
% 0.19/0.41
% 0.19/0.41 ----------- soft-scott stats ----------
% 0.19/0.41
% 0.19/0.41 true clauses given 6 (42.9%)
% 0.19/0.41 false clauses given 8
% 0.19/0.41
% 0.19/0.41 FALSE TRUE
% 0.19/0.41 5 1 4
% 0.19/0.41 6 2 5
% 0.19/0.41 tot: 3 9 (75.0% true)
% 0.19/0.41
% 0.19/0.41
% 0.19/0.41 Model 5 [ 1 0 49 ] (0.00 seconds, 92 Inserts)
% 0.19/0.41
% 0.19/0.41 That finishes the proof of the theorem.
% 0.19/0.41
% 0.19/0.41 Process 18540 finished Tue Jul 12 04:01:15 2022
%------------------------------------------------------------------------------