TSTP Solution File: GRP001+6 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : GRP001+6 : TPTP v8.1.0. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n026.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:55 EDT 2022
% Result : Theorem 0.89s 1.09s
% Output : Refutation 0.89s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13 % Problem : GRP001+6 : TPTP v8.1.0. Released v3.1.0.
% 0.04/0.14 % Command : sos-script %s
% 0.14/0.35 % Computer : n026.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 600
% 0.14/0.35 % DateTime : Mon Jun 13 14:57:06 EDT 2022
% 0.14/0.35 % CPUTime :
% 0.20/0.37 ----- Otter 3.2, August 2001 -----
% 0.20/0.37 The process was started by sandbox2 on n026.cluster.edu,
% 0.20/0.37 Mon Jun 13 14:57:06 2022
% 0.20/0.37 The command was "./sos". The process ID is 14497.
% 0.20/0.37
% 0.20/0.37 set(prolog_style_variables).
% 0.20/0.37 set(auto).
% 0.20/0.37 dependent: set(auto1).
% 0.20/0.37 dependent: set(process_input).
% 0.20/0.37 dependent: clear(print_kept).
% 0.20/0.37 dependent: clear(print_new_demod).
% 0.20/0.37 dependent: clear(print_back_demod).
% 0.20/0.37 dependent: clear(print_back_sub).
% 0.20/0.37 dependent: set(control_memory).
% 0.20/0.37 dependent: assign(max_mem, 12000).
% 0.20/0.37 dependent: assign(pick_given_ratio, 4).
% 0.20/0.37 dependent: assign(stats_level, 1).
% 0.20/0.37 dependent: assign(pick_semantic_ratio, 3).
% 0.20/0.37 dependent: assign(sos_limit, 5000).
% 0.20/0.37 dependent: assign(max_weight, 60).
% 0.20/0.37 clear(print_given).
% 0.20/0.37
% 0.20/0.37 formula_list(usable).
% 0.20/0.37
% 0.20/0.37 SCAN INPUT: prop=0, horn=1, equality=0, symmetry=0, max_lits=4.
% 0.20/0.37
% 0.20/0.37 This is a Horn set without equality. The strategy will
% 0.20/0.37 be hyperresolution, with satellites in sos and nuclei
% 0.20/0.37 in usable.
% 0.20/0.37
% 0.20/0.37 dependent: set(hyper_res).
% 0.20/0.37 dependent: clear(order_hyper).
% 0.20/0.37
% 0.20/0.37 ------------> process usable:
% 0.20/0.37
% 0.20/0.37 ------------> process sos:
% 0.20/0.37
% 0.20/0.37 ======= end of input processing =======
% 0.20/0.42
% 0.20/0.42 Model 1 (0.00 seconds, 0 Inserts)
% 0.20/0.42
% 0.20/0.42 Stopped by limit on number of solutions
% 0.20/0.42
% 0.20/0.42
% 0.20/0.42 -------------- Softie stats --------------
% 0.20/0.42
% 0.20/0.42 UPDATE_STOP: 300
% 0.20/0.42 SFINDER_TIME_LIMIT: 2
% 0.20/0.42 SHORT_CLAUSE_CUTOFF: 4
% 0.20/0.42 number of clauses in intial UL: 3
% 0.20/0.42 number of clauses initially in problem: 10
% 0.20/0.42 percentage of clauses intially in UL: 30
% 0.20/0.42 percentage of distinct symbols occuring in initial UL: 57
% 0.20/0.42 percent of all initial clauses that are short: 100
% 0.20/0.42 absolute distinct symbol count: 7
% 0.20/0.42 distinct predicate count: 1
% 0.20/0.42 distinct function count: 2
% 0.20/0.42 distinct constant count: 4
% 0.20/0.42
% 0.20/0.42 ---------- no more Softie stats ----------
% 0.20/0.42
% 0.20/0.42
% 0.20/0.42
% 0.20/0.42 Model 2 (0.00 seconds, 0 Inserts)
% 0.20/0.42
% 0.20/0.42 Stopped by limit on number of solutions
% 0.20/0.42
% 0.20/0.42 =========== start of search ===========
% 0.89/1.09
% 0.89/1.09 -------- PROOF --------
% 0.89/1.09 % SZS status Theorem
% 0.89/1.09 % SZS output start Refutation
% 0.89/1.09
% 0.89/1.09 Model 3 (0.00 seconds, 0 Inserts)
% 0.89/1.09
% 0.89/1.09 Stopped by limit on number of solutions
% 0.89/1.09
% 0.89/1.09 Model 4 (0.00 seconds, 0 Inserts)
% 0.89/1.09
% 0.89/1.09 Stopped by limit on number of solutions
% 0.89/1.09
% 0.89/1.09 Stopped by limit on insertions
% 0.89/1.09
% 0.89/1.09 Model 5 [ 1 3 34186 ] (0.00 seconds, 250000 Inserts)
% 0.89/1.09
% 0.89/1.09 Model 6 [ 1 1 3832 ] (0.00 seconds, 125521 Inserts)
% 0.89/1.09
% 0.89/1.09 Model 7 [ 1 2 60 ] (0.00 seconds, 44319 Inserts)
% 0.89/1.09
% 0.89/1.09 Stopped by limit on insertions
% 0.89/1.09
% 0.89/1.09 Model 8 [ 3 1 46 ] (0.00 seconds, 250000 Inserts)
% 0.89/1.09
% 0.89/1.09 Model 9 [ 2 1 2955 ] (0.00 seconds, 179621 Inserts)
% 0.89/1.09
% 0.89/1.09 Model 10 [ 3 2 25722 ] (0.00 seconds, 182789 Inserts)
% 0.89/1.09
% 0.89/1.09 Stopped by limit on insertions
% 0.89/1.09
% 0.89/1.09 Model 11 [ 3 2 28086 ] (0.00 seconds, 250000 Inserts)
% 0.89/1.09
% 0.89/1.09 Stopped by limit on insertions
% 0.89/1.09
% 0.89/1.09 Model 12 [ 4 1 174 ] (0.00 seconds, 250000 Inserts)
% 0.89/1.09
% 0.89/1.09 ----> UNIT CONFLICT at 0.68 sec ----> 354 [binary,353.1,3.1] {-} $F.
% 0.89/1.09
% 0.89/1.09 Length of proof is 4. Level of proof is 3.
% 0.89/1.09
% 0.89/1.09 ---------------- PROOF ----------------
% 0.89/1.09 % SZS status Theorem
% 0.89/1.09 % SZS output start Refutation
% 0.89/1.09
% 0.89/1.09 1 [] {+} -product(A,B,C)| -product(B,D,E)| -product(C,D,F)|product(A,E,F).
% 0.89/1.09 2 [] {+} -product(A,B,C)| -product(B,D,E)| -product(A,E,F)|product(C,D,F).
% 0.89/1.09 3 [] {+} -product($c2,$c3,$c1).
% 0.89/1.09 5 [] {+} product(A,$c4,A).
% 0.89/1.09 6 [] {+} product($c4,A,A).
% 0.89/1.09 9 [] {+} product(A,A,$c4).
% 0.89/1.09 10 [] {+} product($c3,$c2,$c1).
% 0.89/1.09 48 [hyper,9,2,10,5] {+} product($c1,$c2,$c3).
% 0.89/1.09 63 [hyper,9,1,10,6] {+} product($c3,$c1,$c2).
% 0.89/1.09 116 [hyper,48,1,9,6] {+} product($c1,$c3,$c2).
% 0.89/1.09 353 [hyper,116,2,63,10] {-} product($c2,$c3,$c1).
% 0.89/1.09 354 [binary,353.1,3.1] {-} $F.
% 0.89/1.09
% 0.89/1.09 % SZS output end Refutation
% 0.89/1.09 ------------ end of proof -------------
% 0.89/1.09
% 0.89/1.09
% 0.89/1.09 Search stopped by max_proofs option.
% 0.89/1.09
% 0.89/1.09
% 0.89/1.09 Search stopped by max_proofs option.
% 0.89/1.09
% 0.89/1.09 ============ end of search ============
% 0.89/1.09
% 0.89/1.09 ----------- soft-scott stats ----------
% 0.89/1.09
% 0.89/1.09 true clauses given 1 (8.3%)
% 0.89/1.09 false clauses given 11
% 0.89/1.09
% 0.89/1.09 FALSE TRUE
% 0.89/1.09 4 0 1
% 0.89/1.09 5 7 5
% 0.89/1.09 6 20 50
% 0.89/1.09 7 12 45
% 0.89/1.09 8 5 42
% 0.89/1.09 9 1 16
% 0.89/1.09 10 1 8
% 0.89/1.09 11 2 10
% 0.89/1.09 12 1 48
% 0.89/1.09 13 0 22
% 0.89/1.09 14 0 7
% 0.89/1.09 16 0 2
% 0.89/1.09 17 0 1
% 0.89/1.09 18 0 5
% 0.89/1.09 tot: 49 262 (84.2% true)
% 0.89/1.09
% 0.89/1.09
% 0.89/1.09 Model 12 [ 4 1 174 ] (0.00 seconds, 250000 Inserts)
% 0.89/1.09
% 0.89/1.09 That finishes the proof of the theorem.
% 0.89/1.09
% 0.89/1.09 Process 14497 finished Mon Jun 13 14:57:06 2022
%------------------------------------------------------------------------------