TSTP Solution File: GRP193-1 by SNARK---20120808r022
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : GRP193-1 : TPTP v8.1.0. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : run-snark %s %d
% Computer : n026.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.52s 0.69s
% Output : Refutation 0.52s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 7
% Syntax : Number of clauses : 14 ( 14 unt; 0 nHn; 7 RR)
% Number of literals : 14 ( 13 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; 4 con; 0-2 aty)
% Number of variables : 11 ( 1 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(left_identity,axiom,
multiply(identity,X) = X,
file('/export/starexec/sandbox/benchmark/Axioms/GRP004-0.ax',left_identity) ).
cnf(idempotence_of_gld,axiom,
greatest_lower_bound(X,X) = X,
file('/export/starexec/sandbox/benchmark/Axioms/GRP004-2.ax',idempotence_of_gld) ).
cnf(7,plain,
greatest_lower_bound(X,greatest_lower_bound(X,Y)) = greatest_lower_bound(X,Y),
inference('EMBED',[status(thm)],[idempotence_of_gld]) ).
cnf(glb_absorbtion,axiom,
greatest_lower_bound(X,least_upper_bound(X,Y)) = X,
file('/export/starexec/sandbox/benchmark/Axioms/GRP004-2.ax',glb_absorbtion) ).
cnf(monotony_glb2,axiom,
multiply(greatest_lower_bound(X,Y),Z) = greatest_lower_bound(multiply(X,Z),multiply(Y,Z)),
file('/export/starexec/sandbox/benchmark/Axioms/GRP004-2.ax',monotony_glb2) ).
cnf(p8_9a_4,hypothesis,
greatest_lower_bound(a,b) = identity,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',p8_9a_4) ).
cnf(23,plain,
greatest_lower_bound(a,greatest_lower_bound(b,X)) = greatest_lower_bound(identity,X),
inference('EMBED',[status(thm)],[p8_9a_4]) ).
cnf(p8_9a_5,hypothesis,
least_upper_bound(greatest_lower_bound(a,multiply(b,c)),multiply(greatest_lower_bound(a,b),greatest_lower_bound(a,c))) = multiply(greatest_lower_bound(a,b),greatest_lower_bound(a,c)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',p8_9a_5) ).
cnf(25,plain,
least_upper_bound(greatest_lower_bound(a,multiply(b,c)),greatest_lower_bound(a,c)) = greatest_lower_bound(a,c),
inference('REWRITE',[status(thm)],[p8_9a_5,left_identity,p8_9a_4,theory(equality)]) ).
cnf(prove_p8_9a,negated_conjecture,
greatest_lower_bound(a,multiply(b,c)) != greatest_lower_bound(a,c),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_p8_9a) ).
cnf(30,plain,
greatest_lower_bound(identity,b) = identity,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[7,23,theory(equality)]),p8_9a_4,theory(equality)]) ).
cnf(160,plain,
greatest_lower_bound(c,greatest_lower_bound(multiply(b,c),a)) = greatest_lower_bound(a,multiply(b,c)),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[glb_absorbtion,25,theory(equality)]),idempotence_of_gld,theory(equality)]) ).
cnf(180,plain,
X = greatest_lower_bound(X,multiply(b,X)),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[monotony_glb2,30,theory(equality)]),left_identity,theory(equality)]) ).
cnf(182,plain,
$false,
inference('REWRITE',[status(thm)],[160,prove_p8_9a,180,theory(equality)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13 % Problem : GRP193-1 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.04/0.14 % Command : run-snark %s %d
% 0.15/0.36 % Computer : n026.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 600
% 0.15/0.36 % DateTime : Mon Jun 13 06:16:05 EDT 2022
% 0.15/0.36 % CPUTime :
% 0.22/0.49 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.22/0.50 *
% 0.22/0.50 *
% 0.22/0.50 #<PACKAGE "SNARK-USER">
% 0.22/0.50 *
% 0.22/0.50 SNARK-TPTP-OPTIONS
% 0.22/0.50 *
% 0.22/0.50 ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.22/0.50 (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.22/0.50 (USE-FACTORING :POS)
% 0.22/0.50 (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.22/0.50 (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.22/0.50 (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.22/0.50 (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.22/0.50 (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.22/0.50 (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.22/0.50 (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.22/0.50 (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.22/0.50 (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.22/0.51 (DECLARE-TPTP-SYMBOLS2))
% 0.22/0.51 *
% 0.22/0.51 "."
% 0.22/0.51 *
% 0.22/0.51 ; Begin refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-06-13T06:16:05
% 0.22/0.51 ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n026.cluster.edu at 2022-06-13T06:16:05
% 0.22/0.52
% 0.22/0.52 ; Recognized left identity assertion (= (|multiply| |identity| ?X) ?X).
% 0.22/0.52 ; Recognized possible left inverse assertion (= (|multiply| (|inverse| ?X) ?X) |identity|).
% 0.22/0.52 ; Recognized associativity assertion (= (|multiply| (|multiply| ?X ?Y) ?Z) (|multiply| ?X (|multiply| ?Y ?Z))).
% 0.22/0.52 ; Recognized commutativity assertion (= (|greatest_lower_bound| ?X ?Y) (|greatest_lower_bound| ?Y ?X)).
% 0.22/0.52 ; Recognized commutativity assertion (= (|least_upper_bound| ?X ?Y) (|least_upper_bound| ?Y ?X)).
% 0.22/0.52 ; Recognized associativity assertion (= (|greatest_lower_bound| ?X (|greatest_lower_bound| ?Y ?Z)) (|greatest_lower_bound| (|greatest_lower_bound| ?X ?Y) ?Z)).
% 0.22/0.52 ; Recognized associativity assertion (= (|least_upper_bound| ?X (|least_upper_bound| ?Y ?Z)) (|least_upper_bound| (|least_upper_bound| ?X ?Y) ?Z)).
% 0.22/0.52 ; Declaring greatest_lower_bound to be commutative.
% 0.22/0.52 ; Declaring greatest_lower_bound to be associative-commutative.
% 0.22/0.52 ; Declaring least_upper_bound to be commutative.
% 0.52/0.69 ; Declaring least_upper_bound to be associative-commutative.
% 0.52/0.69
% 0.52/0.69 #||
% 0.52/0.69 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.52/0.69 % SZS output start Refutation
% See solution above
% 0.52/0.69 ||#
% 0.52/0.69
% 0.52/0.69 ; Summary of computation:
% 0.52/0.69 ; 887 formulas have been input or derived (from 30 formulas).
% 0.52/0.69 ; 182 (21%) were retained. Of these,
% 0.52/0.69 ; 11 ( 6%) were simplified or subsumed later,
% 0.52/0.69 ; 171 (94%) are still being kept.
% 0.52/0.69 ;
% 0.52/0.69 ; Run time in seconds excluding printing time:
% 0.52/0.69 ; 0.005 3% Read assertion file (1 call)
% 0.52/0.69 ; 0.001 1% Assert (21 calls)
% 0.52/0.69 ; 0.019 10% Process new row (861 calls)
% 0.52/0.69 ; 0.002 1% Resolution (58 calls)
% 0.52/0.69 ; 0.021 11% Paramodulation (29 calls)
% 0.52/0.69 ; 0.004 2% Embedding (87 calls)
% 0.52/0.69 ; 0.099 53% Forward simplification (780 calls)
% 0.52/0.69 ; 0.004 2% Backward simplification (100 calls)
% 0.52/0.69 ; 0.001 1% Ordering (800 calls)
% 0.52/0.69 ; 0.004 2% Ordering ac (273 calls)
% 0.52/0.69 ; 0.000 0% Sortal reasoning (32 calls)
% 0.52/0.69 ; 0.000 0% Purity testing (1 call)
% 0.52/0.69 ; 0.027 14% Other
% 0.52/0.69 ; 0.187 Total
% 0.52/0.69 ; 0.188 Real time
% 0.52/0.69 ;
% 0.52/0.69 ; Term-hash-array has 534 terms in all.
% 0.52/0.69 ; Feature-vector-row-index has 0 entries (0 at peak, 0 added, 0 deleted).
% 0.52/0.69 ; Feature-vector-row-index has 1 node (1 at peak, 1 added, 0 deleted).
% 0.52/0.69 ; Path-index has 517 entries (519 at peak, 542 added, 25 deleted).
% 0.52/0.69 ; Path-index has 401 nodes (401 at peak, 417 added, 16 deleted).
% 0.52/0.69 ; Trie-index has 517 entries (519 at peak, 542 added, 25 deleted).
% 0.52/0.69 ; Trie-index has 198 nodes (198 at peak, 223 added, 25 deleted).
% 0.52/0.69 ; Retrieved 108,246 generalization terms in 8,231 calls.
% 0.52/0.69 ; Retrieved 343 instance terms in 123 calls.
% 0.52/0.69 ; Retrieved 1,409 unifiable terms in 150 calls.
% 0.52/0.69 ;
% 0.52/0.69 ; The agenda of rows to process has 1 entry:
% 0.52/0.69 ; 1 with value 16
% 0.52/0.69 ; The agenda of rows to give has 141 entries:
% 0.52/0.69 ; 3 with value (4 8) 10 with value (4 18) 6 with value (4 27)
% 0.52/0.69 ; 12 with value (4 11) 1 with value (4 19) 14 with value (4 28)
% 0.52/0.69 ; 5 with value (4 12) 15 with value (4 20) 2 with value (4 29)
% 0.52/0.69 ; 8 with value (4 13) 8 with value (4 21) 4 with value (4 30)
% 0.52/0.69 ; 2 with value (4 14) 6 with value (4 22) 8 with value (4 31)
% 0.52/0.69 ; 11 with value (4 15) 4 with value (4 24) 4 with value (4 33)
% 0.52/0.69 ; 10 with value (4 17) 4 with value (4 25) 4 with value (4 36)
% 0.52/0.69 Evaluation took:
% 0.52/0.69 0.189 seconds of real time
% 0.52/0.69 0.17368 seconds of user run time
% 0.52/0.69 0.015289 seconds of system run time
% 0.52/0.69 0 calls to %EVAL
% 0.52/0.69 0 page faults and
% 0.52/0.69 11,560,728 bytes consed.
% 0.52/0.69 :PROOF-FOUND
% 0.52/0.69 ; End refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-06-13T06:16:06
% 0.52/0.69 :PROOF-FOUND
% 0.52/0.69 *
%------------------------------------------------------------------------------