TSTP Solution File: GRP456-1 by SNARK---20120808r022
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : GRP456-1 : TPTP v8.1.0. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : run-snark %s %d
% Computer : n007.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:38:57 EDT 2022
% Result : Unsatisfiable 0.19s 0.50s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 5
% Syntax : Number of clauses : 23 ( 23 unt; 0 nHn; 5 RR)
% Number of literals : 23 ( 22 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 : 7 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 36 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(single_axiom,axiom,
divide(divide(identity,divide(X,divide(Y,divide(divide(divide(X,X),X),Z)))),Z) = Y,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',single_axiom) ).
cnf(multiply,axiom,
multiply(X,Y) = divide(X,divide(identity,Y)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',multiply) ).
cnf(inverse,axiom,
inverse(X) = divide(identity,X),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',inverse) ).
cnf(identity,axiom,
identity = divide(X,X),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',identity) ).
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(6,plain,
multiply(X,Y) = divide(X,inverse(Y)),
inference('REWRITE',[status(thm)],[multiply,inverse,theory(equality)]) ).
cnf(7,plain,
divide(divide(a3,inverse(b3)),inverse(c3)) != divide(a3,inverse(divide(b3,inverse(c3)))),
inference('REWRITE',[status(thm)],[prove_these_axioms_3,6,theory(equality)]) ).
cnf(8,plain,
divide(inverse(divide(X,divide(Y,divide(inverse(X),Z)))),Z) = Y,
inference('REWRITE',[status(thm)],[single_axiom,identity,inverse,theory(equality)]) ).
cnf(9,plain,
identity = inverse(identity),
inference('PARAMODULATE',[status(thm)],[identity,inverse,theory(equality)]) ).
cnf(10,plain,
divide(inverse(divide(X,identity)),Y) = divide(inverse(X),Y),
inference('PARAMODULATE',[status(thm)],[8,identity,theory(equality)]) ).
cnf(11,plain,
divide(inverse(divide(X,divide(Y,identity))),inverse(X)) = Y,
inference('PARAMODULATE',[status(thm)],[8,identity,theory(equality)]) ).
cnf(13,plain,
divide(inverse(inverse(divide(X,inverse(Y)))),Y) = X,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[8,inverse,theory(equality)]),inverse,9,theory(equality)]) ).
cnf(19,plain,
inverse(X) = inverse(divide(X,identity)),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[8,10,theory(equality)]),8,theory(equality)]) ).
cnf(21,plain,
inverse(inverse(X)) = X,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[11,identity,theory(equality)]),inverse,19,9,theory(equality)]) ).
cnf(23,plain,
divide(divide(X,inverse(Y)),Y) = X,
inference('REWRITE',[status(thm)],[13,21,theory(equality)]) ).
cnf(24,plain,
divide(X,identity) = X,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[11,inverse,theory(equality)]),9,21,19,theory(equality)]) ).
cnf(26,plain,
divide(inverse(divide(X,Y)),inverse(X)) = Y,
inference('REWRITE',[status(thm)],[11,24,theory(equality)]) ).
cnf(29,plain,
divide(inverse(divide(X,Y)),Z) = divide(Y,inverse(divide(inverse(X),Z))),
inference('PARAMODULATE',[status(thm)],[8,23,theory(equality)]) ).
cnf(30,plain,
divide(X,Y) = inverse(divide(Y,X)),
inference('PARAMODULATE',[status(thm)],[23,26,theory(equality)]) ).
cnf(32,plain,
divide(divide(a3,inverse(b3)),inverse(c3)) != divide(a3,divide(inverse(c3),b3)),
inference('REWRITE',[status(thm)],[7,30,theory(equality)]) ).
cnf(34,plain,
divide(divide(X,Y),Z) = divide(X,divide(Z,inverse(Y))),
inference('REWRITE',[status(thm)],[29,30,theory(equality)]) ).
cnf(39,plain,
divide(divide(X,inverse(Y)),Z) = divide(X,divide(Z,Y)),
inference('PARAMODULATE',[status(thm)],[34,21,theory(equality)]) ).
cnf(40,plain,
$false,
inference('REWRITE',[status(thm)],[32,39,theory(equality)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : GRP456-1 : TPTP v8.1.0. Released v2.6.0.
% 0.11/0.12 % Command : run-snark %s %d
% 0.12/0.33 % Computer : n007.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Mon Jun 13 23:28:24 EDT 2022
% 0.12/0.33 % 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.46 ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.19/0.46 (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.19/0.46 (USE-FACTORING :POS)
% 0.19/0.46 (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.19/0.46 (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.19/0.46 (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.19/0.46 (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.19/0.46 (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.19/0.46 (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.19/0.46 (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.19/0.46 (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.19/0.46 (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.19/0.46 (DECLARE-TPTP-SYMBOLS2))
% 0.19/0.46 *
% 0.19/0.46 "."
% 0.19/0.46 *
% 0.19/0.46 ; Begin refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-06-13T23:28:24
% 0.19/0.46 ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n007.cluster.edu at 2022-06-13T23:28:24
% 0.19/0.50
% 0.19/0.50
% 0.19/0.50 #||
% 0.19/0.50 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.50 % SZS output start Refutation
% See solution above
% 0.19/0.51 ||#
% 0.19/0.51
% 0.19/0.51 ; Summary of computation:
% 0.19/0.51 ; 158 formulas have been input or derived (from 19 formulas).
% 0.19/0.51 ; 40 (25%) were retained. Of these,
% 0.19/0.51 ; 23 (58%) were simplified or subsumed later,
% 0.19/0.51 ; 17 (42%) are still being kept.
% 0.19/0.51 ;
% 0.19/0.51 ; Run time in seconds excluding printing time:
% 0.19/0.51 ; 0.001 2% Read assertion file (1 call)
% 0.19/0.51 ; 0.001 2% Assert (5 calls)
% 0.19/0.51 ; 0.002 5% Process new row (136 calls)
% 0.19/0.51 ; 0.002 5% Resolution (36 calls)
% 0.19/0.51 ; 0.000 0% Paramodulation (18 calls)
% 0.19/0.51 ; 0.005 12% Forward simplification (122 calls)
% 0.19/0.51 ; 0.005 12% Backward simplification (40 calls)
% 0.19/0.51 ; 0.001 2% Ordering (307 calls)
% 0.19/0.51 ; 0.000 0% Sortal reasoning (32 calls)
% 0.19/0.51 ; 0.000 0% Purity testing (1 call)
% 0.19/0.51 ; 0.023 58% Other
% 0.19/0.51 ; 0.040 Total
% 0.19/0.51 ; 0.043 Real time
% 0.19/0.51 ;
% 0.19/0.51 ; Term-hash-array has 149 terms in all.
% 0.19/0.51 ; Feature-vector-row-index has 0 entries (0 at peak, 0 added, 0 deleted).
% 0.19/0.51 ; Feature-vector-row-index has 1 node (1 at peak, 1 added, 0 deleted).
% 0.19/0.51 ; Path-index has 55 entries (74 at peak, 171 added, 116 deleted).
% 0.19/0.51 ; Path-index has 330 nodes (370 at peak, 534 added, 204 deleted).
% 0.19/0.51 ; Trie-index has 55 entries (74 at peak, 171 added, 116 deleted).
% 0.19/0.51 ; Trie-index has 190 nodes (314 at peak, 668 added, 478 deleted).
% 0.19/0.51 ; Retrieved 316 generalization terms in 550 calls.
% 0.19/0.51 ; Retrieved 91 instance terms in 45 calls.
% 0.19/0.51 ; Retrieved 299 unifiable terms in 122 calls.
% 0.19/0.51 ;
% 0.19/0.51 ; The agenda of backward simplifiable rows to process has 1 entry:
% 0.19/0.51 ; 1 with value 0
% 0.19/0.51 ; The agenda of rows to process has 21 entries:
% 0.19/0.51 ; 4 with value 20 2 with value 23 4 with value 25
% 0.19/0.51 ; 3 with value 21 3 with value 24 1 with value 26
% 0.19/0.51 ; 4 with value 22
% 0.19/0.51 ; The agenda of rows to give has 6 entries:
% 0.19/0.51 ; 2 with value (4 18) 1 with value (4 21) 2 with value (4 24)
% 0.19/0.51 ; 1 with value (4 19)
% 0.19/0.51 Evaluation took:
% 0.19/0.51 0.043 seconds of real time
% 0.19/0.51 0.037344 seconds of user run time
% 0.19/0.51 0.00626 seconds of system run time
% 0.19/0.51 0 calls to %EVAL
% 0.19/0.51 0 page faults and
% 0.19/0.51 3,668,080 bytes consed.
% 0.19/0.51 :PROOF-FOUND
% 0.19/0.51 ; End refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-06-13T23:28:24
% 0.19/0.51 :PROOF-FOUND
% 0.19/0.51 *
%------------------------------------------------------------------------------