TSTP Solution File: GRP031-1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : GRP031-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n013.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:41:07 EDT 2022
% Result : Unsatisfiable 0.21s 0.47s
% Output : Refutation 0.21s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : GRP031-1 : TPTP v8.1.0. Released v1.0.0.
% 0.06/0.13 % Command : sos-script %s
% 0.13/0.34 % Computer : n013.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 : Tue Jun 14 05:19:59 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.13/0.36 ----- Otter 3.2, August 2001 -----
% 0.13/0.36 The process was started by sandbox2 on n013.cluster.edu,
% 0.13/0.36 Tue Jun 14 05:19:59 2022
% 0.13/0.36 The command was "./sos". The process ID is 19740.
% 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=4.
% 0.13/0.36
% 0.13/0.36 This is a Horn set with equality. The strategy will be
% 0.13/0.36 Knuth-Bendix and hyper_res, with positive clauses in
% 0.13/0.36 sos and nonpositive clauses in usable.
% 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 dependent: set(hyper_res).
% 0.13/0.36 dependent: clear(order_hyper).
% 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 8 during input processing: 0 [copy,8,flip.1] {-} A=A.
% 0.13/0.36
% 0.13/0.36 ======= end of input processing =======
% 0.21/0.41
% 0.21/0.41 Model 1 (0.00 seconds, 0 Inserts)
% 0.21/0.41
% 0.21/0.41 Stopped by limit on number of solutions
% 0.21/0.41
% 0.21/0.41
% 0.21/0.41 -------------- Softie stats --------------
% 0.21/0.41
% 0.21/0.41 UPDATE_STOP: 300
% 0.21/0.41 SFINDER_TIME_LIMIT: 2
% 0.21/0.41 SHORT_CLAUSE_CUTOFF: 4
% 0.21/0.41 number of clauses in intial UL: 4
% 0.21/0.41 number of clauses initially in problem: 8
% 0.21/0.41 percentage of clauses intially in UL: 50
% 0.21/0.41 percentage of distinct symbols occuring in initial UL: 66
% 0.21/0.41 percent of all initial clauses that are short: 100
% 0.21/0.41 absolute distinct symbol count: 6
% 0.21/0.41 distinct predicate count: 2
% 0.21/0.41 distinct function count: 2
% 0.21/0.41 distinct constant count: 2
% 0.21/0.41
% 0.21/0.41 ---------- no more Softie stats ----------
% 0.21/0.41
% 0.21/0.41
% 0.21/0.41
% 0.21/0.41 Model 2 (0.00 seconds, 0 Inserts)
% 0.21/0.41
% 0.21/0.41 Stopped by limit on number of solutions
% 0.21/0.41
% 0.21/0.41 =========== start of search ===========
% 0.21/0.47
% 0.21/0.47 -------- PROOF --------
% 0.21/0.47 % SZS status Unsatisfiable
% 0.21/0.47 % SZS output start Refutation
% 0.21/0.47
% 0.21/0.47 Model 3 (0.00 seconds, 0 Inserts)
% 0.21/0.47
% 0.21/0.47 Stopped by limit on number of solutions
% 0.21/0.47
% 0.21/0.47 Model 4 [ 2 1 258 ] (0.00 seconds, 2100 Inserts)
% 0.21/0.47
% 0.21/0.47 Model 5 [ 1 2 1253 ] (0.00 seconds, 2889 Inserts)
% 0.21/0.47
% 0.21/0.47 Model 6 [ 1 1 932 ] (0.00 seconds, 3093 Inserts)
% 0.21/0.47
% 0.21/0.47 ----> UNIT CONFLICT at 0.09 sec ----> 103 [binary,102.1,4.1] {+} $F.
% 0.21/0.47
% 0.21/0.47 Length of proof is 2. Level of proof is 2.
% 0.21/0.47
% 0.21/0.47 ---------------- PROOF ----------------
% 0.21/0.47 % SZS status Unsatisfiable
% 0.21/0.47 % SZS output start Refutation
% 0.21/0.47
% 0.21/0.47 2 [] {+} -product(A,B,C)| -product(B,D,E)| -product(C,D,F)|product(A,E,F).
% 0.21/0.47 3 [] {+} -product(A,B,C)| -product(B,D,E)| -product(A,E,F)|product(C,D,F).
% 0.21/0.47 4 [] {+} -product(a,A,identity).
% 0.21/0.47 6 [] {+} product(identity,A,A).
% 0.21/0.47 7 [] {+} product(inverse(A),A,identity).
% 0.21/0.47 29 [hyper,7,2,7,6] {-} product(inverse(inverse(A)),identity,A).
% 0.21/0.47 102 [hyper,29,3,6,7] {-} product(A,inverse(A),identity).
% 0.21/0.47 103 [binary,102.1,4.1] {+} $F.
% 0.21/0.47
% 0.21/0.47 % SZS output end Refutation
% 0.21/0.47 ------------ end of proof -------------
% 0.21/0.47
% 0.21/0.47
% 0.21/0.47 Search stopped by max_proofs option.
% 0.21/0.47
% 0.21/0.47
% 0.21/0.47 Search stopped by max_proofs option.
% 0.21/0.47
% 0.21/0.47 ============ end of search ============
% 0.21/0.47
% 0.21/0.47 ----------- soft-scott stats ----------
% 0.21/0.47
% 0.21/0.47 true clauses given 2 (28.6%)
% 0.21/0.47 false clauses given 5
% 0.21/0.47
% 0.21/0.47 FALSE TRUE
% 0.21/0.47 5 0 2
% 0.21/0.47 6 0 5
% 0.21/0.47 7 3 3
% 0.21/0.47 8 2 8
% 0.21/0.47 9 1 7
% 0.21/0.47 10 0 1
% 0.21/0.47 11 1 1
% 0.21/0.47 12 0 8
% 0.21/0.47 13 7 11
% 0.21/0.47 14 0 8
% 0.21/0.47 18 0 8
% 0.21/0.47 tot: 14 62 (81.6% true)
% 0.21/0.47
% 0.21/0.47
% 0.21/0.47 Model 6 [ 1 1 932 ] (0.00 seconds, 3093 Inserts)
% 0.21/0.47
% 0.21/0.47 That finishes the proof of the theorem.
% 0.21/0.47
% 0.21/0.47 Process 19740 finished Tue Jun 14 05:19:59 2022
%------------------------------------------------------------------------------