TSTP Solution File: HEN006-2 by SNARK---20120808r022
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : HEN006-2 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run-snark %s %d
% Computer : n014.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 13:02:24 EDT 2022
% Result : Unsatisfiable 1.06s 1.26s
% Output : Refutation 1.06s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 13
% Syntax : Number of clauses : 23 ( 16 unt; 0 nHn; 19 RR)
% Number of literals : 37 ( 4 equ; 17 neg)
% Maximal clause size : 6 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 7 ( 7 usr; 6 con; 0-2 aty)
% Number of variables : 32 ( 6 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(quotient_less_equal,axiom,
( ~ less_equal(X,Y)
| quotient(X,Y,zero) ),
file('/export/starexec/sandbox/benchmark/Axioms/HEN001-0.ax',quotient_less_equal) ).
cnf(less_equal_quotient,axiom,
( ~ quotient(X,Y,zero)
| less_equal(X,Y) ),
file('/export/starexec/sandbox/benchmark/Axioms/HEN001-0.ax',less_equal_quotient) ).
cnf(divisor_existence,axiom,
( ~ quotient(X,Y,Z)
| less_equal(Z,X) ),
file('/export/starexec/sandbox/benchmark/Axioms/HEN001-0.ax',divisor_existence) ).
cnf(quotient_property,axiom,
( ~ quotient(X,Y,Z)
| ~ quotient(Y,U,V)
| ~ quotient(X,U,W)
| ~ quotient(W,V,X1)
| ~ quotient(Z,U,Y1)
| less_equal(X1,Y1) ),
file('/export/starexec/sandbox/benchmark/Axioms/HEN001-0.ax',quotient_property) ).
cnf(zero_is_smallest,axiom,
less_equal(zero,X),
file('/export/starexec/sandbox/benchmark/Axioms/HEN001-0.ax',zero_is_smallest) ).
cnf(less_equal_and_equal,axiom,
( ~ less_equal(X,Y)
| ~ less_equal(Y,X)
| X = Y ),
file('/export/starexec/sandbox/benchmark/Axioms/HEN001-0.ax',less_equal_and_equal) ).
cnf(closure,axiom,
quotient(X,Y,divide(X,Y)),
file('/export/starexec/sandbox/benchmark/Axioms/HEN001-0.ax',closure) ).
cnf(well_defined,axiom,
( ~ quotient(X,Y,Z)
| ~ quotient(X,Y,U)
| Z = U ),
file('/export/starexec/sandbox/benchmark/Axioms/HEN001-0.ax',well_defined) ).
cnf(transitivity_of_less_equal,axiom,
( ~ less_equal(X,Y)
| ~ less_equal(Y,Z)
| less_equal(X,Z) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',transitivity_of_less_equal) ).
cnf(xQy,hypothesis,
quotient(x,y,xQy),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',xQy) ).
cnf(xQyLEz,hypothesis,
less_equal(xQy,z),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',xQyLEz) ).
cnf(xQz,hypothesis,
quotient(x,z,xQz),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',xQz) ).
cnf(prove_xQzLEy,negated_conjecture,
~ less_equal(xQz,y),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_xQzLEy) ).
cnf(19,plain,
quotient(xQy,z,zero),
inference('HYPERRESOLVE',[status(thm)],[quotient_less_equal,xQyLEz]) ).
cnf(25,plain,
less_equal(divide(X,Y),X),
inference('HYPERRESOLVE',[status(thm)],[divisor_existence,closure]) ).
cnf(43,plain,
less_equal(divide(xQz,divide(y,z)),divide(xQy,z)),
inference('HYPERRESOLVE',[status(thm)],[quotient_property,xQy,closure,xQz,closure,closure]) ).
cnf(94,plain,
zero = divide(xQy,z),
inference('HYPERRESOLVE',[status(thm)],[well_defined,19,closure]) ).
cnf(95,plain,
less_equal(divide(xQz,divide(y,z)),zero),
inference('REWRITE',[status(thm)],[43,94,theory(equality)]) ).
cnf(187,plain,
~ less_equal(xQz,divide(y,X)),
inference('UR-RESOLVE',[status(thm)],[transitivity_of_less_equal,25,prove_xQzLEy]) ).
cnf(240,plain,
~ quotient(xQz,divide(y,X),zero),
inference('UR-RESOLVE',[status(thm)],[less_equal_quotient,187]) ).
cnf(370,plain,
less_equal(divide(xQz,divide(y,z)),X),
inference('HYPERRESOLVE',[status(thm)],[transitivity_of_less_equal,95,zero_is_smallest]) ).
cnf(578,plain,
divide(xQz,divide(y,z)) = zero,
inference('HYPERRESOLVE',[status(thm)],[less_equal_and_equal,370,zero_is_smallest]) ).
cnf(815,plain,
$false,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[closure,578,theory(equality)]),240]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : HEN006-2 : TPTP v8.1.0. Released v1.0.0.
% 0.07/0.13 % Command : run-snark %s %d
% 0.13/0.34 % Computer : n014.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Fri Jul 1 12:59:11 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.19/0.46 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.47 *
% 0.19/0.47 *
% 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-07-01T12:59:11
% 0.19/0.47 ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n014.cluster.edu at 2022-07-01T12:59:11
% 0.19/0.49
% 0.19/0.49 ; Recognized relation function assertion (|quotient| ?X ?Y (|divide| ?X ?Y)).
% 0.19/0.49 ; Recognized relation functionality assertion (OR (NOT (|quotient| ?X ?Y ?Z)) (NOT (|quotient| ?X ?Y ?U)) (= ?Z ?U)).
% 1.06/1.26 ; Recognized possible right identity assertion (|quotient| ?X |zero| ?X).
% 1.06/1.26
% 1.06/1.26 #||
% 1.06/1.26 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 1.06/1.26 % SZS output start Refutation
% See solution above
% 1.06/1.26 ||#
% 1.06/1.26
% 1.06/1.26 ; Summary of computation:
% 1.06/1.26 ; 22056 formulas have been input or derived (from 302 formulas).
% 1.06/1.26 ; 815 ( 4%) were retained. Of these,
% 1.06/1.26 ; 94 (12%) were simplified or subsumed later,
% 1.06/1.26 ; 721 (88%) are still being kept.
% 1.06/1.26 ;
% 1.06/1.26 ; Run time in seconds excluding printing time:
% 1.06/1.26 ; 0.003 0% Read assertion file (1 call)
% 1.06/1.27 ; 0.001 0% Assert (18 calls)
% 1.06/1.27 ; 0.065 8% Process new row (13,621 calls)
% 1.06/1.27 ; 0.526 67% Resolution (602 calls)
% 1.06/1.27 ; 0.007 1% Paramodulation (301 calls)
% 1.06/1.27 ; 0.000 0% Condensing (7 calls)
% 1.06/1.27 ; 0.001 0% Forward subsumption (7 calls)
% 1.06/1.27 ; 0.000 0% Backward subsumption (7 calls)
% 1.06/1.27 ; 0.000 0% Clause clause subsumption (2 calls)
% 1.06/1.27 ; 0.109 14% Forward simplification (13,322 calls)
% 1.06/1.27 ; 0.012 2% Backward simplification (815 calls)
% 1.06/1.27 ; 0.002 0% Ordering (755 calls)
% 1.06/1.27 ; 0.000 0% Sortal reasoning (32 calls)
% 1.06/1.27 ; 0.000 0% Purity testing (1 call)
% 1.06/1.27 ; 0.061 8% Other
% 1.06/1.27 ; 0.787 Total
% 1.06/1.27 ; 0.792 Real time
% 1.06/1.27 ;
% 1.06/1.27 ; Term-hash-array has 981 terms in all.
% 1.06/1.27 ; Feature-vector-row-index has 7 entries (7 at peak, 7 added, 0 deleted).
% 1.06/1.27 ; Feature-vector-row-index has 13 nodes (13 at peak, 13 added, 0 deleted).
% 1.06/1.27 ; Retrieved 1 possibly forward subsuming row in 7 calls.
% 1.06/1.27 ; Retrieved 1 possibly backward subsumed row in 7 calls.
% 1.06/1.27 ; Path-index has 892 entries (892 at peak, 990 added, 98 deleted).
% 1.06/1.27 ; Path-index has 436 nodes (436 at peak, 440 added, 4 deleted).
% 1.06/1.27 ; Trie-index has 892 entries (892 at peak, 990 added, 98 deleted).
% 1.06/1.27 ; Trie-index has 2,225 nodes (2,225 at peak, 2,429 added, 204 deleted).
% 1.06/1.27 ; Retrieved 38,586 generalization terms in 31,253 calls.
% 1.06/1.27 ; Retrieved 1,118 instance terms in 807 calls.
% 1.06/1.27 ; Retrieved 229,263 unifiable terms in 86,404 calls.
% 1.06/1.27 ;
% 1.06/1.27 ; The agenda of rows to process has 6 entries:
% 1.06/1.27 ; 6 with value 15
% 1.06/1.27 ; The agenda of rows to give has 443 entries:
% 1.06/1.27 ; 15 with value (4 13) 57 with value (4 17) 12 with value (4 21)
% 1.06/1.27 ; 53 with value (4 14) 69 with value (4 18) 16 with value (4 22)
% 1.06/1.27 ; 102 with value (4 15) 37 with value (4 19) 1 with value (4 23)
% 1.06/1.27 ; 46 with value (4 16) 32 with value (4 20) 3 with value (4 24)
% 1.06/1.27 Evaluation took:
% 1.06/1.27 0.792 seconds of real time
% 1.06/1.27 0.717378 seconds of user run time
% 1.06/1.27 0.071402 seconds of system run time
% 1.06/1.27 [Run times include 0.018 seconds GC run time.]
% 1.06/1.27 0 calls to %EVAL
% 1.06/1.27 0 page faults and
% 1.06/1.27 60,981,160 bytes consed.
% 1.06/1.27 :PROOF-FOUND
% 1.06/1.27 ; End refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-07-01T12:59:11
% 1.06/1.27 :PROOF-FOUND
% 1.06/1.27 *
%------------------------------------------------------------------------------