TSTP Solution File: GRP185-1 by SNARK---20120808r022
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : GRP185-1 : TPTP v8.1.0. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : run-snark %s %d
% Computer : n017.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:25 EDT 2022
% Result : Unsatisfiable 0.19s 0.50s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 1
% Number of leaves : 5
% Syntax : Number of clauses : 6 ( 6 unt; 0 nHn; 2 RR)
% Number of literals : 6 ( 5 equ; 1 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 : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 8 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(left_identity,axiom,
multiply(identity,X) = X,
file('/export/starexec/sandbox/benchmark/Axioms/GRP004-0.ax',left_identity) ).
cnf(idempotence_of_lub,axiom,
least_upper_bound(X,X) = X,
file('/export/starexec/sandbox/benchmark/Axioms/GRP004-2.ax',idempotence_of_lub) ).
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(monotony_lub2,axiom,
multiply(least_upper_bound(X,Y),Z) = least_upper_bound(multiply(X,Z),multiply(Y,Z)),
file('/export/starexec/sandbox/benchmark/Axioms/GRP004-2.ax',monotony_lub2) ).
cnf(prove_p22a,negated_conjecture,
least_upper_bound(multiply(a,b),least_upper_bound(identity,multiply(least_upper_bound(a,identity),least_upper_bound(b,identity)))) != multiply(least_upper_bound(a,identity),least_upper_bound(b,identity)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_p22a) ).
cnf(17,plain,
$false,
inference('REWRITE',[status(thm)],[prove_p22a,idempotence_of_lub,left_identity,monotony_lub1,monotony_lub2,theory(equality)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : GRP185-1 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.06/0.13 % Command : run-snark %s %d
% 0.12/0.34 % Computer : n017.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 : Tue Jun 14 07:38:23 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.19/0.45 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.46 *
% 0.19/0.46 *
% 0.19/0.47 #<PACKAGE "SNARK-USER">
% 0.19/0.47 *
% 0.19/0.47 SNARK-TPTP-OPTIONS
% 0.19/0.47 *
% 0.19/0.47 ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.19/0.47 (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.19/0.47 (USE-FACTORING :POS)
% 0.19/0.47 (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.19/0.47 (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.19/0.47 (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.19/0.47 (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.19/0.47 (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.19/0.47 (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.19/0.47 (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.19/0.47 (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.19/0.47 (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.19/0.47 (DECLARE-TPTP-SYMBOLS2))
% 0.19/0.47 *
% 0.19/0.47 "."
% 0.19/0.47 *
% 0.19/0.47 ; Begin refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-06-14T07:38:24
% 0.19/0.47 ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n017.cluster.edu at 2022-06-14T07:38:24
% 0.19/0.48
% 0.19/0.48 ; Recognized left identity assertion (= (|multiply| |identity| ?X) ?X).
% 0.19/0.49 ; Recognized possible left inverse assertion (= (|multiply| (|inverse| ?X) ?X) |identity|).
% 0.19/0.49 ; Recognized associativity assertion (= (|multiply| (|multiply| ?X ?Y) ?Z) (|multiply| ?X (|multiply| ?Y ?Z))).
% 0.19/0.49 ; Recognized commutativity assertion (= (|greatest_lower_bound| ?X ?Y) (|greatest_lower_bound| ?Y ?X)).
% 0.19/0.49 ; Recognized commutativity assertion (= (|least_upper_bound| ?X ?Y) (|least_upper_bound| ?Y ?X)).
% 0.19/0.49 ; Recognized associativity assertion (= (|greatest_lower_bound| ?X (|greatest_lower_bound| ?Y ?Z)) (|greatest_lower_bound| (|greatest_lower_bound| ?X ?Y) ?Z)).
% 0.19/0.49 ; Recognized associativity assertion (= (|least_upper_bound| ?X (|least_upper_bound| ?Y ?Z)) (|least_upper_bound| (|least_upper_bound| ?X ?Y) ?Z)).
% 0.19/0.49 ; Declaring greatest_lower_bound to be commutative.
% 0.19/0.49 ; Declaring greatest_lower_bound to be associative-commutative.
% 0.19/0.49 ; Declaring least_upper_bound to be commutative.
% 0.19/0.50 ; Declaring least_upper_bound to be associative-commutative.
% 0.19/0.50
% 0.19/0.50 #||
% 0.19/0.50 % SZS status Unsatisfiable for /export/starexec/sandbox/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 ; 21 formulas have been input or derived (from 1 formulas).
% 0.19/0.50 ; 17 (81%) were retained. Of these,
% 0.19/0.50 ; 1 ( 6%) were simplified or subsumed later,
% 0.19/0.50 ; 16 (94%) are still being kept.
% 0.19/0.50 ;
% 0.19/0.50 ; Run time in seconds excluding printing time:
% 0.19/0.50 ; 0.004 14% Read assertion file (1 call)
% 0.19/0.50 ; 0.001 4% Assert (16 calls)
% 0.19/0.50 ; 0.000 0% Process new row (20 calls)
% 0.19/0.50 ; 0.000 0% Embedding (8 calls)
% 0.19/0.50 ; 0.000 0% Forward simplification (16 calls)
% 0.19/0.50 ; 0.001 4% Backward simplification (12 calls)
% 0.19/0.50 ; 0.001 4% Ordering (22 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 75% Other
% 0.19/0.50 ; 0.028 Total
% 0.19/0.50 ; 0.030 Real time
% 0.19/0.50 ;
% 0.19/0.50 ; Term-hash-array has 45 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 48 entries (48 at peak, 48 added, 0 deleted).
% 0.19/0.50 ; Path-index has 97 nodes (97 at peak, 97 added, 0 deleted).
% 0.19/0.50 ; Trie-index has 48 entries (48 at peak, 48 added, 0 deleted).
% 0.19/0.50 ; Trie-index has 64 nodes (64 at peak, 64 added, 0 deleted).
% 0.19/0.50 ; Retrieved 43 generalization terms in 56 calls.
% 0.19/0.50 ; Retrieved 13 instance terms in 13 calls.
% 0.19/0.50 ;
% 0.19/0.50 ; The agenda of input rows to give has 15 entries:
% 0.19/0.50 ; 5 with value 7 4 with value 10 4 with value 16
% 0.19/0.50 ; 1 with value 9 1 with value 14
% 0.19/0.50 Evaluation took:
% 0.19/0.50 0.03 seconds of real time
% 0.19/0.50 0.025216 seconds of user run time
% 0.19/0.50 0.00524 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 1,698,432 bytes consed.
% 0.19/0.50 :PROOF-FOUND
% 0.19/0.50 ; End refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-06-14T07:38:24
% 0.19/0.50 :PROOF-FOUND
% 0.19/0.50 *
%------------------------------------------------------------------------------