TSTP Solution File: GRP173-1 by SNARK---20120808r022
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : GRP173-1 : TPTP v8.1.0. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : run-snark %s %d
% Computer : n032.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:37:18 EDT 2022
% Result : Unsatisfiable 0.41s 0.59s
% Output : Refutation 0.41s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 7
% Syntax : Number of clauses : 15 ( 15 unt; 0 nHn; 5 RR)
% Number of literals : 15 ( 14 equ; 1 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 16 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(left_identity,axiom,
multiply(identity,X) = X,
file('/export/starexec/sandbox/benchmark/Axioms/GRP004-0.ax',left_identity) ).
cnf(left_inverse,axiom,
multiply(inverse(X),X) = identity,
file('/export/starexec/sandbox/benchmark/Axioms/GRP004-0.ax',left_inverse) ).
cnf(associativity,axiom,
multiply(multiply(X,Y),Z) = multiply(X,multiply(Y,Z)),
file('/export/starexec/sandbox/benchmark/Axioms/GRP004-0.ax',associativity) ).
cnf(monotony_lub1,axiom,
multiply(X,least_upper_bound(Y,Z)) = least_upper_bound(multiply(X,Y),multiply(X,Z)),
file('/export/starexec/sandbox/benchmark/Axioms/GRP004-2.ax',monotony_lub1) ).
cnf(p05a_1,hypothesis,
least_upper_bound(identity,a) = identity,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',p05a_1) ).
cnf(p05a_2,hypothesis,
least_upper_bound(identity,inverse(a)) = identity,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',p05a_2) ).
cnf(prove_p05a,negated_conjecture,
identity != a,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_p05a) ).
cnf(82,plain,
X = multiply(inverse(Y),multiply(Y,X)),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[associativity,left_inverse,theory(equality)]),left_identity,theory(equality)]) ).
cnf(89,plain,
multiply(X,identity) = least_upper_bound(multiply(X,identity),multiply(X,a)),
inference('PARAMODULATE',[status(thm)],[monotony_lub1,p05a_1,theory(equality)]) ).
cnf(184,plain,
X = multiply(inverse(inverse(X)),identity),
inference('PARAMODULATE',[status(thm)],[82,left_inverse,theory(equality)]) ).
cnf(185,plain,
multiply(X,Y) = multiply(inverse(inverse(X)),Y),
inference('PARAMODULATE',[status(thm)],[82,82,theory(equality)]) ).
cnf(186,plain,
X = multiply(X,identity),
inference('REWRITE',[status(thm)],[184,185,theory(equality)]) ).
cnf(188,plain,
X = least_upper_bound(X,multiply(X,a)),
inference('REWRITE',[status(thm)],[89,186,theory(equality)]) ).
cnf(207,plain,
inverse(a) = identity,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[188,left_inverse,theory(equality)]),p05a_2,theory(equality)]) ).
cnf(216,plain,
$false,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[left_inverse,207,theory(equality)]),prove_p05a,left_identity,theory(equality)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : GRP173-1 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.00/0.11 % Command : run-snark %s %d
% 0.11/0.31 % Computer : n032.cluster.edu
% 0.11/0.31 % Model : x86_64 x86_64
% 0.11/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.31 % Memory : 8042.1875MB
% 0.11/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.31 % CPULimit : 300
% 0.11/0.31 % WCLimit : 600
% 0.11/0.31 % DateTime : Mon Jun 13 19:14:27 EDT 2022
% 0.17/0.31 % CPUTime :
% 0.17/0.41 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.17/0.42 *
% 0.17/0.42 *
% 0.17/0.42 #<PACKAGE "SNARK-USER">
% 0.17/0.42 *
% 0.17/0.42 SNARK-TPTP-OPTIONS
% 0.17/0.42 *
% 0.17/0.42 ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.17/0.42 (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.17/0.42 (USE-FACTORING :POS)
% 0.17/0.42 (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.17/0.42 (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.17/0.42 (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.17/0.42 (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.17/0.42 (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.17/0.42 (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.17/0.42 (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.17/0.42 (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.17/0.42 (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.17/0.42 (DECLARE-TPTP-SYMBOLS2))
% 0.17/0.42 *
% 0.17/0.42 "."
% 0.17/0.42 *
% 0.17/0.42 ; Begin refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-06-13T19:14:27
% 0.17/0.42 ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n032.cluster.edu at 2022-06-13T19:14:27
% 0.17/0.43
% 0.17/0.43 ; Recognized left identity assertion (= (|multiply| |identity| ?X) ?X).
% 0.17/0.43 ; Recognized possible left inverse assertion (= (|multiply| (|inverse| ?X) ?X) |identity|).
% 0.17/0.43 ; Recognized associativity assertion (= (|multiply| (|multiply| ?X ?Y) ?Z) (|multiply| ?X (|multiply| ?Y ?Z))).
% 0.17/0.43 ; Recognized commutativity assertion (= (|greatest_lower_bound| ?X ?Y) (|greatest_lower_bound| ?Y ?X)).
% 0.17/0.43 ; Recognized commutativity assertion (= (|least_upper_bound| ?X ?Y) (|least_upper_bound| ?Y ?X)).
% 0.17/0.43 ; Recognized associativity assertion (= (|greatest_lower_bound| ?X (|greatest_lower_bound| ?Y ?Z)) (|greatest_lower_bound| (|greatest_lower_bound| ?X ?Y) ?Z)).
% 0.17/0.43 ; Recognized associativity assertion (= (|least_upper_bound| ?X (|least_upper_bound| ?Y ?Z)) (|least_upper_bound| (|least_upper_bound| ?X ?Y) ?Z)).
% 0.17/0.43 ; Declaring greatest_lower_bound to be commutative.
% 0.17/0.43 ; Declaring greatest_lower_bound to be associative-commutative.
% 0.17/0.43 ; Declaring least_upper_bound to be commutative.
% 0.41/0.59 ; Declaring least_upper_bound to be associative-commutative.
% 0.41/0.59
% 0.41/0.59 #||
% 0.41/0.59 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.41/0.59 % SZS output start Refutation
% See solution above
% 0.41/0.59 ||#
% 0.41/0.59
% 0.41/0.59 ; Summary of computation:
% 0.41/0.59 ; 1175 formulas have been input or derived (from 36 formulas).
% 0.41/0.59 ; 216 (18%) were retained. Of these,
% 0.41/0.59 ; 52 (24%) were simplified or subsumed later,
% 0.41/0.59 ; 164 (76%) are still being kept.
% 0.41/0.59 ;
% 0.41/0.59 ; Run time in seconds excluding printing time:
% 0.41/0.59 ; 0.002 1% Read assertion file (1 call)
% 0.41/0.59 ; 0.001 1% Assert (18 calls)
% 0.41/0.59 ; 0.012 7% Process new row (1,136 calls)
% 0.41/0.59 ; 0.000 0% Resolution (70 calls)
% 0.41/0.59 ; 0.020 12% Paramodulation (35 calls)
% 0.41/0.59 ; 0.000 0% Embedding (99 calls)
% 0.41/0.59 ; 0.102 63% Forward simplification (1,039 calls)
% 0.41/0.59 ; 0.003 2% Backward simplification (121 calls)
% 0.41/0.59 ; 0.005 3% Ordering (1,010 calls)
% 0.41/0.59 ; 0.000 0% Ordering ac (311 calls)
% 0.41/0.59 ; 0.000 0% Sortal reasoning (32 calls)
% 0.41/0.59 ; 0.000 0% Purity testing (1 call)
% 0.41/0.59 ; 0.017 10% Other
% 0.41/0.59 ; 0.162 Total
% 0.41/0.59 ; 0.167 Real time
% 0.41/0.59 ;
% 0.41/0.59 ; Term-hash-array has 624 terms in all.
% 0.41/0.59 ; Feature-vector-row-index has 0 entries (0 at peak, 0 added, 0 deleted).
% 0.41/0.59 ; Feature-vector-row-index has 1 node (1 at peak, 1 added, 0 deleted).
% 0.41/0.59 ; Path-index has 506 entries (557 at peak, 635 added, 129 deleted).
% 0.41/0.59 ; Path-index has 362 nodes (378 at peak, 402 added, 40 deleted).
% 0.41/0.59 ; Trie-index has 506 entries (557 at peak, 635 added, 129 deleted).
% 0.41/0.59 ; Trie-index has 239 nodes (251 at peak, 287 added, 48 deleted).
% 0.41/0.59 ; Retrieved 124,109 generalization terms in 10,233 calls.
% 0.43/0.59 ; Retrieved 360 instance terms in 144 calls.
% 0.43/0.59 ; Retrieved 1,825 unifiable terms in 177 calls.
% 0.43/0.59 ;
% 0.43/0.59 ; The agenda of rows to process has 1 entry:
% 0.43/0.59 ; 1 with value 13
% 0.43/0.59 ; The agenda of rows to give has 132 entries:
% 0.43/0.59 ; 1 with value (4 11) 12 with value (4 19) 4 with value (4 26)
% 0.43/0.59 ; 2 with value (4 12) 9 with value (4 20) 4 with value (4 27)
% 0.43/0.59 ; 1 with value (4 13) 20 with value (4 21) 12 with value (4 28)
% 0.43/0.59 ; 4 with value (4 14) 10 with value (4 22) 4 with value (4 30)
% 0.43/0.59 ; 7 with value (4 15) 6 with value (4 23) 4 with value (4 31)
% 0.43/0.59 ; 4 with value (4 16) 4 with value (4 24) 4 with value (4 33)
% 0.43/0.59 ; 6 with value (4 17) 4 with value (4 25) 4 with value (4 36)
% 0.43/0.59 ; 6 with value (4 18)
% 0.43/0.59 Evaluation took:
% 0.43/0.59 0.167 seconds of real time
% 0.43/0.59 0.1566 seconds of user run time
% 0.43/0.59 0.010841 seconds of system run time
% 0.43/0.59 [Run times include 0.003 seconds GC run time.]
% 0.43/0.59 0 calls to %EVAL
% 0.43/0.59 0 page faults and
% 0.43/0.59 12,993,032 bytes consed.
% 0.43/0.59 :PROOF-FOUND
% 0.43/0.59 ; End refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-06-13T19:14:27
% 0.43/0.59 :PROOF-FOUND
% 0.43/0.59 *
%------------------------------------------------------------------------------