TSTP Solution File: GRP029-2 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : GRP029-2 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n008.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:06 EDT 2022
% Result : Unsatisfiable 0.53s 0.76s
% Output : Refutation 0.53s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : GRP029-2 : TPTP v8.1.0. Released v1.0.0.
% 0.10/0.13 % Command : sos-script %s
% 0.13/0.33 % Computer : n008.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Tue Jun 14 02:57:52 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.13/0.35 ----- Otter 3.2, August 2001 -----
% 0.13/0.35 The process was started by sandbox2 on n008.cluster.edu,
% 0.13/0.35 Tue Jun 14 02:57:52 2022
% 0.13/0.35 The command was "./sos". The process ID is 13080.
% 0.13/0.35
% 0.13/0.35 set(prolog_style_variables).
% 0.13/0.35 set(auto).
% 0.13/0.35 dependent: set(auto1).
% 0.13/0.35 dependent: set(process_input).
% 0.13/0.35 dependent: clear(print_kept).
% 0.13/0.35 dependent: clear(print_new_demod).
% 0.13/0.35 dependent: clear(print_back_demod).
% 0.13/0.35 dependent: clear(print_back_sub).
% 0.13/0.35 dependent: set(control_memory).
% 0.13/0.35 dependent: assign(max_mem, 12000).
% 0.13/0.35 dependent: assign(pick_given_ratio, 4).
% 0.13/0.35 dependent: assign(stats_level, 1).
% 0.13/0.35 dependent: assign(pick_semantic_ratio, 3).
% 0.13/0.35 dependent: assign(sos_limit, 5000).
% 0.13/0.35 dependent: assign(max_weight, 60).
% 0.13/0.35 clear(print_given).
% 0.13/0.35
% 0.13/0.35 list(usable).
% 0.13/0.35
% 0.13/0.35 SCAN INPUT: prop=0, horn=1, equality=1, symmetry=1, max_lits=4.
% 0.13/0.35
% 0.13/0.35 This is a Horn set with equality. The strategy will be
% 0.13/0.35 Knuth-Bendix and hyper_res, with positive clauses in
% 0.13/0.35 sos and nonpositive clauses in usable.
% 0.13/0.35
% 0.13/0.35 dependent: set(knuth_bendix).
% 0.13/0.35 dependent: set(para_from).
% 0.13/0.35 dependent: set(para_into).
% 0.13/0.35 dependent: clear(para_from_right).
% 0.13/0.35 dependent: clear(para_into_right).
% 0.13/0.35 dependent: set(para_from_vars).
% 0.13/0.35 dependent: set(eq_units_both_ways).
% 0.13/0.35 dependent: set(dynamic_demod_all).
% 0.13/0.35 dependent: set(dynamic_demod).
% 0.13/0.35 dependent: set(order_eq).
% 0.13/0.35 dependent: set(back_demod).
% 0.13/0.35 dependent: set(lrpo).
% 0.13/0.35 dependent: set(hyper_res).
% 0.13/0.35 dependent: clear(order_hyper).
% 0.13/0.35
% 0.13/0.35 There is a clause for symmetry of equality is, so it is
% 0.13/0.35 assumed that equality is fully axiomatized; therefore,
% 0.13/0.35 paramodulation is disabled.
% 0.13/0.35
% 0.13/0.35 dependent: clear(para_from).
% 0.13/0.35 dependent: clear(para_into).
% 0.13/0.35
% 0.13/0.35 ------------> process usable:
% 0.13/0.35
% 0.13/0.35 ------------> process sos:
% 0.13/0.35 Following clause subsumed by 13 during input processing: 0 [copy,13,flip.1] {-} equalish(A,A).
% 0.13/0.35
% 0.13/0.35 ======= end of input processing =======
% 0.19/0.41
% 0.19/0.41 Model 1 (0.00 seconds, 0 Inserts)
% 0.19/0.41
% 0.19/0.41 Stopped by limit on number of solutions
% 0.19/0.41
% 0.19/0.41
% 0.19/0.41 -------------- Softie stats --------------
% 0.19/0.41
% 0.19/0.41 UPDATE_STOP: 300
% 0.19/0.41 SFINDER_TIME_LIMIT: 2
% 0.19/0.41 SHORT_CLAUSE_CUTOFF: 4
% 0.19/0.41 number of clauses in intial UL: 12
% 0.19/0.41 number of clauses initially in problem: 16
% 0.19/0.41 percentage of clauses intially in UL: 75
% 0.19/0.41 percentage of distinct symbols occuring in initial UL: 83
% 0.19/0.41 percent of all initial clauses that are short: 100
% 0.19/0.41 absolute distinct symbol count: 6
% 0.19/0.41 distinct predicate count: 2
% 0.19/0.41 distinct function count: 3
% 0.19/0.41 distinct constant count: 1
% 0.19/0.41
% 0.19/0.41 ---------- no more Softie stats ----------
% 0.19/0.41
% 0.19/0.41
% 0.19/0.41
% 0.19/0.41 Model 2 (0.00 seconds, 0 Inserts)
% 0.19/0.41
% 0.19/0.41 Stopped by limit on number of solutions
% 0.19/0.41
% 0.19/0.41 =========== start of search ===========
% 0.53/0.76
% 0.53/0.76 -------- PROOF --------
% 0.53/0.76 % SZS status Unsatisfiable
% 0.53/0.76 % SZS output start Refutation
% 0.53/0.76
% 0.53/0.76 Model 3 (0.00 seconds, 0 Inserts)
% 0.53/0.76
% 0.53/0.76 Stopped by limit on number of solutions
% 0.53/0.76
% 0.53/0.76 Model 4 [ 1 1 294 ] (0.00 seconds, 1618 Inserts)
% 0.53/0.76
% 0.53/0.76 Stopped by limit on insertions
% 0.53/0.76
% 0.53/0.76 Model 5 [ 1 4 39367 ] (0.00 seconds, 250000 Inserts)
% 0.53/0.76
% 0.53/0.76 Stopped by limit on insertions
% 0.53/0.76
% 0.53/0.76 Model 6 [ 4 1 77 ] (0.00 seconds, 250000 Inserts)
% 0.53/0.76
% 0.53/0.76 Model 7 [ 1 4 84498 ] (0.00 seconds, 87298 Inserts)
% 0.53/0.76
% 0.53/0.76 ----> UNIT CONFLICT at 0.38 sec ----> 53 [binary,52.1,12.1] {-} $F.
% 0.53/0.76
% 0.53/0.76 Length of proof is 2. Level of proof is 2.
% 0.53/0.76
% 0.53/0.76 ---------------- PROOF ----------------
% 0.53/0.76 % SZS status Unsatisfiable
% 0.53/0.76 % SZS output start Refutation
% 0.53/0.76
% 0.53/0.76 10 [] {+} -product(A,B,C)| -product(B,D,E)| -product(C,D,F)|product(A,E,F).
% 0.53/0.76 11 [] {+} -product(A,B,C)| -product(B,D,E)| -product(A,E,F)|product(C,D,F).
% 0.53/0.76 12 [] {+} -product(not_right_identity(A),A,not_right_identity(A)).
% 0.53/0.76 15 [] {+} product(identity,A,A).
% 0.53/0.76 16 [] {+} product(inverse(A),A,identity).
% 0.53/0.76 17 [hyper,16,10,16,15] {-} product(inverse(inverse(A)),identity,A).
% 0.53/0.76 52 [hyper,17,11,17,15] {-} product(A,identity,A).
% 0.53/0.76 53 [binary,52.1,12.1] {-} $F.
% 0.53/0.76
% 0.53/0.76 % SZS output end Refutation
% 0.53/0.76 ------------ end of proof -------------
% 0.53/0.76
% 0.53/0.76
% 0.53/0.76 Search stopped by max_proofs option.
% 0.53/0.76
% 0.53/0.76
% 0.53/0.76 Search stopped by max_proofs option.
% 0.53/0.76
% 0.53/0.76 ============ end of search ============
% 0.53/0.76
% 0.53/0.76 ----------- soft-scott stats ----------
% 0.53/0.76
% 0.53/0.76 true clauses given 0 (0.0%)
% 0.53/0.76 false clauses given 7
% 0.53/0.76
% 0.53/0.76 FALSE TRUE
% 0.53/0.76 4 0 1
% 0.53/0.76 5 0 2
% 0.53/0.76 6 1 5
% 0.53/0.76 7 5 2
% 0.53/0.76 8 2 4
% 0.53/0.76 9 3 2
% 0.53/0.76 10 0 2
% 0.53/0.76 tot: 11 18 (62.1% true)
% 0.53/0.76
% 0.53/0.76
% 0.53/0.76 Model 7 [ 1 -1 84498 ] (0.00 seconds, 87298 Inserts)
% 0.53/0.76
% 0.53/0.76 That finishes the proof of the theorem.
% 0.53/0.76
% 0.53/0.76 Process 13080 finished Tue Jun 14 02:57:53 2022
%------------------------------------------------------------------------------