%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : GRP594-1 : TPTP v8.1.0. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : run-snark %s %d
% Computer : n027.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:39:34 EDT 2022
% Result : Unsatisfiable 0.19s 0.60s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 3
% Syntax : Number of clauses : 31 ( 31 unt; 0 nHn; 4 RR)
% Number of literals : 31 ( 30 equ; 3 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 8 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 85 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(single_axiom,axiom,
inverse(double_divide(double_divide(X,Y),inverse(double_divide(X,inverse(double_divide(Z,Y)))))) = Z,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',single_axiom) ).
cnf(multiply,axiom,
multiply(X,Y) = inverse(double_divide(Y,X)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',multiply) ).
cnf(prove_these_axioms_2,negated_conjecture,
multiply(multiply(inverse(b2),b2),a2) != a2,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_these_axioms_2) ).
cnf(4,plain,
inverse(double_divide(a2,inverse(double_divide(b2,inverse(b2))))) != a2,
inference('REWRITE',[status(thm)],[prove_these_axioms_2,multiply,theory(equality)]) ).
cnf(5,plain,
inverse(double_divide(double_divide(double_divide(X,Y),inverse(double_divide(Z,Y))),Z)) = X,
inference('PARAMODULATE',[status(thm)],[single_axiom,single_axiom,theory(equality)]) ).
cnf(8,plain,
inverse(double_divide(double_divide(X,Y),inverse(double_divide(X,Z)))) = double_divide(double_divide(Z,U),inverse(double_divide(Y,U))),
inference('PARAMODULATE',[status(thm)],[single_axiom,5,theory(equality)]) ).
cnf(15,plain,
double_divide(double_divide(inverse(double_divide(X,Y)),Z),inverse(double_divide(Y,Z))) = X,
inference('PARAMODULATE',[status(thm)],[single_axiom,8,theory(equality)]) ).
cnf(16,plain,
double_divide(double_divide(X,Y),inverse(double_divide(Z,Y))) = double_divide(double_divide(X,U),inverse(double_divide(Z,U))),
inference('PARAMODULATE',[status(thm)],[8,8,theory(equality)]) ).
cnf(17,plain,
inverse(double_divide(inverse(double_divide(double_divide(X,Y),inverse(double_divide(X,Z)))),Y)) = Z,
inference('PARAMODULATE',[status(thm)],[5,8,theory(equality)]) ).
cnf(44,plain,
inverse(double_divide(double_divide(double_divide(inverse(double_divide(X,Y)),Z),Z),inverse(X))) = Y,
inference('PARAMODULATE',[status(thm)],[single_axiom,15,theory(equality)]) ).
cnf(50,plain,
double_divide(double_divide(X,Y),inverse(double_divide(inverse(double_divide(Z,inverse(double_divide(X,U)))),Y))) = double_divide(Z,U),
inference('PARAMODULATE',[status(thm)],[15,single_axiom,theory(equality)]) ).
cnf(87,plain,
inverse(double_divide(inverse(double_divide(double_divide(X,Y),inverse(double_divide(X,Y)))),Z)) = Z,
inference('PARAMODULATE',[status(thm)],[17,16,theory(equality)]) ).
cnf(110,plain,
double_divide(double_divide(X,inverse(Y)),Z) = double_divide(double_divide(X,U),inverse(double_divide(double_divide(double_divide(inverse(double_divide(Y,Z)),V),V),U))),
inference('PARAMODULATE',[status(thm)],[16,44,theory(equality)]) ).
cnf(112,plain,
inverse(double_divide(double_divide(X,double_divide(double_divide(inverse(double_divide(Y,Z)),U),U)),inverse(double_divide(X,V)))) = double_divide(double_divide(V,inverse(Y)),Z),
inference('PARAMODULATE',[status(thm)],[8,44,theory(equality)]) ).
cnf(122,plain,
inverse(double_divide(inverse(double_divide(X,inverse(X))),Y)) = Y,
inference('PARAMODULATE',[status(thm)],[87,15,theory(equality)]) ).
cnf(129,plain,
inverse(double_divide(double_divide(double_divide(X,Y),Y),inverse(inverse(double_divide(Z,inverse(Z)))))) = X,
inference('PARAMODULATE',[status(thm)],[44,122,theory(equality)]) ).
cnf(133,plain,
double_divide(double_divide(X,Y),Y) = double_divide(double_divide(X,Z),Z),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[16,122,theory(equality)]),122,theory(equality)]) ).
cnf(146,plain,
inverse(double_divide(double_divide(double_divide(inverse(double_divide(X,Y)),inverse(X)),Z),Z)) = Y,
inference('PARAMODULATE',[status(thm)],[44,133,theory(equality)]) ).
cnf(151,plain,
double_divide(X,inverse(double_divide(Y,Z))) = double_divide(double_divide(double_divide(inverse(double_divide(X,Y)),Z),U),U),
inference('PARAMODULATE',[status(thm)],[133,15,theory(equality)]) ).
cnf(152,plain,
inverse(double_divide(X,inverse(double_divide(Y,inverse(X))))) = Y,
inference('REWRITE',[status(thm)],[146,151,theory(equality)]) ).
cnf(156,plain,
inverse(double_divide(double_divide(double_divide(X,inverse(double_divide(Y,Z))),Z),inverse(double_divide(double_divide(X,U),U)))) = Y,
inference('PARAMODULATE',[status(thm)],[single_axiom,133,theory(equality)]) ).
cnf(172,plain,
X = inverse(double_divide(X,inverse(inverse(double_divide(Y,inverse(Y)))))),
inference('PARAMODULATE',[status(thm)],[122,152,theory(equality)]) ).
cnf(173,plain,
double_divide(double_divide(X,Y),Y) = X,
inference('REWRITE',[status(thm)],[129,172,theory(equality)]) ).
cnf(180,plain,
inverse(double_divide(double_divide(double_divide(X,inverse(double_divide(Y,Z))),Z),inverse(X))) = Y,
inference('REWRITE',[status(thm)],[156,173,theory(equality)]) ).
cnf(182,plain,
double_divide(X,inverse(double_divide(Y,Z))) = double_divide(inverse(double_divide(X,Y)),Z),
inference('REWRITE',[status(thm)],[151,173,theory(equality)]) ).
cnf(184,plain,
inverse(double_divide(inverse(double_divide(a2,b2)),inverse(b2))) != a2,
inference('REWRITE',[status(thm)],[4,182,theory(equality)]) ).
cnf(204,plain,
double_divide(double_divide(X,inverse(Y)),Z) = double_divide(double_divide(X,U),inverse(double_divide(inverse(double_divide(Y,Z)),U))),
inference('REWRITE',[status(thm)],[110,173,theory(equality)]) ).
cnf(205,plain,
double_divide(double_divide(X,inverse(Y)),inverse(double_divide(X,Z))) = double_divide(Y,Z),
inference('REWRITE',[status(thm)],[50,204,theory(equality)]) ).
cnf(211,plain,
inverse(double_divide(double_divide(X,Y),Z)) = double_divide(double_divide(Z,inverse(X)),Y),
inference('REWRITE',[status(thm)],[112,205,173,theory(equality)]) ).
cnf(218,plain,
inverse(double_divide(inverse(double_divide(X,Y)),inverse(Y))) = X,
inference('REWRITE',[status(thm)],[180,173,211,theory(equality)]) ).
cnf(219,plain,
$false,
inference('REWRITE',[status(thm)],[184,218,theory(equality)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : GRP594-1 : TPTP v8.1.0. Released v2.6.0.
% 0.11/0.13 % Command : run-snark %s %d
% 0.13/0.34 % Computer : n027.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.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Mon Jun 13 08:01:17 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.19/0.46 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.47 *
% 0.19/0.47 *
% 0.19/0.47 #<PACKAGE "SNARK-USER">
% 0.19/0.47 *
% 0.19/0.47 SNARK-TPTP-OPTIONS
% 0.19/0.47 *
% 0.19/0.48 ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.19/0.48 (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.19/0.48 (USE-FACTORING :POS)
% 0.19/0.48 (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.19/0.48 (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.19/0.48 (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.19/0.48 (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.19/0.48 (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.19/0.48 (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.19/0.48 (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.19/0.48 (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.19/0.48 (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.19/0.48 (DECLARE-TPTP-SYMBOLS2))
% 0.19/0.48 *
% 0.19/0.48 "."
% 0.19/0.48 *
% 0.19/0.48 ; Begin refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-06-13T08:01:17
% 0.19/0.48 ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n027.cluster.edu at 2022-06-13T08:01:17
% 0.19/0.60
% 0.19/0.60
% 0.19/0.60 #||
% 0.19/0.60 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.60 % SZS output start Refutation
% See solution above
% 0.42/0.60 ||#
% 0.42/0.60
% 0.42/0.60 ; Summary of computation:
% 0.42/0.60 ; 475 formulas have been input or derived (from 15 formulas).
% 0.42/0.60 ; 219 (46%) were retained. Of these,
% 0.42/0.60 ; 104 (47%) were simplified or subsumed later,
% 0.42/0.60 ; 115 (53%) are still being kept.
% 0.42/0.60 ;
% 0.42/0.60 ; Run time in seconds excluding printing time:
% 0.42/0.60 ; 0.001 1% Read assertion file (1 call)
% 0.42/0.60 ; 0.001 1% Assert (3 calls)
% 0.42/0.60 ; 0.030 25% Process new row (416 calls)
% 0.42/0.60 ; 0.000 0% Resolution (28 calls)
% 0.42/0.60 ; 0.013 11% Paramodulation (14 calls)
% 0.42/0.60 ; 0.028 24% Forward simplification (389 calls)
% 0.42/0.60 ; 0.011 9% Backward simplification (218 calls)
% 0.42/0.60 ; 0.009 8% Ordering (1,285 calls)
% 0.42/0.60 ; 0.000 0% Sortal reasoning (32 calls)
% 0.42/0.60 ; 0.000 0% Purity testing (1 call)
% 0.42/0.60 ; 0.026 22% Other
% 0.42/0.60 ; 0.119 Total
% 0.42/0.60 ; 0.122 Real time
% 0.42/0.60 ;
% 0.42/0.60 ; Term-hash-array has 1,000 terms in all.
% 0.42/0.60 ; Feature-vector-row-index has 0 entries (0 at peak, 0 added, 0 deleted).
% 0.42/0.60 ; Feature-vector-row-index has 1 node (1 at peak, 1 added, 0 deleted).
% 0.42/0.60 ; Path-index has 572 entries (828 at peak, 1,025 added, 453 deleted).
% 0.42/0.60 ; Path-index has 2,197 nodes (2,402 at peak, 2,542 added, 345 deleted).
% 0.42/0.60 ; Trie-index has 572 entries (828 at peak, 1,025 added, 453 deleted).
% 0.42/0.60 ; Trie-index has 2,924 nodes (4,240 at peak, 4,928 added, 2,004 deleted).
% 0.42/0.60 ; Retrieved 663 generalization terms in 3,523 calls.
% 0.42/0.60 ; Retrieved 1,293 instance terms in 242 calls.
% 0.42/0.60 ; Retrieved 1,727 unifiable terms in 128 calls.
% 0.42/0.60 ;
% 0.42/0.60 ; The agenda of backward simplifiable rows to process has 26 entries:
% 0.42/0.60 ; 26 with value 0
% 0.42/0.60 ; The agenda of rows to process has 32 entries:
% 0.42/0.60 ; 2 with value 26 1 with value 31 4 with value 35
% 0.42/0.60 ; 2 with value 27 3 with value 32 1 with value 37
% 0.42/0.60 ; 5 with value 28 5 with value 33 1 with value 38
% 0.42/0.60 ; 2 with value 29 1 with value 34 1 with value 39
% 0.42/0.60 ; 4 with value 30
% 0.42/0.60 ; The agenda of rows to give has 109 entries:
% 0.42/0.60 ; 1 with value (4 16) 4 with value (4 26) 6 with value (4 34)
% 0.42/0.60 ; 1 with value (4 18) 3 with value (4 27) 14 with value (4 35)
% 0.42/0.60 ; 1 with value (4 20) 4 with value (4 28) 8 with value (4 36)
% 0.42/0.60 ; 1 with value (4 21) 6 with value (4 29) 6 with value (4 37)
% 0.42/0.60 ; 5 with value (4 22) 5 with value (4 30) 6 with value (4 38)
% 0.42/0.60 ; 1 with value (4 23) 4 with value (4 31) 7 with value (4 39)
% 0.42/0.60 ; 3 with value (4 24) 11 with value (4 32) 2 with value (4 40)
% 0.42/0.60 ; 3 with value (4 25) 7 with value (4 33)
% 0.42/0.60 Evaluation took:
% 0.42/0.60 0.122 seconds of real time
% 0.42/0.60 0.114127 seconds of user run time
% 0.42/0.60 0.008564 seconds of system run time
% 0.42/0.60 0 calls to %EVAL
% 0.42/0.60 0 page faults and
% 0.42/0.60 9,359,312 bytes consed.
% 0.42/0.60 :PROOF-FOUND
% 0.42/0.60 ; End refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-06-13T08:01:17
% 0.42/0.60 :PROOF-FOUND
% 0.42/0.60 *
%------------------------------------------------------------------------------