TSTP Solution File: GRP012+5 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : GRP012+5 : TPTP v8.1.0. Released v3.1.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:00 EDT 2022
% Result : Theorem 0.49s 0.68s
% Output : Refutation 0.49s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : GRP012+5 : TPTP v8.1.0. Released v3.1.0.
% 0.03/0.12 % Command : sos-script %s
% 0.12/0.33 % Computer : n013.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Tue Jun 14 13:42:43 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.12/0.35 ----- Otter 3.2, August 2001 -----
% 0.12/0.35 The process was started by sandbox on n013.cluster.edu,
% 0.12/0.35 Tue Jun 14 13:42:44 2022
% 0.12/0.35 The command was "./sos". The process ID is 11476.
% 0.12/0.35
% 0.12/0.35 set(prolog_style_variables).
% 0.12/0.35 set(auto).
% 0.12/0.35 dependent: set(auto1).
% 0.12/0.35 dependent: set(process_input).
% 0.12/0.35 dependent: clear(print_kept).
% 0.12/0.35 dependent: clear(print_new_demod).
% 0.12/0.35 dependent: clear(print_back_demod).
% 0.12/0.35 dependent: clear(print_back_sub).
% 0.12/0.35 dependent: set(control_memory).
% 0.12/0.35 dependent: assign(max_mem, 12000).
% 0.12/0.35 dependent: assign(pick_given_ratio, 4).
% 0.12/0.35 dependent: assign(stats_level, 1).
% 0.12/0.35 dependent: assign(pick_semantic_ratio, 3).
% 0.12/0.35 dependent: assign(sos_limit, 5000).
% 0.12/0.35 dependent: assign(max_weight, 60).
% 0.12/0.35 clear(print_given).
% 0.12/0.35
% 0.12/0.35 formula_list(usable).
% 0.12/0.35
% 0.12/0.35 SCAN INPUT: prop=0, horn=1, equality=0, symmetry=0, max_lits=4.
% 0.12/0.35
% 0.12/0.35 This is a Horn set without equality. The strategy will
% 0.12/0.35 be hyperresolution, with satellites in sos and nuclei
% 0.12/0.35 in usable.
% 0.12/0.35
% 0.12/0.35 dependent: set(hyper_res).
% 0.12/0.35 dependent: clear(order_hyper).
% 0.12/0.35
% 0.12/0.35 ------------> process usable:
% 0.12/0.35
% 0.12/0.35 ------------> process sos:
% 0.12/0.35
% 0.12/0.35 ======= end of input processing =======
% 0.18/0.51
% 0.18/0.51 Model 1 (0.00 seconds, 0 Inserts)
% 0.18/0.51
% 0.18/0.51 Stopped by limit on number of solutions
% 0.18/0.51
% 0.18/0.51
% 0.18/0.51 -------------- Softie stats --------------
% 0.18/0.51
% 0.18/0.51 UPDATE_STOP: 300
% 0.18/0.51 SFINDER_TIME_LIMIT: 2
% 0.18/0.51 SHORT_CLAUSE_CUTOFF: 4
% 0.18/0.51 number of clauses in intial UL: 3
% 0.18/0.51 number of clauses initially in problem: 10
% 0.18/0.51 percentage of clauses intially in UL: 30
% 0.18/0.51 percentage of distinct symbols occuring in initial UL: 62
% 0.18/0.51 percent of all initial clauses that are short: 100
% 0.18/0.51 absolute distinct symbol count: 8
% 0.18/0.51 distinct predicate count: 1
% 0.18/0.51 distinct function count: 2
% 0.18/0.51 distinct constant count: 5
% 0.18/0.51
% 0.18/0.51 ---------- no more Softie stats ----------
% 0.18/0.51
% 0.18/0.51
% 0.18/0.51
% 0.18/0.51 Model 2 (0.00 seconds, 0 Inserts)
% 0.18/0.51
% 0.18/0.51 Stopped by limit on number of solutions
% 0.18/0.51
% 0.18/0.51 =========== start of search ===========
% 0.49/0.68
% 0.49/0.68 -------- PROOF --------
% 0.49/0.68 % SZS status Theorem
% 0.49/0.68 % SZS output start Refutation
% 0.49/0.68
% 0.49/0.68 Model 3 (0.00 seconds, 0 Inserts)
% 0.49/0.68
% 0.49/0.68 Stopped by limit on number of solutions
% 0.49/0.68
% 0.49/0.68 Model 4 (0.00 seconds, 0 Inserts)
% 0.49/0.68
% 0.49/0.68 Stopped by limit on number of solutions
% 0.49/0.68
% 0.49/0.68 Model 5 (0.00 seconds, 0 Inserts)
% 0.49/0.68
% 0.49/0.68 Stopped by limit on number of solutions
% 0.49/0.68
% 0.49/0.68 Model 6 (0.00 seconds, 0 Inserts)
% 0.49/0.68
% 0.49/0.68 Stopped by limit on number of solutions
% 0.49/0.68
% 0.49/0.68 Model 7 [ 1 12 108208 ] (0.00 seconds, 113819 Inserts)
% 0.49/0.68
% 0.49/0.68 ----> UNIT CONFLICT at 0.31 sec ----> 376 [binary,375.1,3.1] {-} $F.
% 0.49/0.68
% 0.49/0.68 Length of proof is 4. Level of proof is 4.
% 0.49/0.68
% 0.49/0.68 ---------------- PROOF ----------------
% 0.49/0.68 % SZS status Theorem
% 0.49/0.68 % SZS output start Refutation
% 0.49/0.68
% 0.49/0.68 1 [] {+} -product(A,B,C)| -product(B,D,E)| -product(C,D,F)|product(A,E,F).
% 0.49/0.68 2 [] {+} -product(A,B,C)| -product(B,D,E)| -product(A,E,F)|product(C,D,F).
% 0.49/0.68 3 [] {+} -product(inverse($c2),inverse($c1),$c5).
% 0.49/0.68 5 [] {+} product(A,$c5,A).
% 0.49/0.68 7 [] {+} product(A,inverse(A),$c5).
% 0.49/0.68 8 [] {+} product(inverse(A),A,$c5).
% 0.49/0.68 9 [] {-} product(inverse($c4),inverse($c3),$c2).
% 0.49/0.68 10 [] {+} product($c3,$c4,$c1).
% 0.49/0.68 113 [hyper,9,2,8,5] {-} product($c2,$c3,inverse($c4)).
% 0.49/0.68 150 [hyper,113,1,10,8] {+} product($c2,$c1,$c5).
% 0.49/0.68 167 [hyper,150,2,7,5] {-} product($c5,inverse($c1),$c2).
% 0.49/0.68 375 [hyper,167,2,5,8] {-} product(inverse($c2),inverse($c1),$c5).
% 0.49/0.68 376 [binary,375.1,3.1] {-} $F.
% 0.49/0.68
% 0.49/0.68 % SZS output end Refutation
% 0.49/0.68 ------------ end of proof -------------
% 0.49/0.68
% 0.49/0.68
% 0.49/0.68 Search stopped by max_proofs option.
% 0.49/0.68
% 0.49/0.68
% 0.49/0.68 Search stopped by max_proofs option.
% 0.49/0.68
% 0.49/0.68 ============ end of search ============
% 0.49/0.68
% 0.49/0.68 ----------- soft-scott stats ----------
% 0.49/0.68
% 0.49/0.68 true clauses given 3 (21.4%)
% 0.49/0.68 false clauses given 11
% 0.49/0.68
% 0.49/0.68 FALSE TRUE
% 0.49/0.68 5 3 8
% 0.49/0.68 6 6 44
% 0.49/0.68 7 50 32
% 0.49/0.68 8 30 31
% 0.49/0.68 9 29 6
% 0.49/0.68 10 5 6
% 0.49/0.68 11 8 2
% 0.49/0.68 12 2 32
% 0.49/0.68 13 26 5
% 0.49/0.68 14 5 7
% 0.49/0.68 16 0 1
% 0.49/0.68 17 1 0
% 0.49/0.68 18 0 5
% 0.49/0.68 tot: 165 179 (52.0% true)
% 0.49/0.68
% 0.49/0.68
% 0.49/0.68 Model 7 [ 1 12 108208 ] (0.00 seconds, 113819 Inserts)
% 0.49/0.68
% 0.49/0.68 That finishes the proof of the theorem.
% 0.49/0.68
% 0.49/0.68 Process 11476 finished Tue Jun 14 13:42:44 2022
%------------------------------------------------------------------------------