TSTP Solution File: GRP192-1 by SNARK---20120808r022
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : GRP192-1 : TPTP v8.1.0. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : run-snark %s %d
% Computer : n016.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:29 EDT 2022
% Result : Unsatisfiable 0.40s 0.61s
% Output : Refutation 0.40s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 7
% Syntax : Number of clauses : 18 ( 18 unt; 0 nHn; 2 RR)
% Number of literals : 18 ( 17 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 : 7 ( 7 usr; 3 con; 0-2 aty)
% Number of variables : 28 ( 6 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(left_identity,axiom,
multiply(identity,X) = X,
file('/export/starexec/sandbox2/benchmark/Axioms/GRP004-0.ax',left_identity) ).
cnf(left_inverse,axiom,
multiply(inverse(X),X) = identity,
file('/export/starexec/sandbox2/benchmark/Axioms/GRP004-0.ax',left_inverse) ).
cnf(associativity,axiom,
multiply(multiply(X,Y),Z) = multiply(X,multiply(Y,Z)),
file('/export/starexec/sandbox2/benchmark/Axioms/GRP004-0.ax',associativity) ).
cnf(lub_absorbtion,axiom,
least_upper_bound(X,greatest_lower_bound(X,Y)) = X,
file('/export/starexec/sandbox2/benchmark/Axioms/GRP004-2.ax',lub_absorbtion) ).
cnf(monotony_glb2,axiom,
multiply(greatest_lower_bound(X,Y),Z) = greatest_lower_bound(multiply(X,Z),multiply(Y,Z)),
file('/export/starexec/sandbox2/benchmark/Axioms/GRP004-2.ax',monotony_glb2) ).
cnf(p40a_1,hypothesis,
least_upper_bound(identity,X) = X,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p40a_1) ).
cnf(prove_p40a,negated_conjecture,
multiply(a,b) != multiply(b,a),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_p40a) ).
cnf(18,plain,
identity = greatest_lower_bound(identity,X),
inference('PARAMODULATE',[status(thm)],[p40a_1,lub_absorbtion,theory(equality)]) ).
cnf(57,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(58,plain,
multiply(multiply(X,inverse(Y)),Y) = multiply(X,identity),
inference('PARAMODULATE',[status(thm)],[associativity,left_inverse,theory(equality)]) ).
cnf(88,plain,
X = greatest_lower_bound(multiply(Y,X),X),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[monotony_glb2,18,theory(equality)]),left_identity,theory(equality)]) ).
cnf(93,plain,
X = multiply(inverse(inverse(X)),identity),
inference('PARAMODULATE',[status(thm)],[57,left_inverse,theory(equality)]) ).
cnf(94,plain,
multiply(X,Y) = multiply(inverse(inverse(X)),Y),
inference('PARAMODULATE',[status(thm)],[57,57,theory(equality)]) ).
cnf(95,plain,
X = multiply(X,identity),
inference('REWRITE',[status(thm)],[93,94,theory(equality)]) ).
cnf(96,plain,
multiply(multiply(X,inverse(Y)),Y) = X,
inference('REWRITE',[status(thm)],[58,95,theory(equality)]) ).
cnf(109,plain,
multiply(X,Y) = Y,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[88,57,theory(equality)]),88,theory(equality)]) ).
cnf(110,plain,
X = Y,
inference('REWRITE',[status(thm)],[96,109,theory(equality)]) ).
cnf(111,plain,
$false,
inference('REWRITE',[status(thm)],[prove_p40a,110,109,theory(equality)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.11 % Problem : GRP192-1 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.07/0.12 % Command : run-snark %s %d
% 0.13/0.33 % Computer : n016.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Tue Jun 14 06:55:15 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.20/0.44 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.20/0.45 *
% 0.20/0.45 *
% 0.20/0.46 #<PACKAGE "SNARK-USER">
% 0.20/0.46 *
% 0.20/0.46 SNARK-TPTP-OPTIONS
% 0.20/0.46 *
% 0.20/0.46 ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.20/0.46 (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.20/0.46 (USE-FACTORING :POS)
% 0.20/0.46 (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.20/0.46 (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.20/0.46 (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.20/0.46 (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.20/0.46 (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.20/0.46 (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.20/0.46 (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.20/0.46 (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.20/0.46 (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.20/0.46 (DECLARE-TPTP-SYMBOLS2))
% 0.20/0.46 *
% 0.20/0.46 "."
% 0.20/0.46 *
% 0.20/0.46 ; Begin refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-06-14T06:55:15
% 0.20/0.46 ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n016.cluster.edu at 2022-06-14T06:55:15
% 0.20/0.47
% 0.20/0.47 ; Recognized left identity assertion (= (|multiply| |identity| ?X) ?X).
% 0.20/0.47 ; Recognized possible left inverse assertion (= (|multiply| (|inverse| ?X) ?X) |identity|).
% 0.20/0.47 ; Recognized associativity assertion (= (|multiply| (|multiply| ?X ?Y) ?Z) (|multiply| ?X (|multiply| ?Y ?Z))).
% 0.20/0.47 ; Recognized commutativity assertion (= (|greatest_lower_bound| ?X ?Y) (|greatest_lower_bound| ?Y ?X)).
% 0.20/0.47 ; Recognized commutativity assertion (= (|least_upper_bound| ?X ?Y) (|least_upper_bound| ?Y ?X)).
% 0.20/0.47 ; Recognized associativity assertion (= (|greatest_lower_bound| ?X (|greatest_lower_bound| ?Y ?Z)) (|greatest_lower_bound| (|greatest_lower_bound| ?X ?Y) ?Z)).
% 0.20/0.47 ; Recognized associativity assertion (= (|least_upper_bound| ?X (|least_upper_bound| ?Y ?Z)) (|least_upper_bound| (|least_upper_bound| ?X ?Y) ?Z)).
% 0.20/0.47 ; Recognized left identity assertion (= (|least_upper_bound| |identity| ?X) ?X).
% 0.20/0.47 ; Declaring greatest_lower_bound to be commutative.
% 0.20/0.47 ; Declaring greatest_lower_bound to be associative-commutative.
% 0.20/0.47 ; Declaring least_upper_bound to be commutative.
% 0.40/0.61 WARNING: Cannot use equality or equivalence (= ?X identity) as rewrite.
% 0.40/0.61 ; Declaring least_upper_bound to be associative-commutative.
% 0.40/0.61
% 0.40/0.61 #||
% 0.40/0.61 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.40/0.61 % SZS output start Refutation
% See solution above
% 0.40/0.61 ||#
% 0.40/0.61
% 0.40/0.61 ; Summary of computation:
% 0.40/0.61 ; 765 formulas have been input or derived (from 24 formulas).
% 0.40/0.61 ; 111 (15%) were retained. Of these,
% 0.40/0.61 ; 109 (98%) were simplified or subsumed later,
% 0.40/0.61 ; 2 ( 2%) are still being kept.
% 0.40/0.61 ;
% 0.40/0.61 ; Run time in seconds excluding printing time:
% 0.40/0.61 ; 0.004 3% Read assertion file (1 call)
% 0.40/0.61 ; 0.001 1% Assert (17 calls)
% 0.40/0.61 ; 0.012 8% Process new row (731 calls)
% 0.40/0.61 ; 0.002 1% Resolution (46 calls)
% 0.40/0.61 ; 0.016 10% Paramodulation (23 calls)
% 0.40/0.61 ; 0.001 1% Embedding (46 calls)
% 0.40/0.61 ; 0.075 49% Forward simplification (688 calls)
% 0.40/0.61 ; 0.009 6% Backward simplification (70 calls)
% 0.40/0.61 ; 0.003 2% Ordering (579 calls)
% 0.40/0.61 ; 0.005 3% Ordering ac (156 calls)
% 0.40/0.61 ; 0.000 0% Sortal reasoning (32 calls)
% 0.40/0.61 ; 0.000 0% Purity testing (1 call)
% 0.40/0.61 ; 0.025 16% Other
% 0.40/0.61 ; 0.153 Total
% 0.40/0.61 ; 0.154 Real time
% 0.40/0.61 ;
% 0.40/0.61 ; Term-hash-array has 351 terms in all.
% 0.40/0.61 ; Feature-vector-row-index has 0 entries (0 at peak, 0 added, 0 deleted).
% 0.40/0.61 ; Feature-vector-row-index has 1 node (1 at peak, 1 added, 0 deleted).
% 0.40/0.61 ; Path-index has 3 entries (337 at peak, 358 added, 355 deleted).
% 0.40/0.61 ; Path-index has 160 nodes (297 at peak, 308 added, 148 deleted).
% 0.40/0.61 ; Trie-index has 3 entries (337 at peak, 358 added, 355 deleted).
% 0.40/0.61 ; Trie-index has 6 nodes (225 at peak, 254 added, 248 deleted).
% 0.40/0.61 ; Retrieved 41,378 generalization terms in 6,142 calls.
% 0.40/0.61 ; Retrieved 410 instance terms in 93 calls.
% 0.40/0.61 ; Retrieved 607 unifiable terms in 113 calls.
% 0.40/0.61 ;
% 0.40/0.61 ; The agenda of rows to process has 21 entries:
% 0.40/0.61 ; 1 with value 16 1 with value 21 1 with value 27
% 0.40/0.61 ; 1 with value 17 1 with value 22 4 with value 28
% 0.40/0.61 ; 3 with value 18 1 with value 23 1 with value 29
% 0.40/0.61 ; 5 with value 20 2 with value 24
% 0.40/0.61 ; The agenda of rows to give has 1 entry:
% 0.40/0.61 ; 1 with value (4 5)
% 0.40/0.61 Evaluation took:
% 0.40/0.61 0.154 seconds of real time
% 0.40/0.61 0.141167 seconds of user run time
% 0.40/0.61 0.013204 seconds of system run time
% 0.40/0.61 0 calls to %EVAL
% 0.40/0.61 0 page faults and
% 0.40/0.61 9,668,608 bytes consed.
% 0.40/0.61 :PROOF-FOUND
% 0.40/0.61 ; End refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-06-14T06:55:16
% 0.40/0.61 :PROOF-FOUND
% 0.40/0.61 *
%------------------------------------------------------------------------------