TSTP Solution File: GRP089-1 by SNARK---20120808r022
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : GRP089-1 : TPTP v8.1.0. Bugfixed v2.7.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:36:06 EDT 2022
% Result : Unsatisfiable 0.18s 0.52s
% Output : Refutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 4
% Syntax : Number of clauses : 31 ( 25 unt; 0 nHn; 8 RR)
% Number of literals : 42 ( 41 equ; 18 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 9 con; 0-2 aty)
% Number of variables : 51 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(single_axiom,axiom,
divide(X,divide(divide(X,Y),divide(Z,Y))) = Z,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',single_axiom) ).
cnf(multiply,axiom,
multiply(X,Y) = divide(X,divide(divide(Z,Z),Y)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',multiply) ).
cnf(inverse,axiom,
inverse(X) = divide(divide(Y,Y),X),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',inverse) ).
cnf(prove_these_axioms,negated_conjecture,
( multiply(inverse(a1),a1) != multiply(inverse(b1),b1)
| multiply(multiply(inverse(b2),b2),a2) != a2
| multiply(multiply(a3,b3),c3) != multiply(a3,multiply(b3,c3))
| multiply(a4,b4) != multiply(b4,a4) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_these_axioms) ).
cnf(5,plain,
multiply(X,Y) = divide(X,inverse(Y)),
inference('REWRITE',[status(thm)],[multiply,inverse,theory(equality)]) ).
cnf(6,plain,
( divide(inverse(a1),inverse(a1)) != divide(inverse(b1),inverse(b1))
| inverse(inverse(a2)) != a2
| divide(divide(a3,inverse(b3)),inverse(c3)) != divide(a3,inverse(divide(b3,inverse(c3))))
| divide(a4,inverse(b4)) != divide(b4,inverse(a4)) ),
inference('REWRITE',[status(thm)],[prove_these_axioms,inverse,5,theory(equality)]) ).
cnf(8,plain,
divide(X,inverse(divide(Y,X))) = Y,
inference('PARAMODULATE',[status(thm)],[single_axiom,inverse,theory(equality)]) ).
cnf(9,plain,
divide(X,Y) = divide(divide(X,divide(Y,Z)),Z),
inference('PARAMODULATE',[status(thm)],[single_axiom,single_axiom,theory(equality)]) ).
cnf(10,plain,
inverse(divide(inverse(X),divide(Y,X))) = Y,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[single_axiom,inverse,theory(equality)]),inverse,theory(equality)]) ).
cnf(11,plain,
divide(X,divide(divide(X,Y),inverse(Y))) = divide(Z,Z),
inference('PARAMODULATE',[status(thm)],[single_axiom,inverse,theory(equality)]) ).
cnf(16,plain,
inverse(inverse(divide(X,divide(Y,Y)))) = X,
inference('PARAMODULATE',[status(thm)],[inverse,8,theory(equality)]) ).
cnf(25,plain,
divide(divide(X,Y),X) = inverse(Y),
inference('PARAMODULATE',[status(thm)],[8,10,theory(equality)]) ).
cnf(30,plain,
inverse(divide(X,divide(Y,divide(inverse(Z),divide(X,Z))))) = Y,
inference('PARAMODULATE',[status(thm)],[10,10,theory(equality)]) ).
cnf(32,plain,
divide(divide(X,Y),inverse(Y)) = X,
inference('PARAMODULATE',[status(thm)],[single_axiom,25,theory(equality)]) ).
cnf(33,plain,
divide(X,X) = divide(Y,Y),
inference('REWRITE',[status(thm)],[11,32,theory(equality)]) ).
cnf(34,plain,
( inverse(inverse(a2)) != a2
| divide(divide(a3,inverse(b3)),inverse(c3)) != divide(a3,inverse(divide(b3,inverse(c3))))
| divide(a4,inverse(b4)) != divide(b4,inverse(a4)) ),
inference('REWRITE',[status(thm)],[6,33,theory(equality)]) ).
cnf(36,plain,
divide(inverse(X),divide(Y,X)) = inverse(Y),
inference('PARAMODULATE',[status(thm)],[25,25,theory(equality)]) ).
cnf(37,plain,
inverse(divide(X,divide(Y,inverse(X)))) = Y,
inference('REWRITE',[status(thm)],[30,36,theory(equality)]) ).
cnf(38,plain,
inverse(inverse(X)) = X,
inference('REWRITE',[status(thm)],[10,36,theory(equality)]) ).
cnf(39,plain,
divide(X,divide(Y,Y)) = X,
inference('REWRITE',[status(thm)],[16,38,theory(equality)]) ).
cnf(41,plain,
( divide(divide(a3,inverse(b3)),inverse(c3)) != divide(a3,inverse(divide(b3,inverse(c3))))
| divide(a4,inverse(b4)) != divide(b4,inverse(a4)) ),
inference('REWRITE',[status(thm)],[34,38,theory(equality)]) ).
cnf(45,plain,
divide(X,divide(X,Y)) = Y,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[single_axiom,33,theory(equality)]),39,theory(equality)]) ).
cnf(47,plain,
divide(X,Y) = inverse(divide(Y,X)),
inference('PARAMODULATE',[status(thm)],[25,45,theory(equality)]) ).
cnf(48,plain,
divide(divide(X,inverse(Y)),Y) = X,
inference('REWRITE',[status(thm)],[37,47,theory(equality)]) ).
cnf(51,plain,
( divide(divide(a3,inverse(b3)),inverse(c3)) != divide(a3,divide(inverse(c3),b3))
| divide(a4,inverse(b4)) != divide(b4,inverse(a4)) ),
inference('REWRITE',[status(thm)],[41,47,theory(equality)]) ).
cnf(54,plain,
divide(inverse(X),Y) = divide(inverse(Y),X),
inference('PARAMODULATE',[status(thm)],[48,25,theory(equality)]) ).
cnf(55,plain,
( divide(divide(a3,inverse(b3)),inverse(c3)) != divide(a3,divide(inverse(b3),c3))
| divide(a4,inverse(b4)) != divide(b4,inverse(a4)) ),
inference('REWRITE',[status(thm)],[51,54,theory(equality)]) ).
cnf(58,plain,
divide(X,inverse(Y)) = divide(Y,inverse(X)),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[47,54,theory(equality)]),47,theory(equality)]) ).
cnf(59,plain,
divide(divide(b3,inverse(a3)),inverse(c3)) != divide(a3,divide(inverse(b3),c3)),
inference('REWRITE',[status(thm)],[55,58,theory(equality)]) ).
cnf(62,plain,
divide(divide(X,Y),inverse(Z)) = divide(X,divide(Y,Z)),
inference('PARAMODULATE',[status(thm)],[32,9,theory(equality)]) ).
cnf(63,plain,
$false,
inference('REWRITE',[status(thm)],[59,58,62,theory(equality)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : GRP089-1 : TPTP v8.1.0. Bugfixed v2.7.0.
% 0.00/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 17:14:24 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.45 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.18/0.46 *
% 0.18/0.46 *
% 0.18/0.46 #<PACKAGE "SNARK-USER">
% 0.18/0.46 *
% 0.18/0.46 SNARK-TPTP-OPTIONS
% 0.18/0.46 *
% 0.18/0.46 ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.18/0.46 (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.18/0.46 (USE-FACTORING :POS)
% 0.18/0.46 (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.18/0.46 (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.18/0.46 (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.18/0.46 (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.18/0.46 (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.18/0.46 (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.18/0.46 (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.18/0.46 (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.18/0.46 (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.18/0.46 (DECLARE-TPTP-SYMBOLS2))
% 0.18/0.46 *
% 0.18/0.46 "."
% 0.18/0.46 *
% 0.18/0.46 ; Begin refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-06-13T17:14:24
% 0.18/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-13T17:14:24
% 0.18/0.52
% 0.18/0.52
% 0.18/0.52 #||
% 0.18/0.52 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.18/0.52 % SZS output start Refutation
% See solution above
% 0.18/0.52 ||#
% 0.18/0.52
% 0.18/0.52 ; Summary of computation:
% 0.18/0.52 ; 277 formulas have been input or derived (from 23 formulas).
% 0.18/0.52 ; 63 (23%) were retained. Of these,
% 0.18/0.52 ; 41 (65%) were simplified or subsumed later,
% 0.18/0.52 ; 22 (35%) are still being kept.
% 0.18/0.52 ;
% 0.18/0.52 ; Run time in seconds excluding printing time:
% 0.18/0.52 ; 0.002 4% Read assertion file (1 call)
% 0.18/0.52 ; 0.000 0% Assert (4 calls)
% 0.18/0.52 ; 0.013 24% Process new row (257 calls)
% 0.18/0.52 ; 0.003 6% Resolution (44 calls)
% 0.18/0.52 ; 0.005 9% Paramodulation (22 calls)
% 0.18/0.52 ; 0.000 0% Condensing (6 calls)
% 0.18/0.52 ; 0.000 0% Forward subsumption (6 calls)
% 0.18/0.52 ; 0.000 0% Backward subsumption (6 calls)
% 0.18/0.52 ; 0.003 6% Forward simplification (248 calls)
% 0.18/0.52 ; 0.004 7% Backward simplification (63 calls)
% 0.18/0.52 ; 0.002 4% Ordering (562 calls)
% 0.18/0.52 ; 0.000 0% Sortal reasoning (32 calls)
% 0.18/0.52 ; 0.000 0% Purity testing (1 call)
% 0.18/0.52 ; 0.022 41% Other
% 0.18/0.52 ; 0.054 Total
% 0.18/0.52 ; 0.060 Real time
% 0.18/0.52 ;
% 0.18/0.52 ; Term-hash-array has 203 terms in all.
% 0.18/0.52 ; Feature-vector-row-index has 0 entries (1 at peak, 6 added, 6 deleted).
% 0.18/0.52 ; Feature-vector-row-index has 1 node (36 at peak, 163 added, 162 deleted).
% 0.18/0.52 ; Retrieved 0 possibly forward subsuming rows in 6 calls.
% 0.18/0.52 ; Retrieved 0 possibly backward subsumed rows in 6 calls.
% 0.18/0.52 ; Path-index has 61 entries (132 at peak, 311 added, 250 deleted).
% 0.18/0.52 ; Path-index has 327 nodes (470 at peak, 711 added, 384 deleted).
% 0.18/0.52 ; Trie-index has 61 entries (132 at peak, 311 added, 250 deleted).
% 0.18/0.52 ; Trie-index has 165 nodes (450 at peak, 900 added, 735 deleted).
% 0.18/0.52 ; Retrieved 551 generalization terms in 1,178 calls.
% 0.18/0.52 ; Retrieved 202 instance terms in 61 calls.
% 0.18/0.52 ; Retrieved 817 unifiable terms in 192 calls.
% 0.18/0.52 ;
% 0.18/0.52 ; The agenda of rows to process has 14 entries:
% 0.18/0.52 ; 6 with value 19 1 with value 21 5 with value 22
% 0.18/0.52 ; 2 with value 20
% 0.18/0.52 ; The agenda of rows to give has 9 entries:
% 0.18/0.52 ; 2 with value (4 16) 1 with value (4 18) 1 with value (4 20)
% 0.18/0.52 ; 1 with value (4 17) 4 with value (4 19)
% 0.18/0.52 Evaluation took:
% 0.18/0.52 0.06 seconds of real time
% 0.18/0.52 0.052005 seconds of user run time
% 0.18/0.52 0.007871 seconds of system run time
% 0.18/0.52 0 calls to %EVAL
% 0.18/0.52 0 page faults and
% 0.18/0.52 5,453,544 bytes consed.
% 0.18/0.52 :PROOF-FOUND
% 0.18/0.52 ; End refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-06-13T17:14:24
% 0.18/0.52 :PROOF-FOUND
% 0.18/0.52 *
%------------------------------------------------------------------------------