TSTP Solution File: GRP048-10 by SNARK---20120808r022
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : GRP048-10 : TPTP v8.1.0. Released v7.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run-snark %s %d
% Computer : n008.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:35:28 EDT 2022
% Result : Unsatisfiable 11.40s 11.62s
% Output : Refutation 11.50s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 9
% Syntax : Number of clauses : 38 ( 38 unt; 0 nHn; 10 RR)
% Number of literals : 38 ( 37 equ; 1 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 : 9 ( 9 usr; 4 con; 0-4 aty)
% Number of variables : 59 ( 1 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(ifeq_axiom,axiom,
ifeq(X,X,Y,Z) = Y,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ifeq_axiom) ).
cnf(left_identity,axiom,
product(identity,X,X) = true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',left_identity) ).
cnf(left_inverse,axiom,
product(inverse(X),X,identity) = true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',left_inverse) ).
cnf(total_function1,axiom,
product(X,Y,multiply(X,Y)) = true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',total_function1) ).
cnf(total_function2,axiom,
ifeq(product(X,Y,Z),true,ifeq(product(X,Y,U),true,equalish(U,Z),true),true) = true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',total_function2) ).
cnf(associativity1,axiom,
ifeq(product(X,Y,Z),true,ifeq(product(U,Y,V),true,ifeq(product(W,U,X),true,product(W,V,Z),true),true),true) = true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',associativity1) ).
cnf(product_substitution3,axiom,
ifeq(equalish(X,Y),true,ifeq(product(Z,U,X),true,product(Z,U,Y),true),true) = true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',product_substitution3) ).
cnf(a_equals_b,hypothesis,
equalish(a,b) = true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a_equals_b) ).
cnf(prove_inverse_substitution,negated_conjecture,
equalish(inverse(a),inverse(b)) != true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_inverse_substitution) ).
cnf(11,plain,
ifeq(product(identity,X,Y),true,equalish(Y,X),true) = true,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[total_function2,left_identity,theory(equality)]),ifeq_axiom,theory(equality)]) ).
cnf(15,plain,
ifeq(product(inverse(X),X,Y),true,equalish(Y,identity),true) = true,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[total_function2,left_inverse,theory(equality)]),ifeq_axiom,theory(equality)]) ).
cnf(18,plain,
ifeq(equalish(X,Y),true,product(identity,X,Y),true) = true,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[product_substitution3,left_identity,theory(equality)]),ifeq_axiom,theory(equality)]) ).
cnf(22,plain,
ifeq(equalish(multiply(X,Y),Z),true,product(X,Y,Z),true) = true,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[product_substitution3,total_function1,theory(equality)]),ifeq_axiom,theory(equality)]) ).
cnf(25,plain,
ifeq(product(X,Y,Z),true,ifeq(product(U,X,identity),true,product(U,Z,Y),true),true) = true,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[associativity1,left_identity,theory(equality)]),ifeq_axiom,theory(equality)]) ).
cnf(61,plain,
product(identity,a,b) = true,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[18,a_equals_b,theory(equality)]),ifeq_axiom,theory(equality)]) ).
cnf(63,plain,
equalish(b,a) = true,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[11,61,theory(equality)]),ifeq_axiom,theory(equality)]) ).
cnf(78,plain,
ifeq(product(X,Y,b),true,product(X,Y,a),true) = true,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[product_substitution3,63,theory(equality)]),ifeq_axiom,theory(equality)]) ).
cnf(862,plain,
ifeq(product(X,inverse(Y),identity),true,product(X,identity,Y),true) = true,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[25,left_inverse,theory(equality)]),ifeq_axiom,theory(equality)]) ).
cnf(863,plain,
ifeq(product(X,Y,Z),true,product(inverse(X),Z,Y),true) = true,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[25,left_inverse,theory(equality)]),ifeq_axiom,theory(equality)]) ).
cnf(1290,plain,
product(inverse(inverse(X)),identity,X) = true,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[862,left_inverse,theory(equality)]),ifeq_axiom,theory(equality)]) ).
cnf(1316,plain,
ifeq(product(inverse(inverse(X)),identity,Y),true,equalish(X,Y),true) = true,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[total_function2,1290,theory(equality)]),ifeq_axiom,theory(equality)]) ).
cnf(1779,plain,
product(inverse(X),multiply(X,Y),Y) = true,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[863,total_function1,theory(equality)]),ifeq_axiom,theory(equality)]) ).
cnf(1785,plain,
product(inverse(inverse(inverse(X))),X,identity) = true,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[863,1290,theory(equality)]),ifeq_axiom,theory(equality)]) ).
cnf(1843,plain,
product(inverse(inverse(X)),Y,multiply(X,Y)) = true,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[863,1779,theory(equality)]),ifeq_axiom,theory(equality)]) ).
cnf(1909,plain,
product(inverse(inverse(inverse(inverse(X)))),identity,X) = true,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[863,1785,theory(equality)]),ifeq_axiom,theory(equality)]) ).
cnf(1991,plain,
equalish(multiply(X,inverse(X)),identity) = true,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[15,1843,theory(equality)]),ifeq_axiom,theory(equality)]) ).
cnf(2016,plain,
product(X,inverse(X),identity) = true,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[22,1991,theory(equality)]),ifeq_axiom,theory(equality)]) ).
cnf(2024,plain,
product(X,identity,X) = true,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[862,2016,theory(equality)]),ifeq_axiom,theory(equality)]) ).
cnf(2053,plain,
ifeq(product(X,identity,Y),true,equalish(X,Y),true) = true,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[total_function2,2024,theory(equality)]),ifeq_axiom,theory(equality)]) ).
cnf(2054,plain,
ifeq(equalish(X,Y),true,product(X,identity,Y),true) = true,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[product_substitution3,2024,theory(equality)]),ifeq_axiom,theory(equality)]) ).
cnf(8350,plain,
equalish(inverse(inverse(X)),X) = true,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[1316,1909,theory(equality)]),ifeq_axiom,theory(equality)]) ).
cnf(8517,plain,
product(identity,inverse(inverse(X)),X) = true,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[18,8350,theory(equality)]),ifeq_axiom,theory(equality)]) ).
cnf(8570,plain,
product(identity,inverse(inverse(b)),a) = true,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[78,8517,theory(equality)]),ifeq_axiom,theory(equality)]) ).
cnf(8636,plain,
equalish(a,inverse(inverse(b))) = true,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[11,8570,theory(equality)]),ifeq_axiom,theory(equality)]) ).
cnf(10935,plain,
product(a,identity,inverse(inverse(b))) = true,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[2054,8636,theory(equality)]),ifeq_axiom,theory(equality)]) ).
cnf(11298,plain,
product(inverse(a),inverse(inverse(b)),identity) = true,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[863,10935,theory(equality)]),ifeq_axiom,theory(equality)]) ).
cnf(28099,plain,
product(inverse(a),identity,inverse(b)) = true,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[862,11298,theory(equality)]),ifeq_axiom,theory(equality)]) ).
cnf(28128,plain,
$false,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[2053,28099,theory(equality)]),prove_inverse_substitution,ifeq_axiom,theory(equality)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : GRP048-10 : TPTP v8.1.0. Released v7.5.0.
% 0.12/0.13 % Command : run-snark %s %d
% 0.12/0.34 % Computer : n008.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Mon Jun 13 07:13:52 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.19/0.45 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.46 *
% 0.19/0.46 *
% 0.19/0.46 #<PACKAGE "SNARK-USER">
% 0.19/0.46 *
% 0.19/0.46 SNARK-TPTP-OPTIONS
% 0.19/0.46 *
% 0.19/0.46 ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.19/0.46 (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.19/0.46 (USE-FACTORING :POS)
% 0.19/0.46 (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.19/0.46 (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.19/0.46 (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.19/0.46 (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.19/0.46 (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.19/0.46 (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.19/0.46 (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.19/0.46 (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.19/0.46 (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.19/0.46 (DECLARE-TPTP-SYMBOLS2))
% 0.19/0.46 *
% 0.19/0.46 "."
% 0.19/0.46 *
% 0.19/0.46 ; Begin refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-06-13T07:13:52
% 0.19/0.46 ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n008.cluster.edu at 2022-06-13T07:13:52
% 11.40/11.62
% 11.40/11.62
% 11.40/11.62 #||
% 11.40/11.62 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 11.40/11.62 % SZS output start Refutation
% See solution above
% 11.50/11.68 ||#
% 11.50/11.68
% 11.50/11.68 ; Summary of computation:
% 11.50/11.68 ; 71024 formulas have been input or derived (from 1740 formulas).
% 11.50/11.68 ; 28128 (40%) were retained. Of these,
% 11.50/11.68 ; 4251 (15%) were simplified or subsumed later,
% 11.50/11.68 ; 23877 (85%) are still being kept.
% 11.50/11.68 ;
% 11.50/11.68 ; Run time in seconds excluding printing time:
% 11.50/11.68 ; 0.002 0% Read assertion file (1 call)
% 11.50/11.68 ; 0.001 0% Assert (10 calls)
% 11.50/11.68 ; 4.617 41% Process new row (69,852 calls)
% 11.50/11.68 ; 0.150 1% Resolution (3,478 calls)
% 11.50/11.68 ; 2.015 18% Paramodulation (1,739 calls)
% 11.50/11.68 ; 2.670 24% Forward simplification (69,628 calls)
% 11.50/11.68 ; 1.129 10% Backward simplification (28,128 calls)
% 11.50/11.68 ; 0.319 3% Ordering (147,896 calls)
% 11.50/11.68 ; 0.000 0% Sortal reasoning (32 calls)
% 11.50/11.68 ; 0.000 0% Purity testing (1 call)
% 11.50/11.68 ; 0.248 2% Other
% 11.50/11.68 ; 11.151 Total
% 11.50/11.68 ; 11.212 Real time
% 11.50/11.68 ;
% 11.50/11.68 ; Term-hash-array has 71,656 terms in all.
% 11.50/11.68 ; Feature-vector-row-index has 0 entries (0 at peak, 0 added, 0 deleted).
% 11.50/11.68 ; Feature-vector-row-index has 1 node (1 at peak, 1 added, 0 deleted).
% 11.50/11.68 ; Path-index has 62,841 entries (62,841 at peak, 71,755 added, 8,914 deleted).
% 11.50/11.68 ; Path-index has 11,845 nodes (11,845 at peak, 14,209 added, 2,364 deleted).
% 11.50/11.68 ; Trie-index has 62,841 entries (62,841 at peak, 71,755 added, 8,914 deleted).
% 11.50/11.68 ; Trie-index has 349,325 nodes (349,325 at peak, 414,260 added, 64,935 deleted).
% 11.50/11.68 ; Retrieved 341,154 generalization terms in 267,782 calls.
% 11.50/11.68 ; Retrieved 50,764 instance terms in 28,127 calls.
% 11.50/11.68 ; Retrieved 639,470 unifiable terms in 15,900 calls.
% 11.50/11.68 ;
% 11.50/11.68 ; The agenda of rows to process has 28 entries:
% 11.50/11.68 ; 2 with value 28 1 with value 33 4 with value 36
% 11.50/11.68 ; 1 with value 30 2 with value 34 2 with value 37
% 11.50/11.68 ; 5 with value 31 1 with value 35 8 with value 45
% 11.50/11.68 ; 2 with value 32
% 11.50/11.68 ; The agenda of rows to give has 22226 entries:
% 11.50/11.68 ; 195 with value (4 24) 1707 with value (4 32) 1684 with value (4 40)
% 11.50/11.68 ; 1192 with value (4 25) 842 with value (4 33) 1494 with value (4 41)
% 11.50/11.68 ; 1715 with value (4 26) 494 with value (4 34) 170 with value (4 42)
% 11.50/11.68 ; 1627 with value (4 27) 488 with value (4 35) 274 with value (4 43)
% 11.50/11.68 ; 1347 with value (4 28) 901 with value (4 36) 507 with value (4 44)
% 11.50/11.68 ; 1137 with value (4 29) 1035 with value (4 37) 476 with value (4 45)
% 11.50/11.68 ; 1295 with value (4 30) 829 with value (4 38) 202 with value (4 46)
% 11.50/11.68 ; 1352 with value (4 31) 1263 with value (4 39)
% 11.50/11.68 Evaluation took:
% 11.50/11.68 11.214 seconds of real time
% 11.50/11.68 10.266851 seconds of user run time
% 11.50/11.68 0.947822 seconds of system run time
% 11.50/11.68 [Run times include 3.04 seconds GC run time.]
% 11.50/11.68 0 calls to %EVAL
% 11.50/11.68 0 page faults and
% 11.50/11.68 631,225,872 bytes consed.
% 11.50/11.68 :PROOF-FOUND
% 11.50/11.68 ; End refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-06-13T07:14:04
% 11.50/11.68 :PROOF-FOUND
% 11.50/11.68 *
%------------------------------------------------------------------------------