TSTP Solution File: GRP527-1 by SNARK---20120808r022
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : GRP527-1 : TPTP v8.1.0. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : run-snark %s %d
% Computer : n013.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:17 EDT 2022
% Result : Unsatisfiable 0.20s 0.52s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 4
% Syntax : Number of clauses : 29 ( 29 unt; 0 nHn; 6 RR)
% Number of literals : 29 ( 28 equ; 5 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 6 ( 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 : 51 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(single_axiom,axiom,
divide(X,divide(divide(X,Y),divide(Z,Y))) = Z,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',single_axiom) ).
cnf(multiply,axiom,
multiply(X,Y) = divide(X,divide(divide(Z,Z),Y)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',multiply) ).
cnf(inverse,axiom,
inverse(X) = divide(divide(Y,Y),X),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',inverse) ).
cnf(prove_these_axioms_3,negated_conjecture,
multiply(multiply(a3,b3),c3) != multiply(a3,multiply(b3,c3)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_these_axioms_3) ).
cnf(5,plain,
multiply(X,Y) = divide(X,inverse(Y)),
inference('REWRITE',[status(thm)],[multiply,inverse,theory(equality)]) ).
cnf(6,plain,
divide(divide(a3,inverse(b3)),inverse(c3)) != divide(a3,inverse(divide(b3,inverse(c3)))),
inference('REWRITE',[status(thm)],[prove_these_axioms_3,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(35,plain,
divide(inverse(X),divide(Y,X)) = inverse(Y),
inference('PARAMODULATE',[status(thm)],[25,25,theory(equality)]) ).
cnf(36,plain,
inverse(divide(X,divide(Y,inverse(X)))) = Y,
inference('REWRITE',[status(thm)],[30,35,theory(equality)]) ).
cnf(37,plain,
inverse(inverse(X)) = X,
inference('REWRITE',[status(thm)],[10,35,theory(equality)]) ).
cnf(38,plain,
divide(X,divide(Y,Y)) = X,
inference('REWRITE',[status(thm)],[16,37,theory(equality)]) ).
cnf(43,plain,
divide(X,divide(X,Y)) = Y,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[single_axiom,33,theory(equality)]),38,theory(equality)]) ).
cnf(45,plain,
divide(X,Y) = inverse(divide(Y,X)),
inference('PARAMODULATE',[status(thm)],[25,43,theory(equality)]) ).
cnf(46,plain,
divide(divide(X,inverse(Y)),Y) = X,
inference('REWRITE',[status(thm)],[36,45,theory(equality)]) ).
cnf(49,plain,
divide(divide(a3,inverse(b3)),inverse(c3)) != divide(a3,divide(inverse(c3),b3)),
inference('REWRITE',[status(thm)],[6,45,theory(equality)]) ).
cnf(52,plain,
divide(inverse(X),Y) = divide(inverse(Y),X),
inference('PARAMODULATE',[status(thm)],[46,25,theory(equality)]) ).
cnf(53,plain,
divide(divide(a3,inverse(b3)),inverse(c3)) != divide(a3,divide(inverse(b3),c3)),
inference('REWRITE',[status(thm)],[49,52,theory(equality)]) ).
cnf(56,plain,
divide(X,inverse(Y)) = divide(Y,inverse(X)),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[45,52,theory(equality)]),45,theory(equality)]) ).
cnf(57,plain,
divide(divide(b3,inverse(a3)),inverse(c3)) != divide(a3,divide(inverse(b3),c3)),
inference('REWRITE',[status(thm)],[53,56,theory(equality)]) ).
cnf(60,plain,
divide(divide(X,Y),inverse(Z)) = divide(X,divide(Y,Z)),
inference('PARAMODULATE',[status(thm)],[32,9,theory(equality)]) ).
cnf(61,plain,
$false,
inference('REWRITE',[status(thm)],[57,56,60,theory(equality)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : GRP527-1 : TPTP v8.1.0. Released v2.6.0.
% 0.03/0.13 % Command : run-snark %s %d
% 0.13/0.34 % Computer : n013.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 11:33:43 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.20/0.45 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.46 *
% 0.20/0.46 *
% 0.20/0.47 #<PACKAGE "SNARK-USER">
% 0.20/0.47 *
% 0.20/0.47 SNARK-TPTP-OPTIONS
% 0.20/0.47 *
% 0.20/0.47 ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.20/0.47 (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.20/0.47 (USE-FACTORING :POS)
% 0.20/0.47 (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.20/0.47 (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.20/0.47 (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.20/0.47 (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.20/0.47 (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.20/0.47 (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.20/0.47 (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.20/0.47 (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.20/0.47 (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.20/0.47 (DECLARE-TPTP-SYMBOLS2))
% 0.20/0.47 *
% 0.20/0.47 "."
% 0.20/0.47 *
% 0.20/0.47 ; Begin refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-06-14T11:33:44
% 0.20/0.47 ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n013.cluster.edu at 2022-06-14T11:33:44
% 0.20/0.52
% 0.20/0.52
% 0.20/0.52 #||
% 0.20/0.52 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.52 % SZS output start Refutation
% See solution above
% 0.20/0.52 ||#
% 0.20/0.52
% 0.20/0.52 ; Summary of computation:
% 0.20/0.52 ; 275 formulas have been input or derived (from 22 formulas).
% 0.20/0.52 ; 61 (22%) were retained. Of these,
% 0.20/0.52 ; 39 (64%) were simplified or subsumed later,
% 0.20/0.52 ; 22 (36%) are still being kept.
% 0.20/0.52 ;
% 0.20/0.52 ; Run time in seconds excluding printing time:
% 0.20/0.52 ; 0.002 4% Read assertion file (1 call)
% 0.20/0.52 ; 0.000 0% Assert (4 calls)
% 0.20/0.52 ; 0.005 10% Process new row (255 calls)
% 0.20/0.52 ; 0.002 4% Resolution (42 calls)
% 0.20/0.52 ; 0.004 8% Paramodulation (21 calls)
% 0.20/0.52 ; 0.007 14% Forward simplification (246 calls)
% 0.20/0.52 ; 0.003 6% Backward simplification (61 calls)
% 0.20/0.52 ; 0.004 8% Ordering (552 calls)
% 0.20/0.52 ; 0.000 0% Sortal reasoning (32 calls)
% 0.20/0.52 ; 0.000 0% Purity testing (1 call)
% 0.20/0.52 ; 0.023 46% Other
% 0.20/0.52 ; 0.050 Total
% 0.20/0.52 ; 0.053 Real time
% 0.20/0.52 ;
% 0.20/0.52 ; Term-hash-array has 180 terms in all.
% 0.20/0.52 ; Feature-vector-row-index has 0 entries (0 at peak, 0 added, 0 deleted).
% 0.20/0.52 ; Feature-vector-row-index has 1 node (1 at peak, 1 added, 0 deleted).
% 0.20/0.52 ; Path-index has 59 entries (113 at peak, 219 added, 160 deleted).
% 0.20/0.52 ; Path-index has 321 nodes (436 at peak, 547 added, 226 deleted).
% 0.20/0.52 ; Trie-index has 59 entries (113 at peak, 219 added, 160 deleted).
% 0.20/0.52 ; Trie-index has 163 nodes (409 at peak, 674 added, 511 deleted).
% 0.20/0.52 ; Retrieved 528 generalization terms in 1,120 calls.
% 0.20/0.52 ; Retrieved 207 instance terms in 65 calls.
% 0.20/0.52 ; Retrieved 740 unifiable terms in 146 calls.
% 0.20/0.52 ;
% 0.20/0.52 ; The agenda of rows to process has 14 entries:
% 0.20/0.52 ; 6 with value 19 1 with value 21 5 with value 22
% 0.20/0.52 ; 2 with value 20
% 0.20/0.52 ; The agenda of rows to give has 9 entries:
% 0.20/0.52 ; 2 with value (4 16) 1 with value (4 18) 1 with value (4 20)
% 0.20/0.52 ; 1 with value (4 17) 4 with value (4 19)
% 0.20/0.52 Evaluation took:
% 0.20/0.52 0.054 seconds of real time
% 0.20/0.53 0.044086 seconds of user run time
% 0.20/0.53 0.010078 seconds of system run time
% 0.20/0.53 0 calls to %EVAL
% 0.20/0.53 0 page faults and
% 0.20/0.53 4,524,600 bytes consed.
% 0.20/0.53 :PROOF-FOUND
% 0.20/0.53 ; End refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-06-14T11:33:44
% 0.20/0.53 :PROOF-FOUND
% 0.20/0.53 *
%------------------------------------------------------------------------------