TSTP Solution File: GRP010-1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : GRP010-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n011.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:40:58 EDT 2022
% Result : Unsatisfiable 0.46s 0.68s
% Output : Refutation 0.46s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.11 % Problem : GRP010-1 : TPTP v8.1.0. Released v1.0.0.
% 0.07/0.12 % Command : sos-script %s
% 0.12/0.33 % Computer : n011.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 10:32:19 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.12/0.34 ----- Otter 3.2, August 2001 -----
% 0.12/0.34 The process was started by sandbox2 on n011.cluster.edu,
% 0.12/0.34 Tue Jun 14 10:32:19 2022
% 0.12/0.34 The command was "./sos". The process ID is 6087.
% 0.12/0.34
% 0.12/0.34 set(prolog_style_variables).
% 0.12/0.34 set(auto).
% 0.12/0.34 dependent: set(auto1).
% 0.12/0.34 dependent: set(process_input).
% 0.12/0.34 dependent: clear(print_kept).
% 0.12/0.34 dependent: clear(print_new_demod).
% 0.12/0.34 dependent: clear(print_back_demod).
% 0.12/0.34 dependent: clear(print_back_sub).
% 0.12/0.34 dependent: set(control_memory).
% 0.12/0.34 dependent: assign(max_mem, 12000).
% 0.12/0.34 dependent: assign(pick_given_ratio, 4).
% 0.12/0.34 dependent: assign(stats_level, 1).
% 0.12/0.34 dependent: assign(pick_semantic_ratio, 3).
% 0.12/0.34 dependent: assign(sos_limit, 5000).
% 0.12/0.34 dependent: assign(max_weight, 60).
% 0.12/0.34 clear(print_given).
% 0.12/0.34
% 0.12/0.34 list(usable).
% 0.12/0.34
% 0.12/0.34 SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=4.
% 0.12/0.34
% 0.12/0.34 This is a Horn set with equality. The strategy will be
% 0.12/0.34 Knuth-Bendix and hyper_res, with positive clauses in
% 0.12/0.34 sos and nonpositive clauses in usable.
% 0.12/0.34
% 0.12/0.34 dependent: set(knuth_bendix).
% 0.12/0.34 dependent: set(para_from).
% 0.12/0.34 dependent: set(para_into).
% 0.12/0.34 dependent: clear(para_from_right).
% 0.12/0.34 dependent: clear(para_into_right).
% 0.12/0.34 dependent: set(para_from_vars).
% 0.12/0.34 dependent: set(eq_units_both_ways).
% 0.12/0.34 dependent: set(dynamic_demod_all).
% 0.12/0.34 dependent: set(dynamic_demod).
% 0.12/0.34 dependent: set(order_eq).
% 0.12/0.34 dependent: set(back_demod).
% 0.12/0.34 dependent: set(lrpo).
% 0.12/0.34 dependent: set(hyper_res).
% 0.12/0.34 dependent: clear(order_hyper).
% 0.12/0.34
% 0.12/0.34 ------------> process usable:
% 0.12/0.34
% 0.12/0.34 ------------> process sos:
% 0.12/0.34 Following clause subsumed by 11 during input processing: 0 [copy,11,flip.1] {-} A=A.
% 0.12/0.34
% 0.12/0.34 ======= end of input processing =======
% 0.18/0.40
% 0.18/0.40 Model 1 (0.00 seconds, 0 Inserts)
% 0.18/0.40
% 0.18/0.40 Stopped by limit on number of solutions
% 0.18/0.40
% 0.18/0.40
% 0.18/0.40 -------------- Softie stats --------------
% 0.18/0.40
% 0.18/0.40 UPDATE_STOP: 300
% 0.18/0.40 SFINDER_TIME_LIMIT: 2
% 0.18/0.40 SHORT_CLAUSE_CUTOFF: 4
% 0.18/0.40 number of clauses in intial UL: 4
% 0.18/0.40 number of clauses initially in problem: 11
% 0.18/0.40 percentage of clauses intially in UL: 36
% 0.18/0.40 percentage of distinct symbols occuring in initial UL: 71
% 0.18/0.40 percent of all initial clauses that are short: 100
% 0.18/0.40 absolute distinct symbol count: 7
% 0.18/0.40 distinct predicate count: 2
% 0.18/0.40 distinct function count: 2
% 0.18/0.40 distinct constant count: 3
% 0.18/0.40
% 0.18/0.40 ---------- no more Softie stats ----------
% 0.18/0.40
% 0.18/0.40
% 0.18/0.40
% 0.18/0.40 Model 2 (0.00 seconds, 0 Inserts)
% 0.18/0.40
% 0.18/0.40 Stopped by limit on number of solutions
% 0.18/0.40
% 0.18/0.40 =========== start of search ===========
% 0.46/0.68
% 0.46/0.68 -------- PROOF --------
% 0.46/0.68 % SZS status Unsatisfiable
% 0.46/0.68 % SZS output start Refutation
% 0.46/0.68
% 0.46/0.68 Model 3 (0.00 seconds, 0 Inserts)
% 0.46/0.68
% 0.46/0.68 Stopped by limit on number of solutions
% 0.46/0.68
% 0.46/0.68 Stopped by limit on insertions
% 0.46/0.68
% 0.46/0.68 Model 4 [ 4 1 72 ] (0.00 seconds, 250000 Inserts)
% 0.46/0.68
% 0.46/0.68 Stopped by limit on insertions
% 0.46/0.68
% 0.46/0.68 Model 5 [ 7 1 73 ] (0.00 seconds, 250000 Inserts)
% 0.46/0.68
% 0.46/0.68 Stopped by limit on insertions
% 0.46/0.68
% 0.46/0.68 Model 6 [ 2 5 177253 ] (0.00 seconds, 250000 Inserts)
% 0.46/0.68
% 0.46/0.68 ----> UNIT CONFLICT at 0.30 sec ----> 40 [binary,39.1,4.1] {+} $F.
% 0.46/0.68
% 0.46/0.68 Length of proof is 2. Level of proof is 2.
% 0.46/0.68
% 0.46/0.68 ---------------- PROOF ----------------
% 0.46/0.68 % SZS status Unsatisfiable
% 0.46/0.68 % SZS output start Refutation
% 0.46/0.68
% 0.46/0.68 2 [] {+} -product(A,B,C)| -product(B,D,E)| -product(C,D,F)|product(A,E,F).
% 0.46/0.68 3 [] {+} -product(A,B,C)| -product(B,D,E)| -product(A,E,F)|product(C,D,F).
% 0.46/0.68 4 [] {+} -product(b,a,identity).
% 0.46/0.68 5 [] {+} product(identity,A,A).
% 0.46/0.68 7 [] {+} product(inverse(A),A,identity).
% 0.46/0.68 10 [] {+} product(a,b,identity).
% 0.46/0.68 22 [hyper,7,2,10,5] {-} product(inverse(a),identity,b).
% 0.46/0.68 39 [hyper,22,3,5,7] {-} product(b,a,identity).
% 0.46/0.68 40 [binary,39.1,4.1] {+} $F.
% 0.46/0.68
% 0.46/0.68 % SZS output end Refutation
% 0.46/0.68 ------------ end of proof -------------
% 0.46/0.68
% 0.46/0.68
% 0.46/0.68 Search stopped by max_proofs option.
% 0.46/0.68
% 0.46/0.68
% 0.46/0.68 Search stopped by max_proofs option.
% 0.46/0.68
% 0.46/0.68 ============ end of search ============
% 0.46/0.68
% 0.46/0.68 ----------- soft-scott stats ----------
% 0.46/0.68
% 0.46/0.68 true clauses given 2 (25.0%)
% 0.46/0.68 false clauses given 6
% 0.46/0.68
% 0.46/0.68 FALSE TRUE
% 0.46/0.68 5 2 7
% 0.46/0.68 6 5 1
% 0.46/0.68 12 3 3
% 0.46/0.68 13 0 4
% 0.46/0.68 tot: 10 15 (60.0% true)
% 0.46/0.68
% 0.46/0.68
% 0.46/0.68 Model 6 [ 2 5 177253 ] (0.00 seconds, 250000 Inserts)
% 0.46/0.68
% 0.46/0.68 That finishes the proof of the theorem.
% 0.46/0.68
% 0.46/0.68 Process 6087 finished Tue Jun 14 10:32:20 2022
%------------------------------------------------------------------------------