TSTP Solution File: GRP547-1 by SNARK---20120808r022
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : GRP547-1 : TPTP v8.1.0. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : run-snark %s %d
% Computer : n015.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:22 EDT 2022
% Result : Unsatisfiable 0.19s 0.50s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 5
% Syntax : Number of clauses : 33 ( 33 unt; 0 nHn; 8 RR)
% Number of literals : 33 ( 32 equ; 6 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 5 ( 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 : 53 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(single_axiom,axiom,
divide(divide(identity,divide(X,Y)),divide(divide(Y,Z),X)) = Z,
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,Y)),divide(divide(Y,Z),X)) = Z,
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,
inverse(divide(divide(X,Y),X)) = Y,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[8,identity,theory(equality)]),inverse,9,theory(equality)]) ).
cnf(11,plain,
divide(inverse(divide(X,Y)),inverse(X)) = Y,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[8,identity,theory(equality)]),inverse,theory(equality)]) ).
cnf(12,plain,
divide(inverse(inverse(X)),divide(divide(X,Y),identity)) = Y,
inference('PARAMODULATE',[status(thm)],[8,inverse,theory(equality)]) ).
cnf(13,plain,
divide(inverse(divide(X,identity)),divide(inverse(Y),X)) = Y,
inference('PARAMODULATE',[status(thm)],[8,inverse,theory(equality)]) ).
cnf(14,plain,
divide(X,identity) = X,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[8,identity,theory(equality)]),10,theory(equality)]) ).
cnf(15,plain,
divide(inverse(X),divide(inverse(Y),X)) = Y,
inference('REWRITE',[status(thm)],[13,14,theory(equality)]) ).
cnf(16,plain,
divide(inverse(inverse(X)),divide(X,Y)) = Y,
inference('REWRITE',[status(thm)],[12,14,theory(equality)]) ).
cnf(20,plain,
inverse(inverse(X)) = X,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[10,identity,theory(equality)]),inverse,theory(equality)]) ).
cnf(21,plain,
divide(X,divide(X,Y)) = Y,
inference('REWRITE',[status(thm)],[16,20,theory(equality)]) ).
cnf(23,plain,
inverse(divide(X,inverse(divide(Y,Z)))) = divide(divide(Z,X),Y),
inference('PARAMODULATE',[status(thm)],[10,8,theory(equality)]) ).
cnf(24,plain,
inverse(X) = divide(divide(Y,X),Y),
inference('PARAMODULATE',[status(thm)],[20,10,theory(equality)]) ).
cnf(27,plain,
divide(inverse(X),inverse(Y)) = divide(Y,X),
inference('PARAMODULATE',[status(thm)],[11,21,theory(equality)]) ).
cnf(28,plain,
divide(inverse(X),Y) = divide(inverse(Y),X),
inference('PARAMODULATE',[status(thm)],[21,15,theory(equality)]) ).
cnf(31,plain,
inverse(divide(X,Y)) = divide(Y,X),
inference('PARAMODULATE',[status(thm)],[24,21,theory(equality)]) ).
cnf(32,plain,
divide(divide(a3,inverse(b3)),inverse(c3)) != divide(a3,divide(inverse(b3),c3)),
inference('REWRITE',[status(thm)],[7,28,31,theory(equality)]) ).
cnf(33,plain,
divide(divide(X,Y),Z) = divide(divide(X,Z),Y),
inference('REWRITE',[status(thm)],[23,31,theory(equality)]) ).
cnf(36,plain,
divide(X,inverse(Y)) = divide(Y,inverse(X)),
inference('PARAMODULATE',[status(thm)],[27,20,theory(equality)]) ).
cnf(37,plain,
divide(divide(b3,inverse(a3)),inverse(c3)) != divide(a3,divide(inverse(b3),c3)),
inference('REWRITE',[status(thm)],[32,36,theory(equality)]) ).
cnf(41,plain,
divide(divide(X,Y),inverse(Z)) = divide(Z,divide(Y,X)),
inference('PARAMODULATE',[status(thm)],[27,31,theory(equality)]) ).
cnf(42,plain,
divide(c3,divide(inverse(a3),b3)) != divide(a3,divide(inverse(b3),c3)),
inference('REWRITE',[status(thm)],[37,41,theory(equality)]) ).
cnf(47,plain,
divide(divide(X,inverse(Y)),Z) = divide(Y,divide(Z,X)),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[36,33,theory(equality)]),31,theory(equality)]) ).
cnf(48,plain,
divide(c3,divide(inverse(a3),b3)) != divide(b3,divide(inverse(a3),c3)),
inference('REWRITE',[status(thm)],[42,41,47,theory(equality)]) ).
cnf(49,plain,
divide(X,divide(Y,Z)) = divide(Z,divide(Y,X)),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[31,33,theory(equality)]),31,theory(equality)]) ).
cnf(50,plain,
$false,
inference('REWRITE',[status(thm)],[48,49,theory(equality)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.11 % Problem : GRP547-1 : TPTP v8.1.0. Released v2.6.0.
% 0.02/0.12 % Command : run-snark %s %d
% 0.12/0.33 % Computer : n015.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 15:09:23 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.19/0.43 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.44 *
% 0.19/0.44 *
% 0.19/0.45 #<PACKAGE "SNARK-USER">
% 0.19/0.45 *
% 0.19/0.45 SNARK-TPTP-OPTIONS
% 0.19/0.45 *
% 0.19/0.45 ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.19/0.45 (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.19/0.45 (USE-FACTORING :POS)
% 0.19/0.45 (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.19/0.45 (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.19/0.45 (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.19/0.45 (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.19/0.45 (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.19/0.45 (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.19/0.45 (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.19/0.45 (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.19/0.45 (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.19/0.45 (DECLARE-TPTP-SYMBOLS2))
% 0.19/0.45 *
% 0.19/0.45 "."
% 0.19/0.45 *
% 0.19/0.45 ; Begin refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-06-13T15:09:23
% 0.19/0.45 ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n015.cluster.edu at 2022-06-13T15:09:23
% 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.50 ||#
% 0.19/0.50
% 0.19/0.50 ; Summary of computation:
% 0.19/0.50 ; 259 formulas have been input or derived (from 24 formulas).
% 0.19/0.50 ; 50 (19%) were retained. Of these,
% 0.19/0.50 ; 26 (52%) were simplified or subsumed later,
% 0.19/0.50 ; 24 (48%) are still being kept.
% 0.19/0.50 ;
% 0.19/0.50 ; Run time in seconds excluding printing time:
% 0.19/0.50 ; 0.001 2% Read assertion file (1 call)
% 0.19/0.50 ; 0.001 2% Assert (5 calls)
% 0.19/0.50 ; 0.007 14% Process new row (242 calls)
% 0.19/0.50 ; 0.000 0% Resolution (46 calls)
% 0.19/0.50 ; 0.008 16% Paramodulation (23 calls)
% 0.19/0.50 ; 0.005 10% Forward simplification (230 calls)
% 0.19/0.50 ; 0.003 6% Backward simplification (50 calls)
% 0.19/0.50 ; 0.005 10% Ordering (644 calls)
% 0.19/0.50 ; 0.000 0% Sortal reasoning (32 calls)
% 0.19/0.50 ; 0.000 0% Purity testing (1 call)
% 0.19/0.50 ; 0.021 41% Other
% 0.19/0.50 ; 0.051 Total
% 0.19/0.50 ; 0.056 Real time
% 0.19/0.50 ;
% 0.19/0.50 ; Term-hash-array has 148 terms in all.
% 0.19/0.50 ; Feature-vector-row-index has 0 entries (0 at peak, 0 added, 0 deleted).
% 0.19/0.50 ; Feature-vector-row-index has 1 node (1 at peak, 1 added, 0 deleted).
% 0.19/0.50 ; Path-index has 66 entries (75 at peak, 195 added, 129 deleted).
% 0.19/0.50 ; Path-index has 196 nodes (238 at peak, 402 added, 206 deleted).
% 0.19/0.50 ; Trie-index has 66 entries (75 at peak, 195 added, 129 deleted).
% 0.19/0.50 ; Trie-index has 201 nodes (238 at peak, 648 added, 447 deleted).
% 0.19/0.50 ; Retrieved 859 generalization terms in 1,084 calls.
% 0.19/0.50 ; Retrieved 191 instance terms in 63 calls.
% 0.19/0.50 ; Retrieved 522 unifiable terms in 160 calls.
% 0.19/0.50 ;
% 0.19/0.50 ; The agenda of rows to process has 12 entries:
% 0.19/0.50 ; 8 with value 21 4 with value 22
% 0.19/0.50 ; The agenda of rows to give has 10 entries:
% 0.19/0.50 ; 1 with value (4 16) 2 with value (4 19) 1 with value (4 21)
% 0.19/0.50 ; 1 with value (4 17) 5 with value (4 20)
% 0.19/0.50 Evaluation took:
% 0.19/0.50 0.056 seconds of real time
% 0.19/0.50 0.047794 seconds of user run time
% 0.19/0.50 0.007826 seconds of system run time
% 0.19/0.50 0 calls to %EVAL
% 0.19/0.50 0 page faults and
% 0.19/0.50 4,778,072 bytes consed.
% 0.19/0.50 :PROOF-FOUND
% 0.19/0.50 ; End refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-06-13T15:09:23
% 0.19/0.50 :PROOF-FOUND
% 0.19/0.50 *
%------------------------------------------------------------------------------