TSTP Solution File: GRP467-1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : GRP467-1 : TPTP v8.1.0. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n019.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:03 EDT 2022
% Result : Unsatisfiable 0.45s 0.65s
% Output : Refutation 0.45s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13 % Problem : GRP467-1 : TPTP v8.1.0. Released v2.6.0.
% 0.04/0.14 % Command : sos-script %s
% 0.14/0.35 % Computer : n019.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 600
% 0.14/0.35 % DateTime : Tue Jun 14 02:08:24 EDT 2022
% 0.14/0.36 % CPUTime :
% 0.20/0.37 ----- Otter 3.2, August 2001 -----
% 0.20/0.37 The process was started by sandbox2 on n019.cluster.edu,
% 0.20/0.37 Tue Jun 14 02:08:24 2022
% 0.20/0.37 The command was "./sos". The process ID is 25396.
% 0.20/0.37
% 0.20/0.37 set(prolog_style_variables).
% 0.20/0.37 set(auto).
% 0.20/0.37 dependent: set(auto1).
% 0.20/0.37 dependent: set(process_input).
% 0.20/0.37 dependent: clear(print_kept).
% 0.20/0.37 dependent: clear(print_new_demod).
% 0.20/0.37 dependent: clear(print_back_demod).
% 0.20/0.37 dependent: clear(print_back_sub).
% 0.20/0.37 dependent: set(control_memory).
% 0.20/0.37 dependent: assign(max_mem, 12000).
% 0.20/0.37 dependent: assign(pick_given_ratio, 4).
% 0.20/0.37 dependent: assign(stats_level, 1).
% 0.20/0.37 dependent: assign(pick_semantic_ratio, 3).
% 0.20/0.37 dependent: assign(sos_limit, 5000).
% 0.20/0.37 dependent: assign(max_weight, 60).
% 0.20/0.37 clear(print_given).
% 0.20/0.37
% 0.20/0.37 list(usable).
% 0.20/0.37
% 0.20/0.37 SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=1.
% 0.20/0.37
% 0.20/0.37 All clauses are units, and equality is present; the
% 0.20/0.37 strategy will be Knuth-Bendix with positive clauses in sos.
% 0.20/0.37
% 0.20/0.37 dependent: set(knuth_bendix).
% 0.20/0.37 dependent: set(para_from).
% 0.20/0.37 dependent: set(para_into).
% 0.20/0.37 dependent: clear(para_from_right).
% 0.20/0.37 dependent: clear(para_into_right).
% 0.20/0.37 dependent: set(para_from_vars).
% 0.20/0.37 dependent: set(eq_units_both_ways).
% 0.20/0.37 dependent: set(dynamic_demod_all).
% 0.20/0.37 dependent: set(dynamic_demod).
% 0.20/0.37 dependent: set(order_eq).
% 0.20/0.37 dependent: set(back_demod).
% 0.20/0.37 dependent: set(lrpo).
% 0.20/0.37
% 0.20/0.37 ------------> process usable:
% 0.20/0.37
% 0.20/0.37 ------------> process sos:
% 0.20/0.37 Following clause subsumed by 5 during input processing: 0 [copy,5,flip.1] {-} A=A.
% 0.20/0.37 Following clause subsumed by 4 during input processing: 0 [copy,6,flip.1] {-} multiply(A,B)=divide(A,inverse(B)).
% 0.20/0.37
% 0.20/0.37 ======= end of input processing =======
% 0.20/0.40
% 0.20/0.40 Model 1 (0.00 seconds, 0 Inserts)
% 0.20/0.40
% 0.20/0.40 Stopped by limit on number of solutions
% 0.20/0.40
% 0.20/0.40
% 0.20/0.40 -------------- Softie stats --------------
% 0.20/0.40
% 0.20/0.40 UPDATE_STOP: 300
% 0.20/0.40 SFINDER_TIME_LIMIT: 2
% 0.20/0.40 SHORT_CLAUSE_CUTOFF: 4
% 0.20/0.40 number of clauses in intial UL: 1
% 0.20/0.40 number of clauses initially in problem: 6
% 0.20/0.40 percentage of clauses intially in UL: 16
% 0.20/0.40 percentage of distinct symbols occuring in initial UL: 83
% 0.20/0.40 percent of all initial clauses that are short: 100
% 0.20/0.40 absolute distinct symbol count: 6
% 0.20/0.40 distinct predicate count: 1
% 0.20/0.40 distinct function count: 3
% 0.20/0.40 distinct constant count: 2
% 0.20/0.40
% 0.20/0.40 ---------- no more Softie stats ----------
% 0.20/0.40
% 0.20/0.40
% 0.20/0.40
% 0.20/0.40 =========== start of search ===========
% 0.45/0.65
% 0.45/0.65 -------- PROOF --------
% 0.45/0.65 % SZS status Unsatisfiable
% 0.45/0.65 % SZS output start Refutation
% 0.45/0.65
% 0.45/0.65 Model 2 (0.00 seconds, 0 Inserts)
% 0.45/0.65
% 0.45/0.65 Stopped by limit on number of solutions
% 0.45/0.65
% 0.45/0.65 ----> UNIT CONFLICT at 0.25 sec ----> 453 [binary,451.1,432.1] {-} $F.
% 0.45/0.65
% 0.45/0.65 Length of proof is 12. Level of proof is 6.
% 0.45/0.65
% 0.45/0.65 ---------------- PROOF ----------------
% 0.45/0.65 % SZS status Unsatisfiable
% 0.45/0.65 % SZS output start Refutation
% 0.45/0.65
% 0.45/0.65 1 [] {+} multiply(multiply(inverse(b2),b2),a2)!=a2.
% 0.45/0.65 2 [] {-} divide(divide(A,A),divide(B,divide(divide(C,divide(D,B)),inverse(D))))=C.
% 0.45/0.65 4 [] {+} multiply(A,B)=divide(A,inverse(B)).
% 0.45/0.65 6 [copy,4,flip.1] {+} divide(A,inverse(B))=multiply(A,B).
% 0.45/0.65 7 [para_into,2.1.1.2.2.1.2,2.1.1] {-} divide(divide(A,A),divide(divide(B,divide(divide(C,divide(D,B)),inverse(D))),divide(divide(E,C),inverse(divide(F,F)))))=E.
% 0.45/0.65 9 [para_into,2.1.1.2.2.1,2.1.1] {+} divide(divide(A,A),divide(divide(divide(B,divide(C,D)),inverse(C)),divide(B,inverse(D))))=divide(E,E).
% 0.45/0.65 67 [para_from,6.1.1,2.1.1.2.2] {-} divide(divide(A,A),divide(B,multiply(divide(C,divide(D,B)),D)))=C.
% 0.45/0.65 184 [para_into,9.1.1,9.1.1] {+} divide(A,A)=divide(B,B).
% 0.45/0.65 231 [para_into,184.1.1,6.1.1] {+} multiply(inverse(A),A)=divide(B,B).
% 0.45/0.65 246,245 [para_from,184.1.1,7.1.1.2.2.1] {-} divide(divide(A,A),divide(divide(B,divide(divide(C,divide(D,B)),inverse(D))),divide(divide(E,E),inverse(divide(F,F)))))=C.
% 0.45/0.65 248 [para_from,184.1.1,67.1.1.2.2.1] {-} divide(divide(A,A),divide(B,multiply(divide(C,C),D)))=divide(D,B).
% 0.45/0.65 275 [para_into,248.1.1,184.1.1] {-} divide(A,A)=divide(B,multiply(divide(C,C),B)).
% 0.45/0.65 280 [copy,275,flip.1] {-} divide(A,multiply(divide(B,B),A))=divide(C,C).
% 0.45/0.65 432 [para_from,231.1.1,1.1.1.1] {+} multiply(divide(A,A),a2)!=a2.
% 0.45/0.65 451 [para_from,280.1.1,7.1.1.2.2.1,demod,246] {-} multiply(divide(A,A),B)=B.
% 0.45/0.65 453 [binary,451.1,432.1] {-} $F.
% 0.45/0.65
% 0.45/0.65 % SZS output end Refutation
% 0.45/0.65 ------------ end of proof -------------
% 0.45/0.65
% 0.45/0.65
% 0.45/0.65 Search stopped by max_proofs option.
% 0.45/0.65
% 0.45/0.65
% 0.45/0.65 Search stopped by max_proofs option.
% 0.45/0.65
% 0.45/0.65 ============ end of search ============
% 0.45/0.65
% 0.45/0.65 ----------- soft-scott stats ----------
% 0.45/0.65
% 0.45/0.65 true clauses given 7 (38.9%)
% 0.45/0.65 false clauses given 11
% 0.45/0.65
% 0.45/0.65 FALSE TRUE
% 0.45/0.65 7 0 1
% 0.45/0.65 8 0 2
% 0.45/0.65 12 2 0
% 0.45/0.65 15 5 0
% 0.45/0.65 16 10 0
% 0.45/0.65 17 4 2
% 0.45/0.65 18 1 0
% 0.45/0.65 19 8 4
% 0.45/0.65 20 10 14
% 0.45/0.65 21 3 18
% 0.45/0.65 22 0 8
% 0.45/0.65 23 2 0
% 0.45/0.65 24 7 0
% 0.45/0.65 25 11 14
% 0.45/0.65 26 5 8
% 0.45/0.65 27 0 2
% 0.45/0.65 29 17 6
% 0.45/0.65 30 16 10
% 0.45/0.65 31 7 4
% 0.45/0.65 33 3 4
% 0.45/0.65 34 12 10
% 0.45/0.65 35 4 17
% 0.45/0.65 36 1 0
% 0.45/0.65 38 3 0
% 0.45/0.65 39 10 4
% 0.45/0.65 40 2 2
% 0.45/0.65 43 1 2
% 0.45/0.65 44 8 4
% 0.45/0.65 48 2 2
% 0.45/0.65 49 1 0
% 0.45/0.65 53 1 0
% 0.45/0.65 tot: 156 138 (46.9% true)
% 0.45/0.65
% 0.45/0.65
% 0.45/0.65 Model 2 (0.00 seconds, 0 Inserts)
% 0.45/0.65
% 0.45/0.65 That finishes the proof of the theorem.
% 0.45/0.65
% 0.45/0.65 Process 25396 finished Tue Jun 14 02:08:25 2022
%------------------------------------------------------------------------------