TSTP Solution File: GRP093-1 by SNARK---20120808r022
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : GRP093-1 : TPTP v8.1.0. Bugfixed v2.7.0.
% Transfm : none
% Format : tptp:raw
% Command : run-snark %s %d
% Computer : n014.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:07 EDT 2022
% Result : Unsatisfiable 0.21s 0.54s
% Output : Refutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 5
% Syntax : Number of clauses : 29 ( 26 unt; 0 nHn; 8 RR)
% Number of literals : 35 ( 34 equ; 12 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 : 13 ( 13 usr; 10 con; 0-2 aty)
% Number of variables : 46 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(single_axiom,axiom,
divide(divide(identity,divide(divide(divide(X,Y),Z),X)),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,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(6,plain,
multiply(X,Y) = divide(X,inverse(Y)),
inference('REWRITE',[status(thm)],[multiply,inverse,theory(equality)]) ).
cnf(7,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,inverse,identity,6,theory(equality)]) ).
cnf(8,plain,
divide(inverse(divide(divide(divide(X,Y),Z),X)),Z) = Y,
inference('REWRITE',[status(thm)],[single_axiom,inverse,theory(equality)]) ).
cnf(9,plain,
identity = inverse(identity),
inference('PARAMODULATE',[status(thm)],[identity,inverse,theory(equality)]) ).
cnf(10,plain,
divide(inverse(inverse(X)),divide(X,Y)) = Y,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[8,identity,theory(equality)]),inverse,theory(equality)]) ).
cnf(11,plain,
divide(inverse(divide(inverse(X),Y)),X) = Y,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[8,identity,theory(equality)]),inverse,theory(equality)]) ).
cnf(14,plain,
inverse(inverse(X)) = X,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[10,9,theory(equality)]),inverse,9,theory(equality)]) ).
cnf(15,plain,
divide(X,divide(X,Y)) = Y,
inference('REWRITE',[status(thm)],[10,14,theory(equality)]) ).
cnf(16,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)],[7,14,theory(equality)]) ).
cnf(19,plain,
divide(inverse(divide(X,Y)),divide(divide(Y,Z),X)) = Z,
inference('PARAMODULATE',[status(thm)],[8,15,theory(equality)]) ).
cnf(22,plain,
divide(inverse(X),Y) = divide(inverse(Y),X),
inference('PARAMODULATE',[status(thm)],[11,15,theory(equality)]) ).
cnf(26,plain,
divide(X,Y) = divide(inverse(Y),inverse(X)),
inference('PARAMODULATE',[status(thm)],[22,14,theory(equality)]) ).
cnf(28,plain,
divide(X,inverse(Y)) = divide(Y,inverse(X)),
inference('PARAMODULATE',[status(thm)],[26,14,theory(equality)]) ).
cnf(29,plain,
divide(divide(b3,inverse(a3)),inverse(c3)) != divide(divide(c3,inverse(b3)),inverse(a3)),
inference('REWRITE',[status(thm)],[16,28,theory(equality)]) ).
cnf(31,plain,
inverse(divide(divide(X,Y),X)) = Y,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[19,identity,theory(equality)]),inverse,9,theory(equality)]) ).
cnf(33,plain,
divide(inverse(divide(X,Y)),Z) = divide(divide(Y,Z),X),
inference('PARAMODULATE',[status(thm)],[15,19,theory(equality)]) ).
cnf(34,plain,
divide(divide(b3,inverse(a3)),inverse(c3)) != divide(b3,divide(inverse(a3),c3)),
inference('REWRITE',[status(thm)],[29,26,33,theory(equality)]) ).
cnf(36,plain,
inverse(X) = divide(divide(Y,X),Y),
inference('PARAMODULATE',[status(thm)],[14,31,theory(equality)]) ).
cnf(38,plain,
inverse(divide(X,Y)) = divide(Y,X),
inference('PARAMODULATE',[status(thm)],[36,15,theory(equality)]) ).
cnf(39,plain,
divide(divide(X,Y),Z) = divide(divide(X,Z),Y),
inference('REWRITE',[status(thm)],[33,38,theory(equality)]) ).
cnf(41,plain,
divide(divide(X,Y),inverse(Z)) = divide(Z,divide(Y,X)),
inference('PARAMODULATE',[status(thm)],[28,38,theory(equality)]) ).
cnf(42,plain,
divide(c3,divide(inverse(a3),b3)) != divide(b3,divide(inverse(a3),c3)),
inference('REWRITE',[status(thm)],[34,41,theory(equality)]) ).
cnf(50,plain,
divide(X,divide(Y,Z)) = divide(Z,divide(Y,X)),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[38,39,theory(equality)]),38,theory(equality)]) ).
cnf(51,plain,
$false,
inference('REWRITE',[status(thm)],[42,50,theory(equality)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : GRP093-1 : TPTP v8.1.0. Bugfixed v2.7.0.
% 0.14/0.13 % Command : run-snark %s %d
% 0.14/0.34 % Computer : n014.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 600
% 0.14/0.35 % DateTime : Tue Jun 14 07:46:06 EDT 2022
% 0.14/0.35 % CPUTime :
% 0.21/0.46 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.21/0.47 *
% 0.21/0.48 *
% 0.21/0.48 #<PACKAGE "SNARK-USER">
% 0.21/0.48 *
% 0.21/0.48 SNARK-TPTP-OPTIONS
% 0.21/0.48 *
% 0.21/0.48 ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.21/0.48 (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.21/0.48 (USE-FACTORING :POS)
% 0.21/0.48 (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.21/0.48 (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.21/0.48 (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.21/0.48 (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.21/0.48 (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.21/0.48 (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.21/0.48 (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.21/0.48 (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.21/0.48 (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.21/0.48 (DECLARE-TPTP-SYMBOLS2))
% 0.21/0.48 *
% 0.21/0.48 "."
% 0.21/0.48 *
% 0.21/0.48 ; Begin refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-06-14T07:46:07
% 0.21/0.48 ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n014.cluster.edu at 2022-06-14T07:46:07
% 0.21/0.54
% 0.21/0.54
% 0.21/0.54 #||
% 0.21/0.54 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.21/0.54 % SZS output start Refutation
% See solution above
% 0.21/0.54 ||#
% 0.21/0.54
% 0.21/0.54 ; Summary of computation:
% 0.21/0.54 ; 361 formulas have been input or derived (from 28 formulas).
% 0.21/0.54 ; 51 (14%) were retained. Of these,
% 0.21/0.54 ; 27 (53%) were simplified or subsumed later,
% 0.21/0.54 ; 24 (47%) are still being kept.
% 0.21/0.54 ;
% 0.21/0.54 ; Run time in seconds excluding printing time:
% 0.21/0.54 ; 0.002 3% Read assertion file (1 call)
% 0.21/0.54 ; 0.000 0% Assert (5 calls)
% 0.21/0.54 ; 0.008 14% Process new row (333 calls)
% 0.21/0.54 ; 0.002 3% Resolution (54 calls)
% 0.21/0.54 ; 0.006 10% Paramodulation (27 calls)
% 0.21/0.54 ; 0.000 0% Condensing (3 calls)
% 0.21/0.54 ; 0.000 0% Forward subsumption (3 calls)
% 0.21/0.55 ; 0.000 0% Backward subsumption (3 calls)
% 0.21/0.55 ; 0.007 12% Forward simplification (273 calls)
% 0.21/0.55 ; 0.003 5% Backward simplification (51 calls)
% 0.21/0.55 ; 0.004 7% Ordering (831 calls)
% 0.21/0.55 ; 0.001 2% Sortal reasoning (32 calls)
% 0.21/0.55 ; 0.000 0% Purity testing (1 call)
% 0.21/0.55 ; 0.025 43% Other
% 0.21/0.55 ; 0.058 Total
% 0.21/0.55 ; 0.062 Real time
% 0.21/0.55 ;
% 0.21/0.55 ; Term-hash-array has 168 terms in all.
% 0.21/0.55 ; Feature-vector-row-index has 0 entries (1 at peak, 3 added, 3 deleted).
% 0.21/0.55 ; Feature-vector-row-index has 1 node (36 at peak, 85 added, 84 deleted).
% 0.21/0.55 ; Retrieved 0 possibly forward subsuming rows in 3 calls.
% 0.21/0.55 ; Retrieved 0 possibly backward subsumed rows in 3 calls.
% 0.21/0.55 ; Path-index has 69 entries (78 at peak, 234 added, 165 deleted).
% 0.21/0.55 ; Path-index has 240 nodes (274 at peak, 523 added, 283 deleted).
% 0.21/0.55 ; Trie-index has 69 entries (78 at peak, 234 added, 165 deleted).
% 0.21/0.55 ; Trie-index has 193 nodes (223 at peak, 740 added, 547 deleted).
% 0.21/0.55 ; Retrieved 1,078 generalization terms in 1,362 calls.
% 0.21/0.55 ; Retrieved 158 instance terms in 58 calls.
% 0.21/0.55 ; Retrieved 608 unifiable terms in 208 calls.
% 0.21/0.55 ;
% 0.21/0.55 ; The agenda of rows to process has 18 entries:
% 0.21/0.55 ; 10 with value 22 6 with value 23 2 with value 24
% 0.21/0.55 ; The agenda of rows to give has 10 entries:
% 0.21/0.55 ; 1 with value (4 17) 2 with value (4 20) 1 with value (4 22)
% 0.21/0.55 ; 1 with value (4 18) 5 with value (4 21)
% 0.21/0.55 Evaluation took:
% 0.21/0.55 0.063 seconds of real time
% 0.21/0.55 0.055659 seconds of user run time
% 0.21/0.55 0.007016 seconds of system run time
% 0.21/0.55 0 calls to %EVAL
% 0.21/0.55 0 page faults and
% 0.21/0.55 4,995,168 bytes consed.
% 0.21/0.55 :PROOF-FOUND
% 0.21/0.55 ; End refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-06-14T07:46:07
% 0.21/0.55 :PROOF-FOUND
% 0.21/0.55 *
%------------------------------------------------------------------------------