TSTP Solution File: COM007+1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : COM007+1 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n005.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 : Fri Jul 15 01:43:26 EDT 2022
% Result : Theorem 0.55s 0.75s
% Output : Refutation 0.55s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : COM007+1 : TPTP v8.1.0. Released v3.2.0.
% 0.03/0.13 % Command : sos-script %s
% 0.13/0.34 % Computer : n005.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 16 19:52:08 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.19/0.35 ----- Otter 3.2, August 2001 -----
% 0.19/0.35 The process was started by sandbox on n005.cluster.edu,
% 0.19/0.35 Thu Jun 16 19:52:08 2022
% 0.19/0.35 The command was "./sos". The process ID is 23052.
% 0.19/0.35
% 0.19/0.35 set(prolog_style_variables).
% 0.19/0.35 set(auto).
% 0.19/0.35 dependent: set(auto1).
% 0.19/0.35 dependent: set(process_input).
% 0.19/0.35 dependent: clear(print_kept).
% 0.19/0.35 dependent: clear(print_new_demod).
% 0.19/0.35 dependent: clear(print_back_demod).
% 0.19/0.35 dependent: clear(print_back_sub).
% 0.19/0.35 dependent: set(control_memory).
% 0.19/0.35 dependent: assign(max_mem, 12000).
% 0.19/0.35 dependent: assign(pick_given_ratio, 4).
% 0.19/0.35 dependent: assign(stats_level, 1).
% 0.19/0.35 dependent: assign(pick_semantic_ratio, 3).
% 0.19/0.35 dependent: assign(sos_limit, 5000).
% 0.19/0.35 dependent: assign(max_weight, 60).
% 0.19/0.35 clear(print_given).
% 0.19/0.35
% 0.19/0.35 formula_list(usable).
% 0.19/0.35
% 0.19/0.35 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=1, max_lits=3.
% 0.19/0.35
% 0.19/0.35 This ia a non-Horn set with equality. The strategy will be
% 0.19/0.35 Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.19/0.35 unit deletion, with positive clauses in sos and nonpositive
% 0.19/0.35 clauses in usable.
% 0.19/0.35
% 0.19/0.35 dependent: set(knuth_bendix).
% 0.19/0.35 dependent: set(para_from).
% 0.19/0.35 dependent: set(para_into).
% 0.19/0.35 dependent: clear(para_from_right).
% 0.19/0.35 dependent: clear(para_into_right).
% 0.19/0.35 dependent: set(para_from_vars).
% 0.19/0.35 dependent: set(eq_units_both_ways).
% 0.19/0.35 dependent: set(dynamic_demod_all).
% 0.19/0.35 dependent: set(dynamic_demod).
% 0.19/0.35 dependent: set(order_eq).
% 0.19/0.35 dependent: set(back_demod).
% 0.19/0.35 dependent: set(lrpo).
% 0.19/0.35 dependent: set(hyper_res).
% 0.19/0.35 dependent: set(unit_deletion).
% 0.19/0.35 dependent: set(factor).
% 0.19/0.35
% 0.19/0.35 There is a clause for symmetry of equality, so it is
% 0.19/0.35 assumed that equality is fully axiomatized; therefore,
% 0.19/0.35 paramodulation is disabled.
% 0.19/0.35
% 0.19/0.35 dependent: clear(para_from).
% 0.19/0.35 dependent: clear(para_into).
% 0.19/0.35
% 0.19/0.35 ------------> process usable:
% 0.19/0.35
% 0.19/0.36 ------------> process sos:
% 0.19/0.36 Following clause subsumed by 13 during input processing: 0 [copy,13,flip.1] {-} equalish(A,A).
% 0.19/0.36
% 0.19/0.36 ======= end of input processing =======
% 0.19/0.38
% 0.19/0.38 Model 1 (0.00 seconds, 0 Inserts)
% 0.19/0.38
% 0.19/0.38 Stopped by limit on number of solutions
% 0.19/0.38
% 0.19/0.38
% 0.19/0.38 -------------- Softie stats --------------
% 0.19/0.38
% 0.19/0.38 UPDATE_STOP: 300
% 0.19/0.38 SFINDER_TIME_LIMIT: 2
% 0.19/0.38 SHORT_CLAUSE_CUTOFF: 4
% 0.19/0.38 number of clauses in intial UL: 10
% 0.19/0.38 number of clauses initially in problem: 13
% 0.19/0.38 percentage of clauses intially in UL: 76
% 0.19/0.38 percentage of distinct symbols occuring in initial UL: 87
% 0.19/0.38 percent of all initial clauses that are short: 100
% 0.19/0.38 absolute distinct symbol count: 8
% 0.19/0.38 distinct predicate count: 3
% 0.19/0.38 distinct function count: 1
% 0.19/0.38 distinct constant count: 4
% 0.19/0.38
% 0.19/0.38 ---------- no more Softie stats ----------
% 0.19/0.38
% 0.19/0.38
% 0.19/0.38
% 0.19/0.38 =========== start of search ===========
% 0.55/0.75
% 0.55/0.75 -------- PROOF --------
% 0.55/0.75 % SZS status Theorem
% 0.55/0.75 % SZS output start Refutation
% 0.55/0.75
% 0.55/0.75 Model 2 (0.00 seconds, 0 Inserts)
% 0.55/0.75
% 0.55/0.75 Stopped by limit on number of solutions
% 0.55/0.75
% 0.55/0.75 Model 3 (0.00 seconds, 0 Inserts)
% 0.55/0.75
% 0.55/0.75 Stopped by limit on number of solutions
% 0.55/0.75
% 0.55/0.75 Stopped by limit on insertions
% 0.55/0.75
% 0.55/0.75 Model 4 [ 2 1 67 ] (0.00 seconds, 250000 Inserts)
% 0.55/0.75
% 0.55/0.75 Stopped by limit on insertions
% 0.55/0.75
% 0.55/0.75 Model 5 [ 1 0 184 ] (0.00 seconds, 250000 Inserts)
% 0.55/0.75
% 0.55/0.75 Stopped by limit on insertions
% 0.55/0.75
% 0.55/0.75 Model 6 [ 1 0 119 ] (0.00 seconds, 250000 Inserts)
% 0.55/0.75
% 0.55/0.75 Stopped by limit on insertions
% 0.55/0.75
% 0.55/0.75 Model 7 [ 2 0 169 ] (0.00 seconds, 250000 Inserts)
% 0.55/0.75
% 0.55/0.75 -----> EMPTY CLAUSE at 0.36 sec ----> 74 [hyper,72,12,16] {-} $F.
% 0.55/0.75
% 0.55/0.75 Length of proof is 11. Level of proof is 7.
% 0.55/0.75
% 0.55/0.75 ---------------- PROOF ----------------
% 0.55/0.75 % SZS status Theorem
% 0.55/0.75 % SZS output start Refutation
% 0.55/0.75
% 0.55/0.75 1 [] {+} -reflexive_rewrite(b,A)| -reflexive_rewrite(c,A)|goal.
% 0.55/0.75 3 [] {+} -equalish(A,B)| -reflexive_rewrite(B,C)|reflexive_rewrite(A,C).
% 0.55/0.75 4 [] {+} -equalish(A,B)|reflexive_rewrite(A,B).
% 0.55/0.75 5 [] {+} -rewrite(A,B)|reflexive_rewrite(A,B).
% 0.55/0.75 6 [] {+} -reflexive_rewrite(A,B)|equalish(A,B)|rewrite(A,B).
% 0.55/0.75 7 [] {+} -rewrite(A,B)| -rewrite(A,C)|rewrite(B,$f1(A,B,C)).
% 0.55/0.75 8 [] {+} -rewrite(A,B)| -rewrite(A,C)|rewrite(C,$f1(A,B,C)).
% 0.55/0.75 9 [] {+} -goal.
% 0.55/0.75 11 [] {+} reflexive_rewrite(a,b).
% 0.55/0.75 12 [] {+} reflexive_rewrite(a,c).
% 0.55/0.75 13 [] {+} equalish(A,A).
% 0.55/0.75 14 [hyper,11,6,flip.1] {+} equalish(b,a)|rewrite(a,b).
% 0.55/0.75 15 [hyper,12,6,flip.1] {+} equalish(c,a)|rewrite(a,c).
% 0.55/0.75 16 [hyper,13,4] {+} reflexive_rewrite(A,A).
% 0.55/0.75 19 [hyper,15,8,14] {+} equalish(c,a)|rewrite(c,$f1(a,b,c))|equalish(b,a).
% 0.55/0.75 21 [hyper,15,7,14] {+} equalish(c,a)|rewrite(b,$f1(a,b,c))|equalish(b,a).
% 0.55/0.75 34 [hyper,19,5] {+} equalish(c,a)|equalish(b,a)|reflexive_rewrite(c,$f1(a,b,c)).
% 0.55/0.75 51 [hyper,21,5] {+} equalish(c,a)|equalish(b,a)|reflexive_rewrite(b,$f1(a,b,c)).
% 0.55/0.75 64 [hyper,51,1,34,unit_del,9,factor_simp,factor_simp] {+} equalish(c,a)|equalish(b,a).
% 0.55/0.75 66 [hyper,64,3,11] {+} equalish(b,a)|reflexive_rewrite(c,b).
% 0.55/0.75 71,70 [hyper,66,1,16,unit_del,9] {-} equalish(b,a).
% 0.55/0.75 72 [back_demod,1,demod,71,unit_del,9] {-} -reflexive_rewrite(a,A)| -reflexive_rewrite(c,A).
% 0.55/0.75 74 [hyper,72,12,16] {-} $F.
% 0.55/0.75
% 0.55/0.75 % SZS output end Refutation
% 0.55/0.75 ------------ end of proof -------------
% 0.55/0.75
% 0.55/0.75
% 0.55/0.75 Search stopped by max_proofs option.
% 0.55/0.75
% 0.55/0.75
% 0.55/0.75 Search stopped by max_proofs option.
% 0.55/0.75
% 0.55/0.75 ============ end of search ============
% 0.55/0.75
% 0.55/0.75 ----------- soft-scott stats ----------
% 0.55/0.75
% 0.55/0.75 true clauses given 13 (48.1%)
% 0.55/0.75 false clauses given 14
% 0.55/0.75
% 0.55/0.75 FALSE TRUE
% 0.55/0.75 6 0 4
% 0.55/0.75 9 0 1
% 0.55/0.75 12 0 8
% 0.55/0.75 18 0 1
% 0.55/0.75 21 0 28
% 0.55/0.75 39 0 1
% 0.55/0.75 tot: 0 43 (100.0% true)
% 0.55/0.75
% 0.55/0.75
% 0.55/0.75 Model 7 [ 2 0 169 ] (0.00 seconds, 250000 Inserts)
% 0.55/0.75
% 0.55/0.75 That finishes the proof of the theorem.
% 0.55/0.75
% 0.55/0.75 Process 23052 finished Thu Jun 16 19:52:09 2022
%------------------------------------------------------------------------------