TSTP Solution File: GRP466-1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : GRP466-1 : TPTP v8.1.0. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n028.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.66s
% Output : Refutation 0.45s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : GRP466-1 : TPTP v8.1.0. Released v2.6.0.
% 0.10/0.12 % Command : sos-script %s
% 0.12/0.34 % Computer : n028.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Tue Jun 14 09:42:38 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.12/0.36 ----- Otter 3.2, August 2001 -----
% 0.12/0.36 The process was started by sandbox on n028.cluster.edu,
% 0.12/0.36 Tue Jun 14 09:42:38 2022
% 0.12/0.36 The command was "./sos". The process ID is 26096.
% 0.12/0.36
% 0.12/0.36 set(prolog_style_variables).
% 0.12/0.36 set(auto).
% 0.12/0.36 dependent: set(auto1).
% 0.12/0.36 dependent: set(process_input).
% 0.12/0.36 dependent: clear(print_kept).
% 0.12/0.36 dependent: clear(print_new_demod).
% 0.12/0.36 dependent: clear(print_back_demod).
% 0.12/0.36 dependent: clear(print_back_sub).
% 0.12/0.36 dependent: set(control_memory).
% 0.12/0.36 dependent: assign(max_mem, 12000).
% 0.12/0.36 dependent: assign(pick_given_ratio, 4).
% 0.12/0.36 dependent: assign(stats_level, 1).
% 0.12/0.36 dependent: assign(pick_semantic_ratio, 3).
% 0.12/0.36 dependent: assign(sos_limit, 5000).
% 0.12/0.36 dependent: assign(max_weight, 60).
% 0.12/0.36 clear(print_given).
% 0.12/0.36
% 0.12/0.36 list(usable).
% 0.12/0.36
% 0.12/0.36 SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=1.
% 0.12/0.36
% 0.12/0.36 All clauses are units, and equality is present; the
% 0.12/0.36 strategy will be Knuth-Bendix with positive clauses in sos.
% 0.12/0.36
% 0.12/0.36 dependent: set(knuth_bendix).
% 0.12/0.36 dependent: set(para_from).
% 0.12/0.36 dependent: set(para_into).
% 0.12/0.36 dependent: clear(para_from_right).
% 0.12/0.36 dependent: clear(para_into_right).
% 0.12/0.36 dependent: set(para_from_vars).
% 0.12/0.36 dependent: set(eq_units_both_ways).
% 0.12/0.36 dependent: set(dynamic_demod_all).
% 0.12/0.36 dependent: set(dynamic_demod).
% 0.12/0.36 dependent: set(order_eq).
% 0.12/0.36 dependent: set(back_demod).
% 0.12/0.36 dependent: set(lrpo).
% 0.12/0.36
% 0.12/0.36 ------------> process usable:
% 0.12/0.36
% 0.12/0.36 ------------> process sos:
% 0.12/0.36 Following clause subsumed by 6 during input processing: 0 [copy,6,flip.1] {-} A=A.
% 0.12/0.36 Following clause subsumed by 5 during input processing: 0 [copy,7,flip.1] {-} multiply(A,B)=divide(A,inverse(B)).
% 0.12/0.36
% 0.12/0.36 ======= end of input processing =======
% 0.12/0.38
% 0.12/0.38 Model 1 (0.00 seconds, 0 Inserts)
% 0.12/0.38
% 0.12/0.38 Stopped by limit on number of solutions
% 0.12/0.38
% 0.12/0.38
% 0.12/0.38 -------------- Softie stats --------------
% 0.12/0.38
% 0.12/0.38 UPDATE_STOP: 300
% 0.12/0.38 SFINDER_TIME_LIMIT: 2
% 0.12/0.38 SHORT_CLAUSE_CUTOFF: 4
% 0.12/0.38 number of clauses in intial UL: 1
% 0.12/0.38 number of clauses initially in problem: 6
% 0.12/0.38 percentage of clauses intially in UL: 16
% 0.12/0.38 percentage of distinct symbols occuring in initial UL: 83
% 0.12/0.38 percent of all initial clauses that are short: 100
% 0.12/0.38 absolute distinct symbol count: 6
% 0.12/0.38 distinct predicate count: 1
% 0.12/0.38 distinct function count: 3
% 0.12/0.38 distinct constant count: 2
% 0.12/0.38
% 0.12/0.38 ---------- no more Softie stats ----------
% 0.12/0.38
% 0.12/0.38
% 0.12/0.38
% 0.12/0.38 =========== start of search ===========
% 0.45/0.66
% 0.45/0.66 -------- PROOF --------
% 0.45/0.66 % SZS status Unsatisfiable
% 0.45/0.66 % SZS output start Refutation
% 0.45/0.66
% 0.45/0.66 Model 2 (0.00 seconds, 0 Inserts)
% 0.45/0.66
% 0.45/0.66 Stopped by limit on number of solutions
% 0.45/0.66
% 0.45/0.66 Stopped by limit on insertions
% 0.45/0.66
% 0.45/0.66 Model 3 [ 1 0 1927 ] (0.00 seconds, 250000 Inserts)
% 0.45/0.66
% 0.45/0.66 Stopped by limit on insertions
% 0.45/0.66
% 0.45/0.66 ----> UNIT CONFLICT at 0.28 sec ----> 35 [binary,34.1,12.1] {-} $F.
% 0.45/0.66
% 0.45/0.66 Length of proof is 6. Level of proof is 3.
% 0.45/0.66
% 0.45/0.66 ---------------- PROOF ----------------
% 0.45/0.66 % SZS status Unsatisfiable
% 0.45/0.66 % SZS output start Refutation
% 0.45/0.66
% 0.45/0.66 1 [] {-} multiply(inverse(a1),a1)!=multiply(inverse(b1),b1).
% 0.45/0.66 2 [copy,1,flip.1] {+} multiply(inverse(b1),b1)!=multiply(inverse(a1),a1).
% 0.45/0.66 3 [] {-} divide(divide(A,A),divide(B,divide(divide(C,divide(D,B)),inverse(D))))=C.
% 0.45/0.66 5 [] {+} multiply(A,B)=divide(A,inverse(B)).
% 0.45/0.66 7 [copy,5,flip.1] {-} divide(A,inverse(B))=multiply(A,B).
% 0.45/0.66 10 [para_into,3.1.1.2.2.1,3.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.66 12 [para_from,5.1.1,2.1.1] {+} divide(inverse(b1),inverse(b1))!=multiply(inverse(a1),a1).
% 0.45/0.66 17 [para_into,10.1.1,10.1.1] {+} divide(A,A)=divide(B,B).
% 0.45/0.66 34 [para_into,7.1.1,17.1.1] {-} divide(A,A)=multiply(inverse(B),B).
% 0.45/0.66 35 [binary,34.1,12.1] {-} $F.
% 0.45/0.66
% 0.45/0.66 % SZS output end Refutation
% 0.45/0.66 ------------ end of proof -------------
% 0.45/0.66
% 0.45/0.66
% 0.45/0.66 Search stopped by max_proofs option.
% 0.45/0.66
% 0.45/0.66
% 0.45/0.66 Search stopped by max_proofs option.
% 0.45/0.66
% 0.45/0.66 ============ end of search ============
% 0.45/0.66
% 0.45/0.66 ----------- soft-scott stats ----------
% 0.45/0.66
% 0.45/0.66 true clauses given 1 (16.7%)
% 0.45/0.66 false clauses given 5
% 0.45/0.66
% 0.45/0.66 FALSE TRUE
% 0.45/0.66 10 0 1
% 0.45/0.66 16 3 0
% 0.45/0.66 21 0 7
% 0.45/0.66 25 1 0
% 0.45/0.66 26 2 0
% 0.45/0.66 30 1 2
% 0.45/0.66 31 0 2
% 0.45/0.66 35 0 2
% 0.45/0.66 tot: 7 14 (66.7% true)
% 0.45/0.66
% 0.45/0.66
% 0.45/0.66 Model 3 [ 1 -12 1927 ] (0.00 seconds, 250000 Inserts)
% 0.45/0.66
% 0.45/0.66 That finishes the proof of the theorem.
% 0.45/0.66
% 0.45/0.66 Process 26096 finished Tue Jun 14 09:42:39 2022
%------------------------------------------------------------------------------