%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : GRP130-2.003 : TPTP v8.1.0. Released v1.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run-snark %s %d
% Computer : n018.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:36:58 EDT 2022
% Result : Unsatisfiable 0.41s 0.57s
% Output : Refutation 0.41s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 15
% Syntax : Number of clauses : 44 ( 22 unt; 17 nHn; 44 RR)
% Number of literals : 85 ( 0 equ; 25 neg)
% Maximal clause size : 5 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 6 ( 5 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(e_1_then_e_2,axiom,
next(e_1,e_2),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',e_1_then_e_2) ).
cnf(e_3_greater_e_2,axiom,
greater(e_3,e_2),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',e_3_greater_e_2) ).
cnf(no_redundancy,axiom,
( ~ product(X,e_1,Y)
| ~ next(X,Z)
| ~ greater(Y,Z) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',no_redundancy) ).
cnf(element_1,axiom,
group_element(e_1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',element_1) ).
cnf(element_2,axiom,
group_element(e_2),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',element_2) ).
cnf(element_3,axiom,
group_element(e_3),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',element_3) ).
cnf(e_1_is_not_e_2,axiom,
~ equalish(e_1,e_2),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',e_1_is_not_e_2) ).
cnf(e_1_is_not_e_3,axiom,
~ equalish(e_1,e_3),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',e_1_is_not_e_3) ).
cnf(e_2_is_not_e_1,axiom,
~ equalish(e_2,e_1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',e_2_is_not_e_1) ).
cnf(e_2_is_not_e_3,axiom,
~ equalish(e_2,e_3),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',e_2_is_not_e_3) ).
cnf(product_total_function1,axiom,
( ~ group_element(X)
| ~ group_element(Y)
| product(X,Y,e_1)
| product(X,Y,e_2)
| product(X,Y,e_3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',product_total_function1) ).
cnf(product_total_function2,axiom,
( ~ product(X,Y,Z)
| ~ product(X,Y,U)
| equalish(Z,U) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',product_total_function2) ).
cnf(product_right_cancellation,axiom,
( ~ product(X,Y,Z)
| ~ product(X,U,Z)
| equalish(Y,U) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',product_right_cancellation) ).
cnf(product_left_cancellation,axiom,
( ~ product(X,Y,Z)
| ~ product(U,Y,Z)
| equalish(X,U) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',product_left_cancellation) ).
cnf(qg3,negated_conjecture,
( ~ product(X,Y,Z)
| ~ product(X,Z,U)
| product(U,Y,X) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',qg3) ).
cnf(21,plain,
~ product(e_1,e_1,e_3),
inference('UR-RESOLVE',[status(thm)],[no_redundancy,e_1_then_e_2,e_3_greater_e_2]) ).
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('HYPERRESOLVE',[status(thm)],[product_total_function1,element_2,element_3]) ).
cnf(27,plain,
( product(e_2,e_1,e_1)
| product(e_2,e_1,e_2)
| product(e_2,e_1,e_3) ),
inference('HYPERRESOLVE',[status(thm)],[product_total_function1,element_2,element_1]) ).
cnf(28,plain,
( product(e_1,e_3,e_1)
| product(e_1,e_3,e_2)
| product(e_1,e_3,e_3) ),
inference('HYPERRESOLVE',[status(thm)],[product_total_function1,element_1,element_3]) ).
cnf(29,plain,
( product(e_1,e_2,e_1)
| product(e_1,e_2,e_2)
| product(e_1,e_2,e_3) ),
inference('HYPERRESOLVE',[status(thm)],[product_total_function1,element_1,element_2]) ).
cnf(30,plain,
( product(e_1,e_1,e_1)
| product(e_1,e_1,e_2) ),
inference('REWRITE',[status(thm)],[inference('HYPERRESOLVE',[status(thm)],[product_total_function1,element_1,element_1]),21]) ).
cnf(31,plain,
~ product(e_3,e_1,e_1),
inference('UR-RESOLVE',[status(thm)],[qg3,21]) ).
cnf(50,plain,
( product(e_2,e_1,e_1)
| product(e_2,e_1,e_2)
| product(e_2,e_3,e_1)
| product(e_2,e_3,e_2) ),
inference('REWRITE',[status(thm)],[inference('HYPERRESOLVE',[status(thm)],[product_right_cancellation,27,25]),e_1_is_not_e_3]) ).
cnf(55,plain,
( product(e_1,e_2,e_1)
| product(e_1,e_2,e_2)
| product(e_1,e_1,e_1) ),
inference('REWRITE',[status(thm)],[inference('HYPERRESOLVE',[status(thm)],[qg3,29,30]),31]) ).
cnf(58,plain,
( product(e_1,e_2,e_1)
| product(e_1,e_2,e_2)
| product(e_1,e_3,e_1)
| product(e_1,e_3,e_2) ),
inference('REWRITE',[status(thm)],[inference('HYPERRESOLVE',[status(thm)],[product_right_cancellation,29,28]),e_2_is_not_e_3]) ).
cnf(74,plain,
( product(e_1,e_2,e_1)
| product(e_1,e_1,e_1) ),
inference('REWRITE',[status(thm)],[inference('HYPERRESOLVE',[status(thm)],[product_right_cancellation,55,30]),e_2_is_not_e_1]) ).
cnf(75,plain,
product(e_1,e_1,e_1),
inference('HYPERRESOLVE',[status(thm)],[qg3,74,30]) ).
cnf(77,plain,
~ product(e_2,e_1,e_1),
inference('UR-RESOLVE',[status(thm)],[product_left_cancellation,75,e_1_is_not_e_2]) ).
cnf(78,plain,
( product(e_2,e_1,e_2)
| product(e_2,e_1,e_3) ),
inference('REWRITE',[status(thm)],[27,77]) ).
cnf(80,plain,
( product(e_2,e_1,e_2)
| product(e_2,e_3,e_1)
| product(e_2,e_3,e_2) ),
inference('REWRITE',[status(thm)],[50,77]) ).
cnf(84,plain,
~ product(e_1,e_2,e_1),
inference('UR-RESOLVE',[status(thm)],[product_right_cancellation,75,e_1_is_not_e_2]) ).
cnf(85,plain,
( product(e_1,e_2,e_2)
| product(e_1,e_2,e_3) ),
inference('REWRITE',[status(thm)],[29,84]) ).
cnf(88,plain,
( product(e_1,e_2,e_2)
| product(e_1,e_3,e_1)
| product(e_1,e_3,e_2) ),
inference('REWRITE',[status(thm)],[58,84]) ).
cnf(89,plain,
~ product(e_1,e_3,e_1),
inference('UR-RESOLVE',[status(thm)],[product_right_cancellation,75,e_1_is_not_e_3]) ).
cnf(96,plain,
( product(e_1,e_2,e_2)
| product(e_1,e_3,e_2) ),
inference('REWRITE',[status(thm)],[88,89]) ).
cnf(97,plain,
~ product(e_1,e_1,e_2),
inference('UR-RESOLVE',[status(thm)],[product_total_function2,75,e_1_is_not_e_2]) ).
cnf(99,plain,
( product(e_1,e_2,e_2)
| product(e_2,e_2,e_1) ),
inference('HYPERRESOLVE',[status(thm)],[qg3,96,85]) ).
cnf(108,plain,
product(e_2,e_2,e_1),
inference('HYPERRESOLVE',[status(thm)],[qg3,99,99]) ).
cnf(120,plain,
~ product(e_2,e_3,e_1),
inference('UR-RESOLVE',[status(thm)],[product_right_cancellation,108,e_2_is_not_e_3]) ).
cnf(123,plain,
( product(e_2,e_1,e_2)
| product(e_2,e_3,e_2) ),
inference('REWRITE',[status(thm)],[80,120]) ).
cnf(133,plain,
~ product(e_2,e_1,e_2),
inference('UR-RESOLVE',[status(thm)],[qg3,108,97]) ).
cnf(134,plain,
product(e_2,e_1,e_3),
inference('REWRITE',[status(thm)],[78,133]) ).
cnf(137,plain,
product(e_2,e_3,e_2),
inference('REWRITE',[status(thm)],[123,133]) ).
cnf(146,plain,
$false,
inference('REWRITE',[status(thm)],[inference('HYPERRESOLVE',[status(thm)],[qg3,137,134]),133]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : GRP130-2.003 : TPTP v8.1.0. Released v1.2.0.
% 0.03/0.13 % Command : run-snark %s %d
% 0.13/0.34 % Computer : n018.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Mon Jun 13 06:07:12 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.21/0.46 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.21/0.47 *
% 0.21/0.47 *
% 0.21/0.48 #<PACKAGE "SNARK-USER">
% 0.21/0.48 *
% 0.21/0.48 SNARK-TPTP-OPTIONS
% 0.21/0.48 *
% 0.21/0.48 ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.21/0.48 (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.21/0.48 (USE-FACTORING :POS)
% 0.21/0.48 (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.21/0.48 (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.21/0.48 (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.21/0.48 (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.21/0.48 (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.21/0.48 (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.21/0.48 (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.21/0.48 (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.21/0.48 (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.21/0.48 (DECLARE-TPTP-SYMBOLS2))
% 0.21/0.48 *
% 0.21/0.48 "."
% 0.21/0.48 *
% 0.21/0.48 ; Begin refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-06-13T06:07:12
% 0.21/0.48 ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n018.cluster.edu at 2022-06-13T06:07:12
% 0.41/0.57
% 0.41/0.57
% 0.41/0.57 #||
% 0.41/0.57 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.41/0.57 % SZS output start Refutation
% See solution above
% 0.41/0.58 ||#
% 0.41/0.58
% 0.41/0.58 ; Summary of computation:
% 0.41/0.58 ; 629 formulas have been input or derived (from 68 formulas).
% 0.41/0.58 ; 146 (23%) were retained. Of these,
% 0.41/0.58 ; 96 (66%) were simplified or subsumed later,
% 0.41/0.58 ; 50 (34%) are still being kept.
% 0.41/0.58 ;
% 0.41/0.58 ; Run time in seconds excluding printing time:
% 0.41/0.58 ; 0.003 3% Read assertion file (1 call)
% 0.41/0.58 ; 0.000 0% Assert (20 calls)
% 0.41/0.58 ; 0.012 13% Process new row (499 calls)
% 0.41/0.58 ; 0.015 16% Resolution (134 calls)
% 0.41/0.58 ; 0.001 1% Paramodulation (67 calls)
% 0.41/0.58 ; 0.000 0% Factoring (30 calls)
% 0.41/0.58 ; 0.002 2% Condensing (236 calls)
% 0.41/0.58 ; 0.010 11% Forward subsumption (236 calls)
% 0.41/0.58 ; 0.004 4% Backward subsumption (103 calls)
% 0.41/0.58 ; 0.002 2% Clause clause subsumption (1,102 calls)
% 0.41/0.58 ; 0.011 12% Forward simplification (436 calls)
% 0.41/0.58 ; 0.003 3% Backward simplification (146 calls)
% 0.41/0.58 ; 0.001 1% Ordering (396 calls)
% 0.41/0.58 ; 0.001 1% Sortal reasoning (32 calls)
% 0.41/0.58 ; 0.001 1% Purity testing (1 call)
% 0.41/0.58 ; 0.025 27% Other
% 0.41/0.58 ; 0.091 Total
% 0.41/0.58 ; 0.096 Real time
% 0.41/0.58 ;
% 0.41/0.58 ; Term-hash-array has 65 terms in all.
% 0.41/0.58 ; Feature-vector-row-index has 7 entries (42 at peak, 103 added, 96 deleted).
% 0.41/0.58 ; Feature-vector-row-index has 20 nodes (133 at peak, 242 added, 222 deleted).
% 0.41/0.58 ; Retrieved 1,289 possibly forward subsuming rows in 236 calls.
% 0.41/0.58 ; Retrieved 404 possibly backward subsumed rows in 103 calls.
% 0.41/0.58 ; Path-index has 65 entries (68 at peak, 82 added, 17 deleted).
% 0.41/0.58 ; Path-index has 57 nodes (57 at peak, 57 added, 0 deleted).
% 0.41/0.58 ; Trie-index has 65 entries (68 at peak, 82 added, 17 deleted).
% 0.41/0.58 ; Trie-index has 89 nodes (92 at peak, 106 added, 17 deleted).
% 0.41/0.58 ; Retrieved 271 generalization terms in 1,197 calls.
% 0.41/0.58 ; Retrieved 42 instance terms in 42 calls.
% 0.41/0.58 ; Retrieved 3,064 unifiable terms in 825 calls.
% 0.41/0.58 ;
% 0.41/0.58 ; The agenda of rows to process has 14 entries:
% 0.41/0.58 ; 13 with value 8 1 with value 10
% 0.41/0.58 ; The agenda of rows to give has 11 entries:
% 0.41/0.58 ; 2 with value (4 7) 2 with value (4 9) 1 with value (4 11)
% 0.41/0.58 ; 2 with value (4 8) 4 with value (4 10)
% 0.41/0.58 Evaluation took:
% 0.41/0.58 0.096 seconds of real time
% 0.41/0.58 0.079378 seconds of user run time
% 0.41/0.58 0.017088 seconds of system run time
% 0.41/0.58 0 calls to %EVAL
% 0.41/0.58 0 page faults and
% 0.41/0.58 7,255,912 bytes consed.
% 0.41/0.58 :PROOF-FOUND
% 0.41/0.58 ; End refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-06-13T06:07:12
% 0.41/0.58 :PROOF-FOUND
% 0.41/0.58 *
%------------------------------------------------------------------------------