TSTP Solution File: GRP091-1 by SNARK---20120808r022
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : GRP091-1 : TPTP v8.1.0. Bugfixed v2.7.0.
% Transfm : none
% Format : tptp:raw
% Command : run-snark %s %d
% Computer : n019.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.42s 0.58s
% Output : Refutation 0.42s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 5
% Syntax : Number of clauses : 30 ( 26 unt; 0 nHn; 8 RR)
% Number of literals : 37 ( 36 equ; 14 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 13 ( 13 usr; 10 con; 0-2 aty)
% Number of variables : 46 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(single_axiom,axiom,
divide(divide(X,divide(divide(X,Y),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(identity,axiom,
identity = divide(X,X),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',identity) ).
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/sandbox/benchmark/theBenchmark.p',prove_these_axioms) ).
cnf(6,plain,
inverse(X) = divide(identity,X),
inference('REWRITE',[status(thm)],[inverse,identity,theory(equality)]) ).
cnf(7,plain,
multiply(X,Y) = divide(X,inverse(Y)),
inference('REWRITE',[status(thm)],[multiply,inverse,theory(equality)]) ).
cnf(8,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)],[prove_these_axioms,6,identity,7,theory(equality)]) ).
cnf(10,plain,
divide(divide(X,identity),Y) = divide(X,Y),
inference('PARAMODULATE',[status(thm)],[single_axiom,identity,theory(equality)]) ).
cnf(11,plain,
divide(divide(X,inverse(Y)),X) = Y,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[single_axiom,identity,theory(equality)]),6,theory(equality)]) ).
cnf(16,plain,
divide(divide(X,divide(X,Y)),identity) = Y,
inference('PARAMODULATE',[status(thm)],[single_axiom,10,theory(equality)]) ).
cnf(17,plain,
divide(X,Y) = divide(divide(Z,divide(Z,X)),Y),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[10,single_axiom,theory(equality)]),10,theory(equality)]) ).
cnf(18,plain,
divide(X,identity) = X,
inference('REWRITE',[status(thm)],[16,17,theory(equality)]) ).
cnf(19,plain,
divide(X,divide(X,Y)) = Y,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[single_axiom,18,theory(equality)]),18,theory(equality)]) ).
cnf(20,plain,
inverse(inverse(X)) = X,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[11,identity,theory(equality)]),6,theory(equality)]) ).
cnf(21,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)],[8,20,theory(equality)]) ).
cnf(22,plain,
divide(divide(X,Y),inverse(Y)) = X,
inference('PARAMODULATE',[status(thm)],[single_axiom,11,theory(equality)]) ).
cnf(26,plain,
divide(divide(X,Y),X) = inverse(Y),
inference('PARAMODULATE',[status(thm)],[11,20,theory(equality)]) ).
cnf(27,plain,
divide(divide(X,Y),Z) = divide(divide(X,Z),Y),
inference('PARAMODULATE',[status(thm)],[single_axiom,19,theory(equality)]) ).
cnf(29,plain,
divide(X,Y) = inverse(divide(Y,X)),
inference('PARAMODULATE',[status(thm)],[26,19,theory(equality)]) ).
cnf(30,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)],[21,29,theory(equality)]) ).
cnf(32,plain,
divide(inverse(X),inverse(Y)) = divide(Y,X),
inference('PARAMODULATE',[status(thm)],[22,26,theory(equality)]) ).
cnf(37,plain,
divide(X,inverse(Y)) = divide(Y,inverse(X)),
inference('PARAMODULATE',[status(thm)],[32,20,theory(equality)]) ).
cnf(38,plain,
divide(divide(b3,inverse(a3)),inverse(c3)) != divide(a3,divide(inverse(c3),b3)),
inference('REWRITE',[status(thm)],[30,37,theory(equality)]) ).
cnf(39,plain,
divide(inverse(X),Y) = divide(inverse(Y),X),
inference('PARAMODULATE',[status(thm)],[32,20,theory(equality)]) ).
cnf(40,plain,
divide(divide(b3,inverse(a3)),inverse(c3)) != divide(a3,divide(inverse(b3),c3)),
inference('REWRITE',[status(thm)],[38,39,theory(equality)]) ).
cnf(41,plain,
divide(divide(X,Y),inverse(Z)) = divide(Z,divide(Y,X)),
inference('PARAMODULATE',[status(thm)],[32,29,theory(equality)]) ).
cnf(42,plain,
divide(c3,divide(inverse(a3),b3)) != divide(a3,divide(inverse(b3),c3)),
inference('REWRITE',[status(thm)],[40,41,theory(equality)]) ).
cnf(45,plain,
divide(X,divide(Y,Z)) = divide(Z,divide(Y,X)),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[29,27,theory(equality)]),29,theory(equality)]) ).
cnf(46,plain,
$false,
inference('REWRITE',[status(thm)],[42,39,45,theory(equality)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.13/0.14 % Problem : GRP091-1 : TPTP v8.1.0. Bugfixed v2.7.0.
% 0.13/0.15 % Command : run-snark %s %d
% 0.15/0.37 % Computer : n019.cluster.edu
% 0.15/0.37 % Model : x86_64 x86_64
% 0.15/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.37 % Memory : 8042.1875MB
% 0.15/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.37 % CPULimit : 300
% 0.15/0.37 % WCLimit : 600
% 0.15/0.37 % DateTime : Tue Jun 14 00:38:54 EDT 2022
% 0.15/0.37 % CPUTime :
% 0.23/0.51 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.23/0.52 *
% 0.23/0.52 *
% 0.23/0.53 #<PACKAGE "SNARK-USER">
% 0.23/0.53 *
% 0.23/0.53 SNARK-TPTP-OPTIONS
% 0.23/0.53 *
% 0.23/0.53 ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.23/0.53 (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.23/0.53 (USE-FACTORING :POS)
% 0.23/0.53 (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.23/0.53 (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.23/0.53 (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.23/0.53 (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.23/0.53 (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.23/0.53 (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.23/0.53 (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.23/0.53 (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.23/0.53 (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.23/0.53 (DECLARE-TPTP-SYMBOLS2))
% 0.23/0.53 *
% 0.23/0.53 "."
% 0.23/0.53 *
% 0.23/0.53 ; Begin refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-06-14T00:38:55
% 0.23/0.53 ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n019.cluster.edu at 2022-06-14T00:38:55
% 0.42/0.58
% 0.42/0.58
% 0.42/0.58 #||
% 0.42/0.58 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.42/0.58 % SZS output start Refutation
% See solution above
% 0.42/0.58 ||#
% 0.42/0.58
% 0.42/0.58 ; Summary of computation:
% 0.42/0.58 ; 263 formulas have been input or derived (from 24 formulas).
% 0.42/0.58 ; 46 (17%) were retained. Of these,
% 0.42/0.58 ; 23 (50%) were simplified or subsumed later,
% 0.42/0.58 ; 23 (50%) are still being kept.
% 0.42/0.58 ;
% 0.42/0.58 ; Run time in seconds excluding printing time:
% 0.42/0.58 ; 0.002 4% Read assertion file (1 call)
% 0.42/0.58 ; 0.000 0% Assert (5 calls)
% 0.42/0.58 ; 0.008 15% Process new row (238 calls)
% 0.42/0.58 ; 0.003 6% Resolution (46 calls)
% 0.42/0.58 ; 0.004 8% Paramodulation (23 calls)
% 0.42/0.58 ; 0.000 0% Condensing (4 calls)
% 0.42/0.58 ; 0.000 0% Forward subsumption (4 calls)
% 0.42/0.58 ; 0.000 0% Backward subsumption (4 calls)
% 0.42/0.58 ; 0.009 17% Forward simplification (224 calls)
% 0.42/0.58 ; 0.002 4% Backward simplification (46 calls)
% 0.42/0.58 ; 0.003 6% Ordering (566 calls)
% 0.42/0.58 ; 0.000 0% Sortal reasoning (32 calls)
% 0.42/0.58 ; 0.000 0% Purity testing (1 call)
% 0.42/0.58 ; 0.022 42% Other
% 0.42/0.58 ; 0.053 Total
% 0.42/0.58 ; 0.057 Real time
% 0.42/0.58 ;
% 0.42/0.58 ; Term-hash-array has 149 terms in all.
% 0.42/0.58 ; Feature-vector-row-index has 0 entries (1 at peak, 4 added, 4 deleted).
% 0.42/0.58 ; Feature-vector-row-index has 1 node (36 at peak, 108 added, 107 deleted).
% 0.42/0.58 ; Retrieved 0 possibly forward subsuming rows in 4 calls.
% 0.42/0.58 ; Retrieved 0 possibly backward subsumed rows in 4 calls.
% 0.42/0.58 ; Path-index has 70 entries (84 at peak, 230 added, 160 deleted).
% 0.42/0.58 ; Path-index has 200 nodes (247 at peak, 460 added, 260 deleted).
% 0.42/0.58 ; Trie-index has 70 entries (84 at peak, 230 added, 160 deleted).
% 0.42/0.58 ; Trie-index has 218 nodes (268 at peak, 660 added, 442 deleted).
% 0.42/0.58 ; Retrieved 799 generalization terms in 1,045 calls.
% 0.42/0.58 ; Retrieved 153 instance terms in 46 calls.
% 0.42/0.58 ; Retrieved 618 unifiable terms in 179 calls.
% 0.42/0.58 ;
% 0.42/0.58 ; The agenda of rows to process has 23 entries:
% 0.42/0.58 ; 5 with value 21 12 with value 23 4 with value 24
% 0.42/0.58 ; 2 with value 22
% 0.42/0.58 ; The agenda of rows to give has 9 entries:
% 0.42/0.58 ; 1 with value (4 18) 3 with value (4 20) 1 with value (4 22)
% 0.42/0.58 ; 3 with value (4 19) 1 with value (4 21)
% 0.42/0.58 Evaluation took:
% 0.42/0.58 0.057 seconds of real time
% 0.42/0.58 0.048589 seconds of user run time
% 0.42/0.58 0.009003 seconds of system run time
% 0.42/0.58 0 calls to %EVAL
% 0.42/0.58 0 page faults and
% 0.42/0.58 4,851,752 bytes consed.
% 0.42/0.58 :PROOF-FOUND
% 0.42/0.58 ; End refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-06-14T00:38:55
% 0.42/0.58 :PROOF-FOUND
% 0.42/0.58 *
%------------------------------------------------------------------------------