TSTP Solution File: GRP001-1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : GRP001-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n020.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:54 EDT 2022
% Result : Unsatisfiable 0.68s 0.90s
% Output : Refutation 0.68s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : GRP001-1 : TPTP v8.1.0. Released v1.0.0.
% 0.03/0.13 % Command : sos-script %s
% 0.12/0.34 % Computer : n020.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 04:57:05 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 sandbox2 on n020.cluster.edu,
% 0.12/0.36 Tue Jun 14 04:57:05 2022
% 0.12/0.36 The command was "./sos". The process ID is 25230.
% 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=4.
% 0.12/0.36
% 0.12/0.36 This is a Horn set with equality. The strategy will be
% 0.12/0.36 Knuth-Bendix and hyper_res, with positive clauses in
% 0.12/0.36 sos and nonpositive clauses in usable.
% 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 dependent: set(hyper_res).
% 0.12/0.36 dependent: clear(order_hyper).
% 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 12 during input processing: 0 [copy,12,flip.1] {-} A=A.
% 0.12/0.36
% 0.12/0.36 ======= end of input processing =======
% 0.19/0.40
% 0.19/0.40 Model 1 (0.00 seconds, 0 Inserts)
% 0.19/0.40
% 0.19/0.40 Stopped by limit on number of solutions
% 0.19/0.40
% 0.19/0.40
% 0.19/0.40 -------------- Softie stats --------------
% 0.19/0.40
% 0.19/0.40 UPDATE_STOP: 300
% 0.19/0.40 SFINDER_TIME_LIMIT: 2
% 0.19/0.40 SHORT_CLAUSE_CUTOFF: 4
% 0.19/0.40 number of clauses in intial UL: 4
% 0.19/0.40 number of clauses initially in problem: 12
% 0.19/0.40 percentage of clauses intially in UL: 33
% 0.19/0.40 percentage of distinct symbols occuring in initial UL: 62
% 0.19/0.40 percent of all initial clauses that are short: 100
% 0.19/0.40 absolute distinct symbol count: 8
% 0.19/0.40 distinct predicate count: 2
% 0.19/0.40 distinct function count: 2
% 0.19/0.40 distinct constant count: 4
% 0.19/0.40
% 0.19/0.40 ---------- no more Softie stats ----------
% 0.19/0.40
% 0.19/0.40
% 0.19/0.40
% 0.19/0.40 Model 2 (0.00 seconds, 0 Inserts)
% 0.19/0.40
% 0.19/0.40 Stopped by limit on number of solutions
% 0.19/0.40
% 0.19/0.40 =========== start of search ===========
% 0.68/0.90
% 0.68/0.90 -------- PROOF --------
% 0.68/0.90 % SZS status Unsatisfiable
% 0.68/0.90 % SZS output start Refutation
% 0.68/0.90
% 0.68/0.90 Model 3 (0.00 seconds, 0 Inserts)
% 0.68/0.90
% 0.68/0.90 Stopped by limit on number of solutions
% 0.68/0.90
% 0.68/0.90 Model 4 (0.00 seconds, 0 Inserts)
% 0.68/0.90
% 0.68/0.90 Stopped by limit on number of solutions
% 0.68/0.90
% 0.68/0.90 Model 5 [ 1 1 358 ] (0.00 seconds, 822 Inserts)
% 0.68/0.90
% 0.68/0.90 Stopped by limit on insertions
% 0.68/0.90
% 0.68/0.90 Model 6 [ 10 1 230 ] (0.00 seconds, 250000 Inserts)
% 0.68/0.90
% 0.68/0.90 Stopped by limit on insertions
% 0.68/0.90
% 0.68/0.90 Model 7 [ 6 1 63 ] (0.00 seconds, 250000 Inserts)
% 0.68/0.90
% 0.68/0.90 Stopped by limit on insertions
% 0.68/0.90
% 0.68/0.90 Model 8 [ 7 1 86 ] (0.00 seconds, 250000 Inserts)
% 0.68/0.90
% 0.68/0.90 Stopped by limit on insertions
% 0.68/0.90
% 0.68/0.90 Model 9 [ 10 1 58 ] (0.00 seconds, 250000 Inserts)
% 0.68/0.90
% 0.68/0.90 Stopped by limit on insertions
% 0.68/0.90
% 0.68/0.90 Model 10 [ 7 0 99 ] (0.00 seconds, 250000 Inserts)
% 0.68/0.90
% 0.68/0.90 ----> UNIT CONFLICT at 0.52 sec ----> 44 [binary,43.1,4.1] {-} $F.
% 0.68/0.90
% 0.68/0.90 Length of proof is 4. Level of proof is 3.
% 0.68/0.90
% 0.68/0.90 ---------------- PROOF ----------------
% 0.68/0.90 % SZS status Unsatisfiable
% 0.68/0.90 % SZS output start Refutation
% 0.68/0.90
% 0.68/0.90 2 [] {+} -product(A,B,C)| -product(B,D,E)| -product(C,D,F)|product(A,E,F).
% 0.68/0.90 3 [] {+} -product(A,B,C)| -product(B,D,E)| -product(A,E,F)|product(C,D,F).
% 0.68/0.90 4 [] {+} -product(b,a,c).
% 0.68/0.90 5 [] {+} product(identity,A,A).
% 0.68/0.90 6 [] {+} product(A,identity,A).
% 0.68/0.90 10 [] {+} product(A,A,identity).
% 0.68/0.90 11 [] {+} product(a,b,c).
% 0.68/0.90 16 [hyper,11,3,10,6] {+} product(c,b,a).
% 0.68/0.90 17 [hyper,11,2,10,5] {+} product(a,c,b).
% 0.68/0.90 32 [hyper,16,2,10,5] {+} product(c,a,b).
% 0.68/0.90 43 [hyper,32,3,17,11] {-} product(b,a,c).
% 0.68/0.90 44 [binary,43.1,4.1] {-} $F.
% 0.68/0.90
% 0.68/0.90 % SZS output end Refutation
% 0.68/0.90 ------------ end of proof -------------
% 0.68/0.90
% 0.68/0.90
% 0.68/0.90 Search stopped by max_proofs option.
% 0.68/0.90
% 0.68/0.90
% 0.68/0.90 Search stopped by max_proofs option.
% 0.68/0.90
% 0.68/0.90 ============ end of search ============
% 0.68/0.90
% 0.68/0.90 ----------- soft-scott stats ----------
% 0.68/0.90
% 0.68/0.90 true clauses given 1 (10.0%)
% 0.68/0.90 false clauses given 9
% 0.68/0.90
% 0.68/0.90 FALSE TRUE
% 0.68/0.90 4 0 1
% 0.68/0.90 5 1 3
% 0.68/0.90 6 3 1
% 0.68/0.90 12 5 8
% 0.68/0.90 13 1 1
% 0.68/0.90 tot: 10 14 (58.3% true)
% 0.68/0.90
% 0.68/0.90
% 0.68/0.90 Model 10 [ 7 0 99 ] (0.00 seconds, 250000 Inserts)
% 0.68/0.90
% 0.68/0.90 That finishes the proof of the theorem.
% 0.68/0.90
% 0.68/0.90 Process 25230 finished Tue Jun 14 04:57:05 2022
%------------------------------------------------------------------------------