TSTP Solution File: GRP130-1.003 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : GRP130-1.003 : TPTP v8.1.0. Released v1.2.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n006.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 : 300s
% DateTime : Wed Jul 27 12:56:29 EDT 2022
% Result : Unsatisfiable 2.44s 2.61s
% Output : Refutation 2.44s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 14
% Syntax : Number of clauses : 44 ( 16 unt; 23 nHn; 44 RR)
% Number of literals : 99 ( 0 equ; 18 neg)
% Maximal clause size : 5 ( 2 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 3 ( 3 usr; 3 con; 0-0 aty)
% Number of variables : 21 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
~ e_qualish(e_1,e_2),
file('GRP130-1.003.p',unknown),
[] ).
cnf(2,axiom,
~ e_qualish(e_1,e_3),
file('GRP130-1.003.p',unknown),
[] ).
cnf(3,axiom,
~ e_qualish(e_2,e_1),
file('GRP130-1.003.p',unknown),
[] ).
cnf(4,axiom,
~ e_qualish(e_2,e_3),
file('GRP130-1.003.p',unknown),
[] ).
cnf(5,axiom,
~ e_qualish(e_3,e_1),
file('GRP130-1.003.p',unknown),
[] ).
cnf(6,axiom,
~ e_qualish(e_3,e_2),
file('GRP130-1.003.p',unknown),
[] ).
cnf(7,axiom,
( ~ group_element(A)
| ~ group_element(B)
| product(A,B,e_1)
| product(A,B,e_2)
| product(A,B,e_3) ),
file('GRP130-1.003.p',unknown),
[] ).
cnf(8,axiom,
( ~ product(A,B,C)
| ~ product(A,B,D)
| e_qualish(C,D) ),
file('GRP130-1.003.p',unknown),
[] ).
cnf(9,axiom,
( ~ product(A,B,C)
| ~ product(A,D,C)
| e_qualish(B,D) ),
file('GRP130-1.003.p',unknown),
[] ).
cnf(10,axiom,
( ~ product(A,B,C)
| ~ product(D,B,C)
| e_qualish(A,D) ),
file('GRP130-1.003.p',unknown),
[] ).
cnf(11,axiom,
( ~ product(A,B,C)
| ~ product(A,C,D)
| product(D,B,A) ),
file('GRP130-1.003.p',unknown),
[] ).
cnf(12,plain,
( ~ group_element(A)
| product(A,A,e_1)
| product(A,A,e_2)
| product(A,A,e_3) ),
inference(factor,[status(thm)],[7]),
[iquote('factor,7.1.2')] ).
cnf(16,plain,
( ~ product(A,B,B)
| product(B,B,A) ),
inference(factor,[status(thm)],[11]),
[iquote('factor,11.1.2')] ).
cnf(17,axiom,
group_element(e_1),
file('GRP130-1.003.p',unknown),
[] ).
cnf(18,axiom,
group_element(e_2),
file('GRP130-1.003.p',unknown),
[] ).
cnf(19,axiom,
group_element(e_3),
file('GRP130-1.003.p',unknown),
[] ).
cnf(21,plain,
( product(e_2,e_2,e_1)
| product(e_2,e_2,e_2)
| product(e_2,e_2,e_3) ),
inference(hyper,[status(thm)],[18,12]),
[iquote('hyper,18,12')] ).
cnf(23,plain,
( product(e_2,e_1,e_1)
| product(e_2,e_1,e_2)
| product(e_2,e_1,e_3) ),
inference(hyper,[status(thm)],[18,7,17]),
[iquote('hyper,18,7,17')] ).
cnf(25,plain,
( product(e_2,e_3,e_1)
| product(e_2,e_3,e_2)
| product(e_2,e_3,e_3) ),
inference(hyper,[status(thm)],[19,7,18]),
[iquote('hyper,19,7,18')] ).
cnf(27,plain,
( product(e_3,e_2,e_1)
| product(e_3,e_2,e_2)
| product(e_3,e_2,e_3) ),
inference(hyper,[status(thm)],[19,7,18]),
[iquote('hyper,19,7,18')] ).
cnf(60,plain,
( product(e_2,e_1,e_2)
| product(e_2,e_1,e_3)
| product(e_2,e_2,e_2)
| product(e_2,e_2,e_3) ),
inference(unit_del,[status(thm)],[inference(hyper,[status(thm)],[23,9,21]),3]),
[iquote('hyper,23,9,21,unit_del,3')] ).
cnf(84,plain,
( product(e_2,e_3,e_2)
| product(e_2,e_3,e_3)
| product(e_2,e_1,e_1)
| product(e_2,e_1,e_3) ),
inference(factor_simp,[status(thm)],[inference(hyper,[status(thm)],[25,11,23])]),
[iquote('hyper,25,11,23,factor_simp')] ).
cnf(91,plain,
( product(e_2,e_3,e_1)
| product(e_2,e_3,e_3)
| product(e_2,e_1,e_2)
| product(e_2,e_1,e_1) ),
inference(factor_simp,[status(thm)],[inference(hyper,[status(thm)],[25,11,23])]),
[iquote('hyper,25,11,23,factor_simp')] ).
cnf(92,plain,
( product(e_2,e_3,e_1)
| product(e_2,e_3,e_3)
| product(e_2,e_2,e_2)
| product(e_2,e_2,e_1) ),
inference(factor_simp,[status(thm)],[inference(hyper,[status(thm)],[25,11,21])]),
[iquote('hyper,25,11,21,factor_simp')] ).
cnf(140,plain,
( product(e_3,e_2,e_1)
| product(e_3,e_2,e_3)
| product(e_2,e_2,e_3) ),
inference(hyper,[status(thm)],[27,16]),
[iquote('hyper,27,16')] ).
cnf(293,plain,
( product(e_2,e_1,e_3)
| product(e_2,e_2,e_2)
| product(e_2,e_2,e_3) ),
inference(factor_simp,[status(thm)],[inference(factor_simp,[status(thm)],[inference(factor_simp,[status(thm)],[inference(hyper,[status(thm)],[60,11,21])])])]),
[iquote('hyper,60,11,21,factor_simp,factor_simp,factor_simp')] ).
cnf(500,plain,
( product(e_2,e_3,e_3)
| product(e_2,e_1,e_1)
| product(e_2,e_1,e_3) ),
inference(factor_simp,[status(thm)],[inference(factor_simp,[status(thm)],[inference(unit_del,[status(thm)],[inference(hyper,[status(thm)],[84,9,23]),2])])]),
[iquote('hyper,84,9,23,unit_del,2,factor_simp,factor_simp')] ).
cnf(530,plain,
( product(e_3,e_2,e_3)
| product(e_2,e_2,e_3)
| product(e_2,e_2,e_2) ),
inference(factor_simp,[status(thm)],[inference(unit_del,[status(thm)],[inference(hyper,[status(thm)],[140,10,21]),4])]),
[iquote('hyper,140,10,21,unit_del,4,factor_simp')] ).
cnf(606,plain,
( product(e_2,e_3,e_1)
| product(e_2,e_3,e_3)
| product(e_2,e_1,e_1) ),
inference(factor_simp,[status(thm)],[inference(factor_simp,[status(thm)],[inference(unit_del,[status(thm)],[inference(hyper,[status(thm)],[91,9,25]),5])])]),
[iquote('hyper,91,9,25,unit_del,5,factor_simp,factor_simp')] ).
cnf(674,plain,
( product(e_2,e_3,e_1)
| product(e_2,e_3,e_3)
| product(e_2,e_2,e_1) ),
inference(factor_simp,[status(thm)],[inference(factor_simp,[status(thm)],[inference(unit_del,[status(thm)],[inference(hyper,[status(thm)],[92,9,25]),6])])]),
[iquote('hyper,92,9,25,unit_del,6,factor_simp,factor_simp')] ).
cnf(1630,plain,
( product(e_2,e_3,e_1)
| product(e_2,e_3,e_3) ),
inference(factor_simp,[status(thm)],[inference(factor_simp,[status(thm)],[inference(unit_del,[status(thm)],[inference(hyper,[status(thm)],[674,9,606]),1])])]),
[iquote('hyper,674,9,606,unit_del,1,factor_simp,factor_simp')] ).
cnf(1661,plain,
( product(e_2,e_3,e_3)
| product(e_2,e_1,e_3) ),
inference(factor_simp,[status(thm)],[inference(unit_del,[status(thm)],[inference(hyper,[status(thm)],[1630,9,500]),2])]),
[iquote('hyper,1630,9,500,unit_del,2,factor_simp')] ).
cnf(1665,plain,
( product(e_2,e_3,e_1)
| product(e_3,e_3,e_2) ),
inference(hyper,[status(thm)],[1630,16]),
[iquote('hyper,1630,16')] ).
cnf(1698,plain,
( product(e_2,e_1,e_3)
| product(e_3,e_3,e_2) ),
inference(hyper,[status(thm)],[1661,16]),
[iquote('hyper,1661,16')] ).
cnf(1707,plain,
( product(e_2,e_1,e_3)
| product(e_2,e_2,e_2) ),
inference(factor_simp,[status(thm)],[inference(unit_del,[status(thm)],[inference(hyper,[status(thm)],[1661,9,293]),4])]),
[iquote('hyper,1661,9,293,unit_del,4,factor_simp')] ).
cnf(1791,plain,
product(e_3,e_3,e_2),
inference(factor_simp,[status(thm)],[inference(factor_simp,[status(thm)],[inference(hyper,[status(thm)],[1698,11,1665])])]),
[iquote('hyper,1698,11,1665,factor_simp,factor_simp')] ).
cnf(1810,plain,
( product(e_2,e_2,e_3)
| product(e_2,e_2,e_2) ),
inference(factor_simp,[status(thm)],[inference(hyper,[status(thm)],[1791,11,530])]),
[iquote('hyper,1791,11,530,factor_simp')] ).
cnf(1812,plain,
( product(e_2,e_2,e_3)
| product(e_3,e_2,e_1) ),
inference(factor_simp,[status(thm)],[inference(hyper,[status(thm)],[1791,11,140])]),
[iquote('hyper,1791,11,140,factor_simp')] ).
cnf(1874,plain,
product(e_2,e_2,e_2),
inference(factor_simp,[status(thm)],[inference(unit_del,[status(thm)],[inference(hyper,[status(thm)],[1810,9,1707]),1])]),
[iquote('hyper,1810,9,1707,unit_del,1,factor_simp')] ).
cnf(1891,plain,
product(e_3,e_2,e_1),
inference(unit_del,[status(thm)],[inference(hyper,[status(thm)],[1812,8,1874]),4]),
[iquote('hyper,1812,8,1874,unit_del,4')] ).
cnf(1895,plain,
product(e_1,e_3,e_3),
inference(hyper,[status(thm)],[1891,11,1791]),
[iquote('hyper,1891,11,1791')] ).
cnf(1903,plain,
product(e_3,e_3,e_1),
inference(hyper,[status(thm)],[1895,16]),
[iquote('hyper,1895,16')] ).
cnf(1907,plain,
e_qualish(e_2,e_3),
inference(hyper,[status(thm)],[1903,9,1891]),
[iquote('hyper,1903,9,1891')] ).
cnf(1908,plain,
$false,
inference(binary,[status(thm)],[1907,4]),
[iquote('binary,1907.1,4.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : GRP130-1.003 : TPTP v8.1.0. Released v1.2.0.
% 0.00/0.12 % Command : otter-tptp-script %s
% 0.13/0.32 % Computer : n006.cluster.edu
% 0.13/0.32 % Model : x86_64 x86_64
% 0.13/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.32 % Memory : 8042.1875MB
% 0.13/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.32 % CPULimit : 300
% 0.13/0.32 % WCLimit : 300
% 0.13/0.32 % DateTime : Wed Jul 27 05:14:16 EDT 2022
% 0.13/0.33 % CPUTime :
% 2.44/2.61 ----- Otter 3.3f, August 2004 -----
% 2.44/2.61 The process was started by sandbox on n006.cluster.edu,
% 2.44/2.61 Wed Jul 27 05:14:17 2022
% 2.44/2.61 The command was "./otter". The process ID is 17946.
% 2.44/2.61
% 2.44/2.61 set(prolog_style_variables).
% 2.44/2.61 set(auto).
% 2.44/2.61 dependent: set(auto1).
% 2.44/2.61 dependent: set(process_input).
% 2.44/2.61 dependent: clear(print_kept).
% 2.44/2.61 dependent: clear(print_new_demod).
% 2.44/2.61 dependent: clear(print_back_demod).
% 2.44/2.61 dependent: clear(print_back_sub).
% 2.44/2.61 dependent: set(control_memory).
% 2.44/2.61 dependent: assign(max_mem, 12000).
% 2.44/2.61 dependent: assign(pick_given_ratio, 4).
% 2.44/2.61 dependent: assign(stats_level, 1).
% 2.44/2.61 dependent: assign(max_seconds, 10800).
% 2.44/2.61 clear(print_given).
% 2.44/2.61
% 2.44/2.61 list(usable).
% 2.44/2.61 0 [] group_element(e_1).
% 2.44/2.61 0 [] group_element(e_2).
% 2.44/2.61 0 [] group_element(e_3).
% 2.44/2.61 0 [] -e_qualish(e_1,e_2).
% 2.44/2.61 0 [] -e_qualish(e_1,e_3).
% 2.44/2.61 0 [] -e_qualish(e_2,e_1).
% 2.44/2.61 0 [] -e_qualish(e_2,e_3).
% 2.44/2.61 0 [] -e_qualish(e_3,e_1).
% 2.44/2.61 0 [] -e_qualish(e_3,e_2).
% 2.44/2.61 0 [] -group_element(X)| -group_element(Y)|product(X,Y,e_1)|product(X,Y,e_2)|product(X,Y,e_3).
% 2.44/2.61 0 [] -product(X,Y,W)| -product(X,Y,Z)|e_qualish(W,Z).
% 2.44/2.61 0 [] -product(X,W,Y)| -product(X,Z,Y)|e_qualish(W,Z).
% 2.44/2.61 0 [] -product(W,Y,X)| -product(Z,Y,X)|e_qualish(W,Z).
% 2.44/2.61 0 [] -product(X,Y,Z1)| -product(X,Z1,Z2)|product(Z2,Y,X).
% 2.44/2.61 end_of_list.
% 2.44/2.61
% 2.44/2.61 SCAN INPUT: prop=0, horn=0, equality=0, symmetry=0, max_lits=5.
% 2.44/2.61
% 2.44/2.61 This is a non-Horn set without equality. The strategy will
% 2.44/2.61 be ordered hyper_res, unit deletion, and factoring, with
% 2.44/2.61 satellites in sos and with nuclei in usable.
% 2.44/2.61
% 2.44/2.61 dependent: set(hyper_res).
% 2.44/2.61 dependent: set(factor).
% 2.44/2.61 dependent: set(unit_deletion).
% 2.44/2.61
% 2.44/2.61 ------------> process usable:
% 2.44/2.61 ** KEPT (pick-wt=3): 1 [] -e_qualish(e_1,e_2).
% 2.44/2.61 ** KEPT (pick-wt=3): 2 [] -e_qualish(e_1,e_3).
% 2.44/2.61 ** KEPT (pick-wt=3): 3 [] -e_qualish(e_2,e_1).
% 2.44/2.61 ** KEPT (pick-wt=3): 4 [] -e_qualish(e_2,e_3).
% 2.44/2.61 ** KEPT (pick-wt=3): 5 [] -e_qualish(e_3,e_1).
% 2.44/2.61 ** KEPT (pick-wt=3): 6 [] -e_qualish(e_3,e_2).
% 2.44/2.61 ** KEPT (pick-wt=16): 7 [] -group_element(A)| -group_element(B)|product(A,B,e_1)|product(A,B,e_2)|product(A,B,e_3).
% 2.44/2.61 ** KEPT (pick-wt=11): 8 [] -product(A,B,C)| -product(A,B,D)|e_qualish(C,D).
% 2.44/2.61 ** KEPT (pick-wt=11): 9 [] -product(A,B,C)| -product(A,D,C)|e_qualish(B,D).
% 2.44/2.61 ** KEPT (pick-wt=11): 10 [] -product(A,B,C)| -product(D,B,C)|e_qualish(A,D).
% 2.44/2.61 ** KEPT (pick-wt=12): 11 [] -product(A,B,C)| -product(A,C,D)|product(D,B,A).
% 2.44/2.61
% 2.44/2.61 ------------> process sos:
% 2.44/2.61 ** KEPT (pick-wt=2): 17 [] group_element(e_1).
% 2.44/2.61 ** KEPT (pick-wt=2): 18 [] group_element(e_2).
% 2.44/2.61 ** KEPT (pick-wt=2): 19 [] group_element(e_3).
% 2.44/2.61
% 2.44/2.61 ======= end of input processing =======
% 2.44/2.61
% 2.44/2.61 =========== start of search ===========
% 2.44/2.61
% 2.44/2.61 -------- PROOF --------
% 2.44/2.61
% 2.44/2.61 ----> UNIT CONFLICT at 0.52 sec ----> 1908 [binary,1907.1,4.1] $F.
% 2.44/2.61
% 2.44/2.61 Length of proof is 29. Level of proof is 14.
% 2.44/2.61
% 2.44/2.61 ---------------- PROOF ----------------
% 2.44/2.61 % SZS status Unsatisfiable
% 2.44/2.61 % SZS output start Refutation
% See solution above
% 2.44/2.61 ------------ end of proof -------------
% 2.44/2.61
% 2.44/2.61
% 2.44/2.61 Search stopped by max_proofs option.
% 2.44/2.61
% 2.44/2.61
% 2.44/2.61 Search stopped by max_proofs option.
% 2.44/2.61
% 2.44/2.61 ============ end of search ============
% 2.44/2.61
% 2.44/2.61 -------------- statistics -------------
% 2.44/2.61 clauses given 229
% 2.44/2.61 clauses generated 18295
% 2.44/2.61 clauses kept 1907
% 2.44/2.61 clauses forward subsumed 16402
% 2.44/2.61 clauses back subsumed 1814
% 2.44/2.61 Kbytes malloced 1953
% 2.44/2.61
% 2.44/2.61 ----------- times (seconds) -----------
% 2.44/2.61 user CPU time 0.52 (0 hr, 0 min, 0 sec)
% 2.44/2.61 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 2.44/2.61 wall-clock time 2 (0 hr, 0 min, 2 sec)
% 2.44/2.61
% 2.44/2.61 That finishes the proof of the theorem.
% 2.44/2.61
% 2.44/2.61 Process 17946 finished Wed Jul 27 05:14:19 2022
% 2.44/2.61 Otter interrupted
% 2.44/2.61 PROOF FOUND
%------------------------------------------------------------------------------