TSTP Solution File: GRP558-1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : GRP558-1 : TPTP v8.1.0. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n014.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:20 EDT 2022
% Result : Unsatisfiable 0.59s 0.81s
% Output : Refutation 0.59s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : GRP558-1 : TPTP v8.1.0. Released v2.6.0.
% 0.03/0.13 % Command : sos-script %s
% 0.13/0.34 % Computer : n014.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 16:33:37 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.13/0.36 ----- Otter 3.2, August 2001 -----
% 0.13/0.36 The process was started by sandbox on n014.cluster.edu,
% 0.13/0.36 Mon Jun 13 16:33:37 2022
% 0.13/0.36 The command was "./sos". The process ID is 28392.
% 0.13/0.36
% 0.13/0.36 set(prolog_style_variables).
% 0.13/0.36 set(auto).
% 0.13/0.36 dependent: set(auto1).
% 0.13/0.36 dependent: set(process_input).
% 0.13/0.36 dependent: clear(print_kept).
% 0.13/0.36 dependent: clear(print_new_demod).
% 0.13/0.36 dependent: clear(print_back_demod).
% 0.13/0.36 dependent: clear(print_back_sub).
% 0.13/0.36 dependent: set(control_memory).
% 0.13/0.36 dependent: assign(max_mem, 12000).
% 0.13/0.36 dependent: assign(pick_given_ratio, 4).
% 0.13/0.36 dependent: assign(stats_level, 1).
% 0.13/0.36 dependent: assign(pick_semantic_ratio, 3).
% 0.13/0.36 dependent: assign(sos_limit, 5000).
% 0.13/0.36 dependent: assign(max_weight, 60).
% 0.13/0.36 clear(print_given).
% 0.13/0.36
% 0.13/0.36 list(usable).
% 0.13/0.36
% 0.13/0.36 SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=1.
% 0.13/0.36
% 0.13/0.36 All clauses are units, and equality is present; the
% 0.13/0.36 strategy will be Knuth-Bendix with positive clauses in sos.
% 0.13/0.36
% 0.13/0.36 dependent: set(knuth_bendix).
% 0.13/0.36 dependent: set(para_from).
% 0.13/0.36 dependent: set(para_into).
% 0.13/0.36 dependent: clear(para_from_right).
% 0.13/0.36 dependent: clear(para_into_right).
% 0.13/0.36 dependent: set(para_from_vars).
% 0.13/0.36 dependent: set(eq_units_both_ways).
% 0.13/0.36 dependent: set(dynamic_demod_all).
% 0.13/0.36 dependent: set(dynamic_demod).
% 0.13/0.36 dependent: set(order_eq).
% 0.13/0.36 dependent: set(back_demod).
% 0.13/0.36 dependent: set(lrpo).
% 0.13/0.36
% 0.13/0.36 ------------> process usable:
% 0.13/0.36
% 0.13/0.36 ------------> process sos:
% 0.13/0.36 Following clause subsumed by 5 during input processing: 0 [copy,5,flip.1] {-} A=A.
% 0.13/0.36 Following clause subsumed by 4 during input processing: 0 [copy,6,flip.1] {-} multiply(A,B)=divide(A,inverse(B)).
% 0.13/0.36
% 0.13/0.36 ======= end of input processing =======
% 0.20/0.38
% 0.20/0.38 Model 1 (0.00 seconds, 0 Inserts)
% 0.20/0.38
% 0.20/0.38 Stopped by limit on number of solutions
% 0.20/0.38
% 0.20/0.38
% 0.20/0.38 -------------- Softie stats --------------
% 0.20/0.38
% 0.20/0.38 UPDATE_STOP: 300
% 0.20/0.38 SFINDER_TIME_LIMIT: 2
% 0.20/0.38 SHORT_CLAUSE_CUTOFF: 4
% 0.20/0.38 number of clauses in intial UL: 1
% 0.20/0.38 number of clauses initially in problem: 6
% 0.20/0.38 percentage of clauses intially in UL: 16
% 0.20/0.38 percentage of distinct symbols occuring in initial UL: 83
% 0.20/0.38 percent of all initial clauses that are short: 100
% 0.20/0.38 absolute distinct symbol count: 6
% 0.20/0.38 distinct predicate count: 1
% 0.20/0.38 distinct function count: 3
% 0.20/0.38 distinct constant count: 2
% 0.20/0.38
% 0.20/0.38 ---------- no more Softie stats ----------
% 0.20/0.38
% 0.20/0.38
% 0.20/0.38
% 0.20/0.38 =========== start of search ===========
% 0.59/0.81
% 0.59/0.81 -------- PROOF --------
% 0.59/0.81 % SZS status Unsatisfiable
% 0.59/0.81 % SZS output start Refutation
% 0.59/0.81
% 0.59/0.81 Model 2 (0.00 seconds, 0 Inserts)
% 0.59/0.81
% 0.59/0.81 Stopped by limit on number of solutions
% 0.59/0.81
% 0.59/0.81 Model 3 (0.00 seconds, 0 Inserts)
% 0.59/0.81
% 0.59/0.81 Stopped by limit on number of solutions
% 0.59/0.81
% 0.59/0.81 Stopped by limit on insertions
% 0.59/0.81
% 0.59/0.81 Model 4 [ 6 0 1051 ] (0.00 seconds, 15406 Inserts)
% 0.59/0.81
% 0.59/0.81 Stopped by limit on insertions
% 0.59/0.81
% 0.59/0.81 Model 5 [ 11 1 13221 ] (0.00 seconds, 250000 Inserts)
% 0.59/0.81
% 0.59/0.81 ----> UNIT CONFLICT at 0.43 sec ----> 93 [binary,91.1,1.1] {+} $F.
% 0.59/0.81
% 0.59/0.81 Length of proof is 9. Level of proof is 7.
% 0.59/0.81
% 0.59/0.81 ---------------- PROOF ----------------
% 0.59/0.81 % SZS status Unsatisfiable
% 0.59/0.81 % SZS output start Refutation
% 0.59/0.81
% 0.59/0.81 1 [] {+} multiply(multiply(inverse(b2),b2),a2)!=a2.
% 0.59/0.81 2 [] {-} divide(A,inverse(divide(divide(B,C),divide(A,C))))=B.
% 0.59/0.81 4 [] {+} multiply(A,B)=divide(A,inverse(B)).
% 0.59/0.81 6 [copy,4,flip.1] {+} divide(A,inverse(B))=multiply(A,B).
% 0.59/0.81 7 [para_into,2.1.1.2.1.1,2.1.1] {-} divide(A,inverse(divide(B,divide(A,inverse(divide(divide(B,C),divide(D,C)))))))=D.
% 0.59/0.81 21 [para_into,7.1.1.2.1.2,2.1.1] {+} divide(A,inverse(divide(B,B)))=A.
% 0.59/0.81 27 [para_from,21.1.1,7.1.1.2.1.2] {-} divide(A,inverse(divide(B,A)))=B.
% 0.59/0.81 31 [para_into,6.1.1,21.1.1,flip.1] {+} multiply(A,divide(B,B))=A.
% 0.59/0.81 59 [para_into,27.1.1,6.1.1] {+} multiply(A,divide(B,A))=B.
% 0.59/0.81 69 [para_into,59.1.1.2,27.1.1] {+} multiply(inverse(divide(A,B)),A)=B.
% 0.59/0.81 84,83 [para_into,69.1.1.1.1,27.1.1,flip.1] {-} inverse(divide(A,B))=multiply(inverse(A),B).
% 0.59/0.81 91 [para_into,69.1.1,31.1.1,demod,84,84] {-} multiply(multiply(inverse(A),A),B)=B.
% 0.59/0.81 93 [binary,91.1,1.1] {+} $F.
% 0.59/0.81
% 0.59/0.81 % SZS output end Refutation
% 0.59/0.81 ------------ end of proof -------------
% 0.59/0.81
% 0.59/0.81
% 0.59/0.81 Search stopped by max_proofs option.
% 0.59/0.81
% 0.59/0.81
% 0.59/0.81 Search stopped by max_proofs option.
% 0.59/0.81
% 0.59/0.81 ============ end of search ============
% 0.59/0.81
% 0.59/0.81 ----------- soft-scott stats ----------
% 0.59/0.81
% 0.59/0.81 true clauses given 3 (30.0%)
% 0.59/0.81 false clauses given 7
% 0.59/0.81
% 0.59/0.81 FALSE TRUE
% 0.59/0.81 8 4 0
% 0.59/0.81 9 5 2
% 0.59/0.81 11 1 0
% 0.59/0.81 12 2 0
% 0.59/0.81 13 5 0
% 0.59/0.81 16 2 0
% 0.59/0.81 17 2 0
% 0.59/0.81 18 5 0
% 0.59/0.81 22 3 0
% 0.59/0.81 27 2 0
% 0.59/0.81 tot: 31 2 (6.1% true)
% 0.59/0.81
% 0.59/0.81
% 0.59/0.81 Model 5 [ 11 1 13221 ] (0.00 seconds, 250000 Inserts)
% 0.59/0.81
% 0.59/0.81 That finishes the proof of the theorem.
% 0.59/0.81
% 0.59/0.81 Process 28392 finished Mon Jun 13 16:33:37 2022
%------------------------------------------------------------------------------