TSTP Solution File: GRP602-1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : GRP602-1 : TPTP v8.1.0. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n006.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 : Sat Jul 16 11:43:29 EDT 2022
% Result : Unsatisfiable 0.20s 0.44s
% Output : Refutation 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : GRP602-1 : TPTP v8.1.0. Released v2.6.0.
% 0.03/0.13 % Command : sos-script %s
% 0.13/0.34 % Computer : n006.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 : Mon Jun 13 22:59:41 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.20/0.35 ----- Otter 3.2, August 2001 -----
% 0.20/0.35 The process was started by sandbox on n006.cluster.edu,
% 0.20/0.35 Mon Jun 13 22:59:41 2022
% 0.20/0.35 The command was "./sos". The process ID is 17785.
% 0.20/0.35
% 0.20/0.35 set(prolog_style_variables).
% 0.20/0.35 set(auto).
% 0.20/0.35 dependent: set(auto1).
% 0.20/0.35 dependent: set(process_input).
% 0.20/0.35 dependent: clear(print_kept).
% 0.20/0.35 dependent: clear(print_new_demod).
% 0.20/0.35 dependent: clear(print_back_demod).
% 0.20/0.35 dependent: clear(print_back_sub).
% 0.20/0.35 dependent: set(control_memory).
% 0.20/0.35 dependent: assign(max_mem, 12000).
% 0.20/0.35 dependent: assign(pick_given_ratio, 4).
% 0.20/0.35 dependent: assign(stats_level, 1).
% 0.20/0.35 dependent: assign(pick_semantic_ratio, 3).
% 0.20/0.35 dependent: assign(sos_limit, 5000).
% 0.20/0.35 dependent: assign(max_weight, 60).
% 0.20/0.35 clear(print_given).
% 0.20/0.35
% 0.20/0.35 list(usable).
% 0.20/0.35
% 0.20/0.35 SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=1.
% 0.20/0.35
% 0.20/0.35 All clauses are units, and equality is present; the
% 0.20/0.35 strategy will be Knuth-Bendix with positive clauses in sos.
% 0.20/0.35
% 0.20/0.35 dependent: set(knuth_bendix).
% 0.20/0.35 dependent: set(para_from).
% 0.20/0.35 dependent: set(para_into).
% 0.20/0.35 dependent: clear(para_from_right).
% 0.20/0.35 dependent: clear(para_into_right).
% 0.20/0.35 dependent: set(para_from_vars).
% 0.20/0.35 dependent: set(eq_units_both_ways).
% 0.20/0.35 dependent: set(dynamic_demod_all).
% 0.20/0.35 dependent: set(dynamic_demod).
% 0.20/0.35 dependent: set(order_eq).
% 0.20/0.35 dependent: set(back_demod).
% 0.20/0.35 dependent: set(lrpo).
% 0.20/0.35
% 0.20/0.35 ------------> process usable:
% 0.20/0.35
% 0.20/0.35 ------------> process sos:
% 0.20/0.35 Following clause subsumed by 7 during input processing: 0 [copy,7,flip.1] {-} A=A.
% 0.20/0.35
% 0.20/0.35 ======= end of input processing =======
% 0.20/0.39
% 0.20/0.39 Model 1 (0.00 seconds, 0 Inserts)
% 0.20/0.39
% 0.20/0.39 Stopped by limit on number of solutions
% 0.20/0.39
% 0.20/0.39
% 0.20/0.39 -------------- Softie stats --------------
% 0.20/0.39
% 0.20/0.39 UPDATE_STOP: 300
% 0.20/0.39 SFINDER_TIME_LIMIT: 2
% 0.20/0.39 SHORT_CLAUSE_CUTOFF: 4
% 0.20/0.39 number of clauses in intial UL: 1
% 0.20/0.39 number of clauses initially in problem: 6
% 0.20/0.39 percentage of clauses intially in UL: 16
% 0.20/0.39 percentage of distinct symbols occuring in initial UL: 83
% 0.20/0.39 percent of all initial clauses that are short: 100
% 0.20/0.39 absolute distinct symbol count: 6
% 0.20/0.39 distinct predicate count: 1
% 0.20/0.39 distinct function count: 3
% 0.20/0.39 distinct constant count: 2
% 0.20/0.39
% 0.20/0.39 ---------- no more Softie stats ----------
% 0.20/0.39
% 0.20/0.39
% 0.20/0.39
% 0.20/0.39 Model 2 (0.00 seconds, 0 Inserts)
% 0.20/0.39
% 0.20/0.39 Stopped by limit on number of solutions
% 0.20/0.39
% 0.20/0.39 =========== start of search ===========
% 0.20/0.44
% 0.20/0.44 -------- PROOF --------
% 0.20/0.44 % SZS status Unsatisfiable
% 0.20/0.44 % SZS output start Refutation
% 0.20/0.44
% 0.20/0.44 ----> UNIT CONFLICT at 0.05 sec ----> 583 [binary,581.1,422.1] {-} $F.
% 0.20/0.44
% 0.20/0.44 Length of proof is 23. Level of proof is 13.
% 0.20/0.44
% 0.20/0.44 ---------------- PROOF ----------------
% 0.20/0.44 % SZS status Unsatisfiable
% 0.20/0.44 % SZS output start Refutation
% 0.20/0.44
% 0.20/0.44 1 [] {+} multiply(multiply(inverse(b2),b2),a2)!=a2.
% 0.20/0.44 2 [] {-} inverse(double_divide(inverse(double_divide(A,inverse(double_divide(B,double_divide(A,C))))),C))=B.
% 0.20/0.44 4 [] {-} multiply(A,B)=inverse(double_divide(B,A)).
% 0.20/0.44 6,5 [copy,4,flip.1] {+} inverse(double_divide(A,B))=multiply(B,A).
% 0.20/0.44 8 [back_demod,2,demod,6,6,6] {-} multiply(A,multiply(multiply(double_divide(B,A),C),B))=C.
% 0.20/0.44 11,10 [para_into,8.1.1.2.1,8.1.1,flip.1] {-} multiply(multiply(double_divide(A,double_divide(B,C)),D),A)=multiply(C,multiply(D,B)).
% 0.20/0.44 12 [para_from,10.1.1,8.1.1.2] {-} multiply(double_divide(A,B),multiply(B,multiply(C,A)))=C.
% 0.20/0.44 14 [para_into,12.1.1.2.2,12.1.1] {-} multiply(double_divide(multiply(A,multiply(B,C)),D),multiply(D,B))=double_divide(C,A).
% 0.20/0.44 19 [para_into,12.1.1.2,12.1.1] {-} multiply(double_divide(multiply(A,B),double_divide(B,C)),A)=C.
% 0.20/0.44 56 [para_into,19.1.1,14.1.1] {-} double_divide(A,multiply(double_divide(multiply(B,A),C),B))=C.
% 0.20/0.44 77,76 [para_into,56.1.1.2.1,56.1.1,flip.1] {-} multiply(double_divide(multiply(A,multiply(B,C)),D),A)=double_divide(C,multiply(D,B)).
% 0.20/0.44 78 [para_into,56.1.1.2,14.1.1] {-} double_divide(multiply(A,B),double_divide(B,multiply(C,A)))=C.
% 0.20/0.44 86 [para_from,56.1.1,5.1.1.1] {-} inverse(A)=multiply(multiply(double_divide(multiply(B,C),A),B),C).
% 0.20/0.44 90 [copy,86,flip.1] {-} multiply(multiply(double_divide(multiply(A,B),C),A),B)=inverse(C).
% 0.20/0.44 114 [para_from,78.1.1,5.1.1.1] {-} inverse(A)=multiply(double_divide(B,multiply(A,C)),multiply(C,B)).
% 0.20/0.44 118 [copy,114,flip.1] {-} multiply(double_divide(A,multiply(B,C)),multiply(C,A))=inverse(B).
% 0.20/0.44 207 [para_from,90.1.1,12.1.1.2,demod,77] {-} multiply(double_divide(A,double_divide(A,multiply(B,C))),inverse(B))=C.
% 0.20/0.44 223 [para_from,114.1.1,1.1.1.1.1] {+} multiply(multiply(multiply(double_divide(A,multiply(b2,B)),multiply(B,A)),b2),a2)!=a2.
% 0.20/0.44 268 [para_from,118.1.1,8.1.1.2.1] {-} multiply(multiply(A,B),multiply(inverse(A),C))=multiply(B,C).
% 0.20/0.44 299 [para_from,207.1.1,56.1.1.2,flip.1] {-} double_divide(multiply(inverse(A),B),multiply(A,C))=double_divide(B,C).
% 0.20/0.44 389,388 [para_into,268.1.1.1,12.1.1,demod,6,flip.1] {-} multiply(multiply(A,multiply(B,C)),D)=multiply(B,multiply(multiply(A,C),D)).
% 0.20/0.44 422 [back_demod,223,demod,389,389] {+} multiply(multiply(double_divide(A,multiply(b2,B)),A),multiply(multiply(B,b2),a2))!=a2.
% 0.20/0.44 503 [para_from,299.1.1,78.1.1.2] {-} double_divide(multiply(A,multiply(inverse(B),C)),double_divide(C,A))=B.
% 0.20/0.44 509,508 [para_from,299.1.1,10.1.1.1.1.2,demod,11,flip.1] {-} multiply(multiply(A,B),multiply(C,multiply(inverse(A),D)))=multiply(B,multiply(C,D)).
% 0.20/0.44 543 [para_from,503.1.1,10.1.1.1.1,demod,509] {-} multiply(A,multiply(B,C))=multiply(B,multiply(A,C)).
% 0.20/0.44 581 [para_into,543.1.1,8.1.1,flip.1] {-} multiply(multiply(double_divide(A,B),C),multiply(B,A))=C.
% 0.20/0.44 583 [binary,581.1,422.1] {-} $F.
% 0.20/0.44
% 0.20/0.44 % SZS output end Refutation
% 0.20/0.44 ------------ end of proof -------------
% 0.20/0.44
% 0.20/0.44
% 0.20/0.44 Search stopped by max_proofs option.
% 0.20/0.44
% 0.20/0.44
% 0.20/0.44 Search stopped by max_proofs option.
% 0.20/0.44
% 0.20/0.44 ============ end of search ============
% 0.20/0.44
% 0.20/0.44 ----------- soft-scott stats ----------
% 0.20/0.44
% 0.20/0.44 true clauses given 1 (5.0%)
% 0.20/0.44 false clauses given 19
% 0.20/0.44
% 0.20/0.44 FALSE TRUE
% 0.20/0.44 11 1 0
% 0.20/0.44 12 4 0
% 0.20/0.44 13 3 0
% 0.20/0.44 15 42 3
% 0.20/0.44 16 75 0
% 0.20/0.44 17 32 0
% 0.20/0.44 19 78 0
% 0.20/0.44 20 49 0
% 0.20/0.44 23 57 0
% 0.20/0.44 24 16 0
% 0.20/0.44 27 16 0
% 0.20/0.44 31 2 0
% 0.20/0.44 tot: 375 3 (0.8% true)
% 0.20/0.44
% 0.20/0.44
% 0.20/0.44 Model 2 (0.00 seconds, 0 Inserts)
% 0.20/0.44
% 0.20/0.44 That finishes the proof of the theorem.
% 0.20/0.44
% 0.20/0.44 Process 17785 finished Mon Jun 13 22:59:41 2022
%------------------------------------------------------------------------------