%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : GRP611-1 : TPTP v8.1.0. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : run-snark %s %d
% Computer : n004.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:39 EDT 2022
% Result : Unsatisfiable 0.42s 0.60s
% Output : Refutation 0.42s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 3
% Syntax : Number of clauses : 29 ( 29 unt; 0 nHn; 3 RR)
% Number of literals : 29 ( 28 equ; 2 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 : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 86 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(single_axiom,axiom,
inverse(double_divide(inverse(double_divide(inverse(double_divide(X,Y)),Z)),double_divide(X,Z))) = Y,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',single_axiom) ).
cnf(multiply,axiom,
multiply(X,Y) = inverse(double_divide(Y,X)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',multiply) ).
cnf(prove_these_axioms_3,negated_conjecture,
multiply(multiply(a3,b3),c3) != multiply(a3,multiply(b3,c3)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_these_axioms_3) ).
cnf(4,plain,
inverse(double_divide(c3,inverse(double_divide(b3,a3)))) != inverse(double_divide(inverse(double_divide(c3,b3)),a3)),
inference('REWRITE',[status(thm)],[prove_these_axioms_3,multiply,theory(equality)]) ).
cnf(5,plain,
inverse(double_divide(X,double_divide(inverse(double_divide(Y,X)),double_divide(Y,Z)))) = Z,
inference('PARAMODULATE',[status(thm)],[single_axiom,single_axiom,theory(equality)]) ).
cnf(6,plain,
inverse(double_divide(inverse(double_divide(X,Y)),double_divide(inverse(double_divide(inverse(double_divide(Z,X)),U)),Y))) = double_divide(Z,U),
inference('PARAMODULATE',[status(thm)],[single_axiom,single_axiom,theory(equality)]) ).
cnf(7,plain,
inverse(double_divide(inverse(double_divide(X,Y)),double_divide(Z,Y))) = double_divide(inverse(double_divide(U,Z)),double_divide(U,X)),
inference('PARAMODULATE',[status(thm)],[single_axiom,5,theory(equality)]) ).
cnf(8,plain,
inverse(double_divide(double_divide(inverse(double_divide(X,Y)),double_divide(X,Z)),double_divide(Z,double_divide(Y,U)))) = U,
inference('PARAMODULATE',[status(thm)],[5,5,theory(equality)]) ).
cnf(11,plain,
double_divide(inverse(double_divide(X,Y)),double_divide(X,inverse(double_divide(Y,Z)))) = Z,
inference('PARAMODULATE',[status(thm)],[single_axiom,7,theory(equality)]) ).
cnf(12,plain,
double_divide(inverse(double_divide(X,Y)),double_divide(X,Z)) = double_divide(inverse(double_divide(U,Y)),double_divide(U,Z)),
inference('PARAMODULATE',[status(thm)],[7,7,theory(equality)]) ).
cnf(13,plain,
inverse(double_divide(X,inverse(double_divide(inverse(double_divide(Y,Z)),double_divide(X,Z))))) = Y,
inference('PARAMODULATE',[status(thm)],[5,7,theory(equality)]) ).
cnf(23,plain,
inverse(double_divide(inverse(double_divide(double_divide(inverse(double_divide(X,Y)),double_divide(X,Z)),U)),double_divide(inverse(double_divide(Z,V)),U))) = double_divide(Y,V),
inference('PARAMODULATE',[status(thm)],[single_axiom,7,theory(equality)]) ).
cnf(34,plain,
inverse(double_divide(inverse(X),double_divide(Y,double_divide(Y,inverse(double_divide(Z,X)))))) = Z,
inference('PARAMODULATE',[status(thm)],[single_axiom,11,theory(equality)]) ).
cnf(69,plain,
inverse(double_divide(X,inverse(double_divide(inverse(double_divide(Y,Z)),double_divide(Y,Z))))) = X,
inference('PARAMODULATE',[status(thm)],[13,12,theory(equality)]) ).
cnf(95,plain,
inverse(double_divide(double_divide(inverse(double_divide(X,inverse(double_divide(Y,Z)))),double_divide(X,U)),double_divide(U,V))) = double_divide(Y,inverse(double_divide(Z,V))),
inference('PARAMODULATE',[status(thm)],[8,11,theory(equality)]) ).
cnf(113,plain,
inverse(double_divide(inverse(double_divide(X,Y)),double_divide(double_divide(Z,double_divide(Z,inverse(double_divide(U,V)))),Y))) = double_divide(U,double_divide(inverse(V),X)),
inference('PARAMODULATE',[status(thm)],[7,34,theory(equality)]) ).
cnf(122,plain,
inverse(double_divide(X,inverse(double_divide(inverse(Y),Y)))) = X,
inference('PARAMODULATE',[status(thm)],[69,11,theory(equality)]) ).
cnf(130,plain,
inverse(double_divide(inverse(inverse(double_divide(inverse(X),X))),double_divide(Y,double_divide(Y,Z)))) = Z,
inference('PARAMODULATE',[status(thm)],[34,122,theory(equality)]) ).
cnf(133,plain,
double_divide(X,double_divide(X,Y)) = double_divide(Z,double_divide(Z,Y)),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[12,122,theory(equality)]),122,theory(equality)]) ).
cnf(146,plain,
inverse(double_divide(X,double_divide(X,double_divide(inverse(Y),inverse(double_divide(Z,Y)))))) = Z,
inference('PARAMODULATE',[status(thm)],[34,133,theory(equality)]) ).
cnf(151,plain,
double_divide(inverse(double_divide(X,Y)),Z) = double_divide(U,double_divide(U,double_divide(X,inverse(double_divide(Y,Z))))),
inference('PARAMODULATE',[status(thm)],[133,11,theory(equality)]) ).
cnf(152,plain,
inverse(double_divide(inverse(double_divide(inverse(X),Y)),X)) = Y,
inference('REWRITE',[status(thm)],[146,151,theory(equality)]) ).
cnf(172,plain,
X = inverse(double_divide(inverse(inverse(double_divide(inverse(Y),Y))),X)),
inference('PARAMODULATE',[status(thm)],[122,152,theory(equality)]) ).
cnf(173,plain,
double_divide(X,double_divide(X,Y)) = Y,
inference('REWRITE',[status(thm)],[130,172,theory(equality)]) ).
cnf(185,plain,
inverse(double_divide(inverse(double_divide(X,Y)),double_divide(inverse(double_divide(Z,U)),Y))) = double_divide(Z,double_divide(inverse(U),X)),
inference('REWRITE',[status(thm)],[113,173,theory(equality)]) ).
cnf(186,plain,
double_divide(inverse(double_divide(X,Y)),double_divide(inverse(Z),Y)) = double_divide(X,Z),
inference('REWRITE',[status(thm)],[6,185,theory(equality)]) ).
cnf(248,plain,
inverse(double_divide(double_divide(inverse(double_divide(X,Y)),double_divide(X,Z)),double_divide(Z,U))) = double_divide(Y,U),
inference('REWRITE',[status(thm)],[23,186,theory(equality)]) ).
cnf(251,plain,
double_divide(inverse(double_divide(X,Y)),Z) = double_divide(X,inverse(double_divide(Y,Z))),
inference('REWRITE',[status(thm)],[95,248,theory(equality)]) ).
cnf(254,plain,
$false,
inference('REWRITE',[status(thm)],[4,251,theory(equality)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : GRP611-1 : TPTP v8.1.0. Released v2.6.0.
% 0.03/0.13 % Command : run-snark %s %d
% 0.13/0.34 % Computer : n004.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 : Tue Jun 14 02:09:24 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.19/0.45 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.46 *
% 0.19/0.46 *
% 0.19/0.46 #<PACKAGE "SNARK-USER">
% 0.19/0.46 *
% 0.19/0.46 SNARK-TPTP-OPTIONS
% 0.19/0.46 *
% 0.19/0.47 ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.19/0.47 (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.19/0.47 (USE-FACTORING :POS)
% 0.19/0.47 (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.19/0.47 (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.19/0.47 (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.19/0.47 (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.19/0.47 (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.19/0.47 (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.19/0.47 (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.19/0.47 (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.19/0.47 (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.19/0.47 (DECLARE-TPTP-SYMBOLS2))
% 0.19/0.47 *
% 0.19/0.47 "."
% 0.19/0.47 *
% 0.19/0.47 ; Begin refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-06-14T02:09:24
% 0.19/0.47 ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n004.cluster.edu at 2022-06-14T02:09:24
% 0.42/0.60
% 0.42/0.60
% 0.42/0.60 #||
% 0.42/0.60 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.42/0.60 % SZS output start Refutation
% See solution above
% 0.42/0.61 ||#
% 0.42/0.61
% 0.42/0.61 ; Summary of computation:
% 0.42/0.61 ; 507 formulas have been input or derived (from 15 formulas).
% 0.42/0.61 ; 254 (50%) were retained. Of these,
% 0.42/0.61 ; 136 (54%) were simplified or subsumed later,
% 0.42/0.61 ; 118 (46%) are still being kept.
% 0.42/0.61 ;
% 0.42/0.61 ; Run time in seconds excluding printing time:
% 0.42/0.61 ; 0.001 1% Read assertion file (1 call)
% 0.42/0.61 ; 0.000 0% Assert (3 calls)
% 0.42/0.61 ; 0.043 31% Process new row (435 calls)
% 0.42/0.61 ; 0.001 1% Resolution (28 calls)
% 0.42/0.61 ; 0.010 7% Paramodulation (14 calls)
% 0.42/0.61 ; 0.021 15% Forward simplification (408 calls)
% 0.42/0.61 ; 0.024 17% Backward simplification (253 calls)
% 0.42/0.61 ; 0.015 11% Ordering (1,598 calls)
% 0.42/0.61 ; 0.000 0% Sortal reasoning (32 calls)
% 0.42/0.61 ; 0.000 0% Purity testing (1 call)
% 0.42/0.61 ; 0.023 17% Other
% 0.42/0.61 ; 0.138 Total
% 0.42/0.61 ; 0.141 Real time
% 0.42/0.61 ;
% 0.42/0.61 ; Term-hash-array has 1,312 terms in all.
% 0.42/0.61 ; Feature-vector-row-index has 0 entries (0 at peak, 0 added, 0 deleted).
% 0.42/0.61 ; Feature-vector-row-index has 1 node (1 at peak, 1 added, 0 deleted).
% 0.42/0.61 ; Path-index has 636 entries (965 at peak, 1,393 added, 757 deleted).
% 0.42/0.61 ; Path-index has 2,607 nodes (2,839 at peak, 3,267 added, 660 deleted).
% 0.42/0.61 ; Trie-index has 636 entries (965 at peak, 1,393 added, 757 deleted).
% 0.42/0.61 ; Trie-index has 2,828 nodes (4,177 at peak, 5,899 added, 3,071 deleted).
% 0.42/0.61 ; Retrieved 701 generalization terms in 3,860 calls.
% 0.42/0.61 ; Retrieved 1,715 instance terms in 280 calls.
% 0.42/0.61 ; Retrieved 1,938 unifiable terms in 132 calls.
% 0.42/0.61 ;
% 0.42/0.61 ; The agenda of backward simplifiable rows to process has 38 entries:
% 0.42/0.61 ; 38 with value 0
% 0.42/0.61 ; The agenda of rows to process has 32 entries:
% 0.42/0.61 ; 2 with value 26 1 with value 31 4 with value 35
% 0.42/0.61 ; 2 with value 27 3 with value 32 1 with value 37
% 0.42/0.61 ; 5 with value 28 5 with value 33 1 with value 38
% 0.42/0.61 ; 2 with value 29 1 with value 34 1 with value 39
% 0.42/0.61 ; 4 with value 30
% 0.42/0.61 ; The agenda of rows to give has 111 entries:
% 0.42/0.61 ; 3 with value (4 16) 4 with value (4 26) 8 with value (4 33)
% 0.42/0.61 ; 1 with value (4 18) 5 with value (4 27) 4 with value (4 34)
% 0.42/0.61 ; 1 with value (4 20) 3 with value (4 28) 15 with value (4 35)
% 0.42/0.61 ; 2 with value (4 21) 5 with value (4 29) 9 with value (4 36)
% 0.42/0.61 ; 7 with value (4 22) 3 with value (4 30) 6 with value (4 37)
% 0.42/0.61 ; 1 with value (4 23) 3 with value (4 31) 6 with value (4 38)
% 0.42/0.61 ; 5 with value (4 24) 14 with value (4 32) 5 with value (4 39)
% 0.42/0.61 ; 1 with value (4 25)
% 0.42/0.61 Evaluation took:
% 0.42/0.61 0.141 seconds of real time
% 0.42/0.61 0.129671 seconds of user run time
% 0.42/0.61 0.011362 seconds of system run time
% 0.42/0.61 0 calls to %EVAL
% 0.42/0.61 0 page faults and
% 0.42/0.61 10,709,984 bytes consed.
% 0.42/0.61 :PROOF-FOUND
% 0.42/0.61 ; End refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-06-14T02:09:24
% 0.42/0.61 :PROOF-FOUND
% 0.42/0.61 *
%------------------------------------------------------------------------------