TSTP Solution File: COM007+2 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : COM007+2 : 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.67s 0.87s
% Output : Refutation 0.67s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.11 % Problem : COM007+2 : TPTP v8.1.0. Released v3.2.0.
% 0.02/0.11 % Command : sos-script %s
% 0.11/0.32 % Computer : n005.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 300
% 0.11/0.32 % WCLimit : 600
% 0.11/0.32 % DateTime : Thu Jun 16 18:13:23 EDT 2022
% 0.11/0.32 % CPUTime :
% 0.11/0.34 ----- Otter 3.2, August 2001 -----
% 0.11/0.34 The process was started by sandbox on n005.cluster.edu,
% 0.11/0.34 Thu Jun 16 18:13:23 2022
% 0.11/0.34 The command was "./sos". The process ID is 14275.
% 0.11/0.34
% 0.11/0.34 set(prolog_style_variables).
% 0.11/0.34 set(auto).
% 0.11/0.34 dependent: set(auto1).
% 0.11/0.34 dependent: set(process_input).
% 0.11/0.34 dependent: clear(print_kept).
% 0.11/0.34 dependent: clear(print_new_demod).
% 0.11/0.34 dependent: clear(print_back_demod).
% 0.11/0.34 dependent: clear(print_back_sub).
% 0.11/0.34 dependent: set(control_memory).
% 0.11/0.34 dependent: assign(max_mem, 12000).
% 0.11/0.34 dependent: assign(pick_given_ratio, 4).
% 0.11/0.34 dependent: assign(stats_level, 1).
% 0.11/0.34 dependent: assign(pick_semantic_ratio, 3).
% 0.11/0.34 dependent: assign(sos_limit, 5000).
% 0.11/0.34 dependent: assign(max_weight, 60).
% 0.11/0.34 clear(print_given).
% 0.11/0.34
% 0.11/0.34 formula_list(usable).
% 0.11/0.34
% 0.11/0.34 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=3.
% 0.11/0.34
% 0.11/0.34 This ia a non-Horn set with equality. The strategy will be
% 0.11/0.34 Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.11/0.34 unit deletion, with positive clauses in sos and nonpositive
% 0.11/0.34 clauses in usable.
% 0.11/0.34
% 0.11/0.34 dependent: set(knuth_bendix).
% 0.11/0.34 dependent: set(para_from).
% 0.11/0.34 dependent: set(para_into).
% 0.11/0.34 dependent: clear(para_from_right).
% 0.11/0.34 dependent: clear(para_into_right).
% 0.11/0.34 dependent: set(para_from_vars).
% 0.11/0.34 dependent: set(eq_units_both_ways).
% 0.11/0.34 dependent: set(dynamic_demod_all).
% 0.11/0.34 dependent: set(dynamic_demod).
% 0.11/0.34 dependent: set(order_eq).
% 0.11/0.34 dependent: set(back_demod).
% 0.11/0.34 dependent: set(lrpo).
% 0.11/0.34 dependent: set(hyper_res).
% 0.11/0.34 dependent: set(unit_deletion).
% 0.11/0.34 dependent: set(factor).
% 0.11/0.34
% 0.11/0.34 ------------> process usable:
% 0.11/0.34
% 0.11/0.34 ------------> process sos:
% 0.11/0.34 Following clause subsumed by 11 during input processing: 0 [copy,11,flip.1] {-} A=A.
% 0.11/0.34
% 0.11/0.34 ======= end of input processing =======
% 0.17/0.36
% 0.17/0.36 Model 1 (0.00 seconds, 0 Inserts)
% 0.17/0.36
% 0.17/0.36 Stopped by limit on number of solutions
% 0.17/0.36
% 0.17/0.36
% 0.17/0.36 -------------- Softie stats --------------
% 0.17/0.36
% 0.17/0.36 UPDATE_STOP: 300
% 0.17/0.36 SFINDER_TIME_LIMIT: 2
% 0.17/0.36 SHORT_CLAUSE_CUTOFF: 4
% 0.17/0.36 number of clauses in intial UL: 8
% 0.17/0.36 number of clauses initially in problem: 11
% 0.17/0.36 percentage of clauses intially in UL: 72
% 0.17/0.36 percentage of distinct symbols occuring in initial UL: 87
% 0.17/0.36 percent of all initial clauses that are short: 100
% 0.17/0.36 absolute distinct symbol count: 8
% 0.17/0.36 distinct predicate count: 3
% 0.17/0.36 distinct function count: 1
% 0.17/0.36 distinct constant count: 4
% 0.17/0.36
% 0.17/0.36 ---------- no more Softie stats ----------
% 0.17/0.36
% 0.17/0.36
% 0.17/0.36
% 0.17/0.36 =========== start of search ===========
% 0.67/0.87
% 0.67/0.87 -------- PROOF --------
% 0.67/0.87 % SZS status Theorem
% 0.67/0.87 % SZS output start Refutation
% 0.67/0.87
% 0.67/0.87 Model 2 (0.00 seconds, 0 Inserts)
% 0.67/0.87
% 0.67/0.87 Stopped by limit on number of solutions
% 0.67/0.87
% 0.67/0.87 Stopped by limit on insertions
% 0.67/0.87
% 0.67/0.87 Model 3 [ 1 1 65 ] (0.00 seconds, 250000 Inserts)
% 0.67/0.87
% 0.67/0.87 Stopped by limit on insertions
% 0.67/0.87
% 0.67/0.87 Model 4 [ 1 0 181 ] (0.00 seconds, 250000 Inserts)
% 0.67/0.87
% 0.67/0.87 Stopped by limit on insertions
% 0.67/0.87
% 0.67/0.87 Model 5 [ 2 0 134 ] (0.00 seconds, 250000 Inserts)
% 0.67/0.87
% 0.67/0.87 Stopped by limit on insertions
% 0.67/0.87
% 0.67/0.87 Model 6 [ 1 1 62 ] (0.00 seconds, 250000 Inserts)
% 0.67/0.87
% 0.67/0.87 Stopped by limit on insertions
% 0.67/0.87
% 0.67/0.87 Model 7 [ 3 1 64 ] (0.00 seconds, 250000 Inserts)
% 0.67/0.87
% 0.67/0.87 Stopped by limit on insertions
% 0.67/0.87
% 0.67/0.87 Model 8 [ 3 0 148 ] (0.00 seconds, 250000 Inserts)
% 0.67/0.87
% 0.67/0.87 Stopped by limit on insertions
% 0.67/0.87
% 0.67/0.87 Model 9 [ 3 0 133 ] (0.00 seconds, 250000 Inserts)
% 0.67/0.87
% 0.67/0.87 ----> UNIT CONFLICT at 0.50 sec ----> 241 [binary,240.1,7.1] {-} $F.
% 0.67/0.87
% 0.67/0.87 Length of proof is 12. Level of proof is 6.
% 0.67/0.87
% 0.67/0.87 ---------------- PROOF ----------------
% 0.67/0.87 % SZS status Theorem
% 0.67/0.87 % SZS output start Refutation
% 0.67/0.87
% 0.67/0.87 1 [] {+} -reflexive_rewrite(b,A)| -reflexive_rewrite(c,A)|goal.
% 0.67/0.87 2 [] {+} A!=B|reflexive_rewrite(A,B).
% 0.67/0.87 3 [] {+} -rewrite(A,B)|reflexive_rewrite(A,B).
% 0.67/0.87 4 [] {+} -reflexive_rewrite(A,B)|A=B|rewrite(A,B).
% 0.67/0.87 5 [] {+} -rewrite(A,B)| -rewrite(A,C)|rewrite(B,$f1(A,B,C)).
% 0.67/0.87 6 [] {+} -rewrite(A,B)| -rewrite(A,C)|rewrite(C,$f1(A,B,C)).
% 0.67/0.87 7 [] {+} -goal.
% 0.67/0.87 9 [] {+} reflexive_rewrite(a,b).
% 0.67/0.87 10 [] {+} reflexive_rewrite(a,c).
% 0.67/0.87 11 [] {+} A=A.
% 0.67/0.87 12 [hyper,9,4,flip.1] {+} b=a|rewrite(a,b).
% 0.67/0.87 15 [hyper,10,4,flip.1] {+} c=a|rewrite(a,c).
% 0.67/0.87 23 [para_from,12.1.1,1.1.1,unit_del,7] {-} -reflexive_rewrite(a,A)| -reflexive_rewrite(c,A)|rewrite(a,b).
% 0.67/0.87 33 [para_from,15.1.1,1.2.1,unit_del,7] {-} -reflexive_rewrite(b,A)| -reflexive_rewrite(a,A)|rewrite(a,c).
% 0.67/0.87 34 [hyper,11,2] {+} reflexive_rewrite(A,A).
% 0.67/0.87 77 [hyper,33,34,9] {+} rewrite(a,c).
% 0.67/0.87 89 [hyper,23,10,34] {+} rewrite(a,b).
% 0.67/0.87 91 [hyper,89,6,77] {-} rewrite(b,$f1(a,c,b)).
% 0.67/0.87 93 [hyper,89,5,77] {-} rewrite(c,$f1(a,c,b)).
% 0.67/0.87 119 [hyper,91,3] {+} reflexive_rewrite(b,$f1(a,c,b)).
% 0.67/0.87 147 [hyper,93,3] {-} reflexive_rewrite(c,$f1(a,c,b)).
% 0.67/0.87 240 [hyper,119,1,147] {-} goal.
% 0.67/0.87 241 [binary,240.1,7.1] {-} $F.
% 0.67/0.87
% 0.67/0.87 % SZS output end Refutation
% 0.67/0.87 ------------ end of proof -------------
% 0.67/0.87
% 0.67/0.87
% 0.67/0.87 Search stopped by max_proofs option.
% 0.67/0.87
% 0.67/0.87
% 0.67/0.87 Search stopped by max_proofs option.
% 0.67/0.87
% 0.67/0.87 ============ end of search ============
% 0.67/0.87
% 0.67/0.87 ----------- soft-scott stats ----------
% 0.67/0.87
% 0.67/0.87 true clauses given 13 (35.1%)
% 0.67/0.87 false clauses given 24
% 0.67/0.87
% 0.67/0.87 FALSE TRUE
% 0.67/0.87 6 0 1
% 0.67/0.87 9 0 4
% 0.67/0.87 12 4 32
% 0.67/0.87 15 26 22
% 0.67/0.87 18 16 14
% 0.67/0.87 21 10 9
% 0.67/0.87 tot: 56 82 (59.4% true)
% 0.67/0.87
% 0.67/0.87
% 0.67/0.87 Model 9 [ 3 0 133 ] (0.00 seconds, 250000 Inserts)
% 0.67/0.87
% 0.67/0.87 That finishes the proof of the theorem.
% 0.67/0.87
% 0.67/0.87 Process 14275 finished Thu Jun 16 18:13:24 2022
%------------------------------------------------------------------------------